Asynchronous Binary Byzantine Consensus over Graphs with Power-Law Degree Sequence

Abstract : Consensus problems are of great interest in distributed systems research, especially in the presence of Byzantine faults. While asynchronous message passing is an interesting network model, Fischer, et al. [17] have shown that deterministic algorithms do not exist even for single faults, requiring the use of randomization as proposed by Ben-Or [6].While most approaches implicitly assume full connectivity, the case of non-complete graphs is particularly interesting when studying the feasibility and efficiency of consensus problems. This topic has received limited scrutiny despite the fact that non-complete graph structures are ubiquitous in many networks that require low overall latency and reliable signaling (e.g., electrical power networks). One of the core benefits of such an approach is the ability to rely on redundant sensors in large networks for detecting faults and adversarial actions without impacting real-time behavior. It is, therefore, critical to minimize the message complexity in consensus algorithms.This paper studies the existence and efficiency of randomized asynchronous binary Byzantine consensus for graphs in the $G(n,\vec{d})$ configuration model with a power-law degree sequence. The main contribution is an algorithm that explicitly utilizes the network structure to gain efficiency over a simple randomized algorithm while allowing the identification of possible additional edges in the graph to satisfy redundancy requirements.
Type de document :
Communication dans un congrès
Jonathan Butts; Sujeet Shenoi. 8th International Conference on Critical Infrastructure Protection (ICCIP), Mar 2014, Arlington, United States. Springer, IFIP Advances in Information and Communication Technology, AICT-441, pp.263-276, 2014, Critical Infrastructure Protection VIII. 〈10.1007/978-3-662-45355-1_17〉
Liste complète des métadonnées

Littérature citée [29 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01386770
Contributeur : Hal Ifip <>
Soumis le : lundi 24 octobre 2016 - 15:34:18
Dernière modification le : lundi 24 octobre 2016 - 15:40:27

Fichier

978-3-662-45355-1_17_Chapter.p...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Goitom Weldehawaryat, Stephen Wolthusen. Asynchronous Binary Byzantine Consensus over Graphs with Power-Law Degree Sequence. Jonathan Butts; Sujeet Shenoi. 8th International Conference on Critical Infrastructure Protection (ICCIP), Mar 2014, Arlington, United States. Springer, IFIP Advances in Information and Communication Technology, AICT-441, pp.263-276, 2014, Critical Infrastructure Protection VIII. 〈10.1007/978-3-662-45355-1_17〉. 〈hal-01386770〉

Partager

Métriques

Consultations de la notice

46

Téléchargements de fichiers

47