Search

Your search keyword '"Département d'Informatique [Béjaïa]"' showing total 8 results
Start Over Author "Département d'Informatique [Béjaïa]"
8 results on '"Département d'Informatique [Béjaïa]"'

1. Impact of Duty-Cycling

Author

Abdelkamel Tari, Nassima Bouadem, Rahim Kacimi, Département d'Informatique [Béjaïa], Université Abderrahmane Mira [Béjaïa], Temps Réel dans les Réseaux et Systèmes (IRIT-T2RS), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), and Université Fédérale Toulouse Midi-Pyrénées

Subjects
Computer Networks and Communications, business.industry, Computer science, Quality of service, 020208 electrical & electronic engineering, 020206 networking & telecommunications, Energy Consumption, 02 engineering and technology, Duty-Cycling, Network dynamics, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS, Application layer, Management Information Systems, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Software deployment, Sensor node, 0202 electrical engineering, electronic engineering, information engineering, Wireless Sensor Networks, Routing (electronic design automation), business, Wireless sensor network, Network Lifetime, Computer network, Efficient energy use
Abstract

International audience; Wireless Sensor Networks (WSNs) became omnipresent in our daily life. As a result, they have emerged as a fruitful research topic, because of their advantages, especially their low cost and easy deployment. However, these attractive merits imply that available resources, especially energy, in each sensor node have to be wisely used through different network dynamics. Besides other techniques, duty-cycling (DC) is the first widely used one to save energy in WSNs. However, due to the continuous changes, mainly in the energy availability, the nodes have to operate in a very low DC which is a required strategy in many applications in order to keep the network operational. This article presents a detailed survey that provides an interesting view of different DC schemes that are proposed to tackle the specific WSN challenges, and it also gives a novel classification of DC schemes that includes the most recent techniques. The last part aims to investigate the impact of the low DC on both the network and the application layer.

Published
2016
Full Text
View/download PDF

2. FDRA: Fault Detection and Recovery Algorithm for Wireless Sensor Networks

Author

Ado Adamou Abba Ari, Chafiq Titouna, Hamouma Moumen, Université de M'Slia, Department of Computer Science, Université Mustapha Ben Boulaid de Batna 2, Laboratoire d'Informatique Parallélisme Réseaux Algorithmes Distribués (LI-PaRAD), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), Département d'Informatique [Béjaïa], and Université Abderrahmane Mira [Béjaïa]

Subjects
Computer science, Network packet, 020206 networking & telecommunications, Fault tolerance, 02 engineering and technology, Fault (power engineering), Fault detection and isolation, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0202 electrical engineering, electronic engineering, information engineering, Overhead (computing), 020201 artificial intelligence & image processing, Wireless sensor network, Algorithm, ComputingMilieux_MISCELLANEOUS
Abstract

Failures are inevitable in wireless sensor network, and it is important to detect and recover faulty nodes. In this paper, we present an algorithm to recover faulty nodes called Fault detection and Recovery Algorithm (FDRA). The performance evaluation is tested through simulation to evaluate some factors such as: Packet delivery ratio, control overhead, memory overhead and fault recovery delay. We compared our results with referenced algorithm: Fault Detection in Wireless Sensor Networks (FDWSN), and found that our FDRA performance outperforms that of FDWSN.

Published
2018
Full Text
View/download PDF

3. Signature-Free Asynchronous Binary Byzantine Consensus with t$<$n/3, O(n²) Messages, and O(1) Expected Time

Author

Mostéfaoui, Achour, Moumen, Hamouma, Raynal, Michel, Gestion de Données Distribuées [Nantes] (GDD), Laboratoire d'Informatique de Nantes Atlantique (LINA), Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS), Département d'Informatique [Béjaïa], Université Abderrahmane Mira [Béjaïa], As Scalable As Possible: foundations of large scale dynamic distributed systems (ASAP), SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), ANR-11-BS02-0014,DISPLEXITY,Calculabilité et complexité en distribué(2011), ANR-14-CE35-0010,DISCMAT,Mathematical Methods in Distributed Computing(2014), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)

