Network Topology and Fault-Tolerant Consensus

Abstract As the structure of contemporary communication networks grows more complex, practical networked distributed systems become prone to component failures. Fault-tolerant consensus in message-...

[1]  Leslie Lamport,et al.  The part-time parliament , 1998, TOCS.

[2]  Danny Dolev,et al.  Optimal Resilience Asynchronous Approximate Agreement , 2004, OPODIS.

[3]  Achour Mostéfaoui,et al.  Conditions on input vectors for consensus solvability in asynchronous distributed systems , 2001, STOC '01.

[4]  André Schiper,et al.  Tolerating permanent and transient value faults , 2013, Distributed Computing.

[5]  Roy Friedman,et al.  Distributed Agreement and Its Relation with Error-Correcting Codes , 2002, DISC.

[6]  Nitin H. Vaidya,et al.  Iterative Byzantine Vector Consensus in Incomplete Graphs , 2013, ICDCN.

[7]  George Cybenko,et al.  Dynamic Load Balancing for Distributed Memory Multiprocessors , 1989, J. Parallel Distributed Comput..

[8]  A. Jadbabaie,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[9]  Peter Robinson,et al.  Agreement in Directed Dynamic Networks , 2012, SIROCCO.

[10]  Vicsek,et al.  Novel type of phase transition in a system of self-driven particles. , 1995, Physical review letters.

[11]  Ran Canetti,et al.  Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[12]  Achour Mostéfaoui,et al.  Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with $$t , 2016, Acta Informatica.

[13]  Achour Mostéfaoui,et al.  Condition-based consensus solvability: a hierarchy of conditions and efficient protocols , 2003, Distributed Computing.

[14]  Danny Dolev,et al.  The Byzantine Generals Strike Again , 1981, J. Algorithms.

[15]  Dan Alistarh,et al.  How to Solve Consensus in the Smallest Window of Synchrony , 2008, DISC.

[16]  Andrzej Pelc,et al.  Broadcasting with locally bounded Byzantine faults , 2005, Inf. Process. Lett..

[17]  Aris Pagourtzis,et al.  A Graph Parameter That Matches the Resilience of the Certified Propagation Algorithm , 2013, ADHOC-NOW.

[18]  Lewis Tseng,et al.  Asynchronous convex hull consensus in the presence of crash faults , 2014, PODC '14.

[19]  Aris Pagourtzis,et al.  Reliable Broadcast with Respect to Topology Knowledge , 2014, DISC.

[20]  Shreyas Sundaram,et al.  Robustness of complex networks with implications for consensus and contagion , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[21]  Lewis Tseng,et al.  Iterative Approximate Consensus in the Presence of Byzantine Link Failures , 2014, NETYS.

[22]  Achour Mostéfaoui,et al.  The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement , 2008, SIAM J. Comput..

[23]  Achour Mostéfaoui,et al.  Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach , 1999, DISC.

[24]  Gil Neiger,et al.  Distributed Consensus Revisited , 1994, Inf. Process. Lett..

[25]  Roger M. Kieckhafer,et al.  Reaching Approximate Agreement with Mixed-Mode Faults , 1994, IEEE Trans. Parallel Distributed Syst..

[26]  Shreyas Sundaram,et al.  Consensus of multi-agent networks in the presence of adversaries using only local information , 2012, HiCoNS '12.

[27]  Rainer Hegselmann,et al.  Opinion dynamics and bounded confidence: models, analysis and simulation , 2002, J. Artif. Soc. Soc. Simul..

[28]  Maiko Shigeno,et al.  A new parameter for a broadcast algorithm with locally bounded Byzantine faults , 2010, Inf. Process. Lett..

[29]  Jon Atli Benediktsson,et al.  Consensus theoretic classification methods , 1992, IEEE Trans. Syst. Man Cybern..

[30]  Moti Yung,et al.  Perfectly secure message transmission , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[31]  Achour Mostéfaoui,et al.  Byzantine Consensus with Few Synchronous Links , 2007, OPODIS.

[32]  Chiu-Yuen Koo,et al.  Broadcast in radio networks tolerating byzantine adversarial behavior , 2004, PODC '04.

[33]  Nancy A. Lynch,et al.  Are wait-free algorithms fast? , 1994, JACM.