Subjects
Randomized algorithm, Consensus, Byzantine process, Distributed algorithm, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Optimal resilience, ACM: D.: Software/D.4: OPERATING SYSTEMS/D.4.5: Reliability/D.4.5.2: Fault-tolerance, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.2: Computability theory, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems/C.2.4.3: Network operating systems, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.3: Relations between models, Asynchronous message-passing system, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.3: Parallelism and concurrency, ACM: D.: Software/D.1: PROGRAMMING TECHNIQUES/D.1.3: Concurrent Programming, Simplicity, Broadcast abstraction, [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], Signature-free algorithm, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems/C.2.4.1: Distributed applications, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.0: Alternation and nondeterminism, Common coin, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract

International audience; This paper is on broadcast and agreement in asynchronous message-passing systems made up of n processes, and where up to t processes may have a Byzantine Behavior. Its first contribution is a powerful , yet simple, all-to-all broadcast communication abstraction suited to binary values. This abstraction, which copes with up to t < n/3 Byzantine processes, allows each process to broadcast a binary value, and obtain a set of values such that (1) no value broadcast only by Byzantine processes can belong to the set of a correct process, and (2) if the set obtained by a correct process contains a single value v, then the set obtained by any correct process contains v. The second contribution of the paper is a new round-based asynchronous consensus algorithm that copes with up to t < n/3 Byzantine processes. This algorithm is based on the previous binary broadcast abstraction and a weak common coin. In addition of being signature-free and optimal with respect to the value of t, this consensus algorithm has several noteworthy properties: the expected number of rounds to decide is constant; each round is composed of a constant number of communication steps and involves O(n²) messages; each message is composed of a round number plus a constant number of bits. Moreover , the algorithm tolerates message reordering by the adversary (i.e., the Byzantine processes).

Published
2015
Full Text
View/download PDF

4. Adaptive Group Key Management Protocol for Wireless Communications

Author

Gharout, S., Bouabdallah, A., Yacine CHALLAL, Achemlal, M., Challal, Yacine, Orange Labs [Caen], Orange Labs, Département d'Informatique [Béjaïa], Université Abderrahmane Mira [Béjaïa], Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), and Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS)

Subjects
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], group communication, key management, confidentiality, mobility
Abstract

International audience; Group-oriented services and wireless communication networks are among the emerging technologies of the last few years. Group key management, which is an important building bloc in securing group communication, has received a particularattention in both academic and industry research communities. This is due to the economical relevance of group-based applications, such as video on demand, videoconferencing, collaborative work. The key management concerns the distribution and updates of the key material each time a member joins or leaves the group. The dynamic aspect of group applications due to free membership joins and leaves in addition to members' mobility makes difficult the design of efficient and scalable key management protocols. Indeed, to secure group communication in mobile environment, the protocol must deal not only with dynamic group membership but also with dynamic member location. Thus, the challenges in designing secure and scalable key management protocols are: the dynamic updates of the key caused by frequent joins and leaves, the large size of the group and the mobility of group members. Many academic researches have addressed the first and the third challenges. However the mobility challenge has not been widely addressed. In this paper, we present our solution for group key management with a mobility support. Our protocol focuses on the above three challenges. It is highly scalable to dynamic groups and treats the nodes' mobility with a null re-keying cost and keeps perfect backward and forward secrecies. Our simulation studies show that our protocol makes better performance compared to other protocols while reducing the overall overhead and the number of re-keying messages and has no security failures.

Published
2012

5. Sécurité des communications dans les groupes dynamiques et mobiles

Author

Gharout, Saïd, Bouabdallah, Abdelmadjid, Challal, Yacine, Département d'Informatique [Béjaïa], Université Abderrahmane Mira [Béjaïa], Orange Labs [Caen], Orange Labs, Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), and Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS)

Subjects
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], ComputingMilieux_MISCELLANEOUS
Abstract

National audience

Published
2010

6. Time-Free Authenticated Byzantine Consensus

Author

Achour Mostefaoui, Hamouma Moumen, Département d'Informatique [Béjaïa], Université Abderrahmane Mira [Béjaïa], As Scalable As Possible: foundations of large scale dynamic distributed systems (ASAP), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), IEEE, Franck Capello and Hans-Peter Schwefel, Mostefaoui, Achour, SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Theoretical computer science, Consensus, Byzantine process, Computer science, Distributed computing, Context (language use), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Uniform consensus, Set (abstract data type), 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Time-free assumption, Byzantine fault tolerance, 020203 distributed computing, Authentication, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems, Bi-source, Message passing, Leader based solution, Quantum Byzantine agreement, 010201 computation theory & mathematics, Distributed algorithm, Distributed system, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Byzantine architecture
Abstract