[34]  Keith Marzullo,et al.  Synchronous Consensus for dependent process failures , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[35]  Lewis Tseng,et al.  Recent Results on Fault-Tolerant Consensus in Message-Passing Networks , 2016, SIROCCO.

[36]  Achour Mostéfaoui,et al.  Leader-Based Consensus , 2001, Parallel Process. Lett..

[37]  Dan Alistarh,et al.  Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement , 2011, Algorithmica.

[38]  Achour Mostéfaoui,et al.  Signature-free asynchronous byzantine consensus with t < n/3 and o(n2) messages , 2014, PODC.

[39]  Achour Mostéfaoui,et al.  Intrusion-Tolerant Broadcast and Agreement Abstractions in the Presence of Byzantine Processes , 2016, IEEE Transactions on Parallel and Distributed Systems.

[40]  Achour Mostéfaoui,et al.  Minimal Synchrony for Byzantine Consensus , 2015, PODC.

[41]  Achour Mostéfaoui,et al.  A hierarchy of conditions for consensus solvability , 2001, PODC '01.

[42]  Michel Raynal,et al.  Consensus in Byzantine asynchronous systems , 2003, J. Discrete Algorithms.

[43]  Xenofon D. Koutsoukos,et al.  Low complexity resilient consensus in networked multi-agent systems with adversaries , 2012, HSCC '12.

[44]  Michel Raynal,et al.  Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors , 2013, PODC '13.

[45]  Matthias Függer,et al.  Tight Bounds for Asymptotic and Approximate Consensus , 2017, PODC.

[46]  Peter Robinson,et al.  Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks , 2015, NETYS.

[47]  Matthias Függer,et al.  Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms , 2014, ICALP.

[48]  Rachid Guerraoui,et al.  The information structure of indulgent consensus , 2004, IEEE Transactions on Computers.

[49]  Ashish Choudhury,et al.  Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited , 2018, IACR Cryptol. ePrint Arch..

[50]  Arpita Patra,et al.  Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity , 2011, OPODIS.

[51]  Achour Mostéfaoui,et al.  Condition-Based Protocols for Set Agreement Problems , 2002, DISC.

[52]  C. Pandu Rangan,et al.  Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience , 2011, ICITS.

[53]  Achour Mostéfaoui,et al.  Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n2) Messages, and Constant Time , 2015, SIROCCO.

[54]  Brian A. Coan,et al.  Achieving consensus in fault-tolerant distributed computer systems: protocols, lower bounds, and simulations , 1987 .

[55]  Nitin H. Vaidya,et al.  Reaching approximate Byzantine consensus with multi-hop communication , 2014, Inf. Comput..

[56]  Nitin H. Vaidya,et al.  Byzantine vector consensus in complete graphs , 2013, PODC '13.

[57]  Maurice Herlihy,et al.  Multidimensional approximate agreement in Byzantine asynchronous systems , 2013, STOC '13.

[58]  Sébastien Tixeuil,et al.  Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures , 2018, SSS.

[59]  Lewis Tseng,et al.  Iterative approximate byzantine consensus in arbitrary directed graphs , 2012, PODC '12.

[60]  Xenofon Koutsoukos,et al.  Consensus in networked multi-agent systems with adversaries , 2011 .

[61]  Ueli Maurer,et al.  Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract) , 1997, PODC '97.

[62]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[63]  Alan Fekete,et al.  Asymptotically optimal algorithms for approximate agreement , 1986, PODC '86.

[64]  Matthias Fitzi,et al.  Optimally efficient multi-valued byzantine agreement , 2006, PODC '06.

[65]  Leslie Lamport,et al.  The Weak Byzantine Generals Problem , 1983, JACM.

[66]  Ashish Choudhury,et al.  Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract) , 2018, SIROCCO.

[67]  Brian A. Coan,et al.  Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement , 1984, Inf. Process. Lett..

[68]  Roberto Tempo,et al.  Resilient randomized quantized consensus , 2016, 2016 American Control Conference (ACC).

[69]  C. Pandu Rangan,et al.  Communication Optimal Multi-valued Asynchronous Broadcast Protocol , 2010, LATINCRYPT.

[70]  Lewis Tseng,et al.  Fault-Tolerant Consensus in Directed Graphs , 2015, PODC.