This paper presents a simple protocol that solves the authenticated ByzantineConsensus problem in asynchronous distributed systems. To circumvent the FLP impossibility result in a deterministic way, synchrony assumptions should be added. In the context of Byzantine failures for systems where at most t processes may exhibit a Byzantine behavior and where not all the system is assumed eventually synchronous, Moumen et al. provide the main result. They assume at least one correct process, called 2t-bisource, connected with 2t privileged neighbors with eventually timely outgoing and incoming links. The present paper shows that a deterministic solution for the authenticated byzantine consensus problem is possible if the system model satisfies an additional assumption that does not rely on physical time but on the pattern of messages that are exchanged. The basic message exchange between processes is the query-response mechanism. To solve the Consensus problem, we assume a correct process p, called eventual 2t-winning process, and a set Q of 2t processes such that, eventually, for each query issued by p, any process q of Q receives a response from p among the (n-t) first responses to that query. The processes in the set Q can exhibit a Byzantine behavior and this set may change over time. Whereas many time-free solutions have been designed for the consensus problem in the crash model, this is, to our knowledge, the first time-free deterministic solution to the Byzantine consensus problem., Cet article présente un protocole de consensus dans un système asynchrone où un certain nombre de processus (au plus t) peuvent exhiber un comportement byzantin. Il est connu que ce problème n'a pas de solution dans un tel contexte c'est pour cela qu'il faut renforcer le système asynchrone de base avec des contraintes temporelles ou structurelles qui puisse rendre le problème décidable. La démarche choisie dans cet article puisque c'est la première fois que la contrainte rajoutée n'est pas temorelles mais repose sur la pattern de message échangé par les processus.

Published
2010

7. EAMOMAC : un environnement d'aide à la modélisation à base de modèles de Markov cachés

Author

Omar, Mawloud, Hamadouche, Mâamar, Loukam, Mourad, Département d'Informatique [Béjaïa], Université Abderrahmane Mira [Béjaïa], Université de Saâd Dahlab [Blida] (USDB ), and Université Hassiba Ben Bouali de Chlef (UHBC)

Subjects
[INFO]Computer Science [cs]
Abstract

International audience; Les modèles de Markov cachés (ou MMC) suscitent depuis plusieurs années un vif intérêt dans le domaine de la modélisation et se sont rapidement imposés comme une référence dans plusieurs applications, comme : la reconnaissance de la parole, la reconnaissance optique, la classification automatique, l’extraction de données textuelles, la reconnaissance des séquences d’ADN, etc. Dans cet article, nous présentons notre système EAMOMAC (Environnement d’aide à la Modélisation à base de modèles de Markov cachés). EAMOMAC est un système offrant un environnement interactif qui permet de résoudre les problèmes essentiels des MMC : l’évaluation, le décodage et l’apprentissage.

Published
2007

8. Byzantine consensus with few synchronous links

Author

Moumen Hamouma, Gilles Trédan, Achour Mostefaoui, Département d'Informatique [Béjaïa], Université Abderrahmane Mira [Béjaïa], As Scalable As Possible: foundations of large scale dynamic distributed systems (ASAP), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Eduardo Tovar and Philippas Tsigas and Hacène Fouchal, SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
021110 strategic, defence & security studies, business.industry, Computer science, Distributed computing, 0211 other engineering and technologies, Context (language use), Fault tolerance, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, System model, Quantum Byzantine agreement, Consensus, 010201 computation theory & mathematics, Asynchronous communication, Distributed algorithm, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, Byzantine fault tolerance, ComputingMilieux_MISCELLANEOUS, Computer network
Abstract

This paper tackles the consensus problem in asynchronous systems prone to byzantine failures. One way to circumvent the FLP impossibility result consists in adding synchrony assumptions (deterministic solution). In the context of crash failures (at most t processes may crash), the weakest partially synchronous system model assumes at least one correct process with outgoing links that eventually permit a bounded transmission delay with at least t neighbors (the set of neighbors may change over time). Aguilera et al. provided the main result for systems where at most t processes may exhibit a byzantine behavior. They assume a correct process with all its outgoing and incoming links eventually timely. This paper considers a system model with at least one correct process connected with x privileged neighbors with eventually timely outgoing and incoming links. In this system model, a byzantine consensus protocol is proposed. It uses authentication and assumes x ≥ 2t.

Catalog

Books, media, physical & digital resources
See catalog results