Daniel Cason
ABSTRACT
Gossip-based consensus protocols have been recently proposed to confront the challenges faced by state machine replication in large geographically distributed systems. It is unclear, however, to which extent consensus and gossip communication fit together. On the one hand, gossip communication has been shown to scale to large settings and efficiently handle participant failures and message losses. On the other hand, gossip may slow down consensus. Moreover, gossip's inherent redundancy may be unnecessary since consensus naturally accounts for participant failures and message losses. This paper investigates the suitability of gossip as a communication building block for consensus. We answer three questions: How much overhead does classic gossip introduce in consensus? Can we design consensus-friendly gossip protocols? Would more efficient gossip protocols still maintain the same reliability properties of classic gossip?
- [n.d.]. Libp2p. https://libp2p.io. [Accessed 2020-05-17].Google Scholar
- Marcos Kawazoe Aguilera, Wei Chen, and Sam Toueg. 1999. Using the heart-beat failure detector for quiescent reliable communication and consensus in partitionable networks. Theoretical Computer Science 220, 1 (June 1999), 3--30. Google ScholarDigital Library
- Zachary Amsden, Ramnik Arora, Shehar Bano, Mathieu Baudet, et al. 2020. The Libra Blockchain. White paper. The Libra Association. https://developers.libra.org/docs/the-libra-blockchain-paper [Accessed 2020-06-01].Google Scholar
- Elli Androulaki, Artem Barger, Vita Bortnikov, Christian Cachin, Konstantinos Christidis, Angelo De Caro, David Enyeart, Christopher Ferris, Gennady Laventman, Yacov Manevich, Srinivasan Muralidharan, Chet Murthy, Binh Nguyen, Manish Sethi, Gari Singh, Keith Smith, Alessandro Sorniotti, Chrysoula Stathakopoulou, Marko Vukolić, Sharon Weed Cocco, and Jason Yellick. 2018. Hyperledger Fabric: A Distributed Operating System for Permissioned Blockchains. In Proceedings of the Thirteenth EuroSys Conference. Article 30, 15 pages. Google ScholarDigital Library
- Paulo S. L. M. Barreto, Hae Y. Kim, Ben Lynn, and Michael Scott. 2002. Efficient Algorithms for Pairing-Based Cryptosystems. In CRYPTO, Moti Yung (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 354--369.Google Scholar
- Martin Biely, Zarko Milosevic, Nuno Santos, and Andre Schiper. 2012. S-Paxos: Offloading the Leader for High Throughput State Machine Replication. In 2012 IEEE 31st Symposium on Reliable Distributed Systems (SRDS'12). 111--120. Google ScholarDigital Library
- Kenneth P. Birman, Mark Hayden, Ozny Ozkasap, Zhen Xiao, Mihai Budiu, and Yaron Minsky. 1999. Bimodal Multicast. ACM Transactions on Computer Systems (TOCS) 17, 2 (May 1999), 41--88. Google ScholarDigital Library
- Kenneth P. Birman, Robbert van Renesse, and Werner Vogels. 2001. Spinglass: secure and scalable communication tools for mission-critical computing. In Proceedings DARPA Information Survivability Conference and Exposition II (DISCEX'01, Vol. 2). 85--99. Google ScholarCross Ref
- Romain Boichat, Partha Dutta, Svend Frølund, and Rachid Guerraoui. 2003. Deconstructing paxos. ACM SIGACT News 34, 1 (March 2003), 47--67. Google ScholarDigital Library
- Ethan Buchman, Jae Kwon, and Zarko Milosevic. 2018. The latest gossip on BFT consensus. arXiv:1807.04938 [cs.DC] https://arxiv.org/abs/1807.04938Google Scholar
- Vitalik Buterin and Virgil Griffith. 2017. Casper the Friendly Finality Gadget. (Oct. 2017). arXiv:1710.09437 [cs.CR] https://arxiv.org/abs/1710.09437Google Scholar
- Miguel Castro and Barbara Liskov. 1999. Practical Byzantine Fault Tolerance. In Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), Margo I. Seltzer and Paul J. Leach (Eds.). USENIX Association, 173--186.Google Scholar
- Tushar D. Chandra, Robert Griesemer, and Joshua Redstone. 2007. Paxos made live. In Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (PODC'07). ACM Press, 398--407. Google ScholarDigital Library
- James C. Corbett, Jeffrey Dean, and Michael et al Epstein. 2012. Spanner: Google's globally distributed database. In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation (OSDI'12). USENIX Association, USA, 251--264.Google Scholar
- Alan Demers, Dan Greene, Carl Hauser, Wes Irish, and John Larson. 1987. Epidemic algorithms for replicated database maintenance. In Proceedings of the sixth annual ACM Symposium on Principles of distributed computing (PODC'87). ACM Press, 1--12. Google ScholarDigital Library
- Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. 1988. Consensus in the presence of partial synchrony. Journal of the ACM (JACM) 35, 2 (April 1988), 288--323. Google ScholarDigital Library
- P. Erdös and J.W. Kennedy. 1987. k-Connectivity in random Graphs. European Journal of Combinatorics 8, 3 (July 1987), 281--286. Google ScholarDigital Library
- Patrick Th Eugster, Rachid Guerraoui, Sidath B. Handurukande, Petr Kouznetsov, and Anne-Marie Kermarrec. 2003. Lightweight probabilistic broadcast. ACM Transactions on Computer Systems (TOCS) 21, 4 (Nov. 2003), 341--374. Google ScholarDigital Library
- Pascal Felber and Fernando Pedone. [n. d.]. Probabilistic atomic broadcast. In Proceeedings of 21st IEEE Symposium on Reliable Distributed Systems, 2002 (SRDS '02). 170--179. Google ScholarCross Ref
- Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. 1985. Impossibility of Distributed Consensus with One Faulty Process. J. ACM 32, 2 (April 1985), 374--382. Google ScholarDigital Library
- Roy Friedman and R. van Renesse. 1995. Packing Messages as a Tool for Boosting the Performance of Total Ordering Protocols. Technical Report 94--1527. Cornell University, Dept. of Computer Science. Submitted to IEEE Transactions on Networking.Google Scholar
- Ayalvadi J. Ganesh, Anne-Marie Kermarrec, and Laurent Massoulié. 2003. Peer-to-peer membership management for gossip-based protocols. IEEE Trans. Comput. 52, 2 (Feb. 2003), 139--149. Google ScholarDigital Library
- Indranil Gupta, Kenneth P. Birman, and Robbert van Renesse. 2002. Fighting fire with fire: using randomized gossip to combat stochastic scalability limits. Quality and Reliability Engineering International 18, 3 (May 2002), 165--184. Google ScholarCross Ref
- Heidi Howard, Malte Schwarzkopf, Anil Madhavapeddy, and Jon Crowcroft. 2015. Raft Refloated. ACM SIGOPS Operating Systems Review 49,1 (Jan. 2015), 12--21. Google ScholarDigital Library
- Bert Hubert, Gregory Maxwell, Martijn van Oosterhout, Remco van Mook, Paul B. Schroeder, et al. 2002. Linux Advanced Routing & Traffic Control HOWTO. https://lartc.org/lartc.html. [Accessed 2020-05-17].Google Scholar
- Håvard Johansen, André Allavena, and Robbert van Renesse. 2006. Fireflies: scalable support for intrusion-tolerant network overlays. ACM SIGOPS Operating Systems Review 40, 4 (April 2006), 3--13. Google ScholarDigital Library
- David Kempe, Jon Kleinberg, and Alan Demers. 2004. Spatial gossip and resource location protocols. Journal of the ACM (JACM) 51, 6 (Nov. 2004), 943--967. Google ScholarDigital Library
- Jonathan Kirsch and Yair Amir. 2008. Paxos for System Builders. In Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware (LADIS'08). ACM Press, Article 3, 6 pages. Google ScholarDigital Library
- Leslie Lamport. 1978. Time, Clocks, and the Ordering of Events in a Distributed System. Commun. ACM 21, 7 (July 1978), 558--565. Google ScholarDigital Library
- Leslie Lamport. 1998. The part-time parliament. ACM Transactions on Computer Systems 16, 2 (May 1998), 133--169. Google ScholarDigital Library
- Leslie Lamport. 2005. Generalized Consensus and Paxos. Technical Report MSR-TR-2005--33. Microsoft Research. https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/tr-2005-33.pdfGoogle Scholar
- Leslie Lamport. 2006. Fast Paxos. Distributed Computing 19, 2 (June 2006), 79--103. Google ScholarDigital Library
- Leslie Lamport. 2006. Lower bounds for asynchronous consensus. Distributed Computing 19, 2 (jun 2006), 104--125. Google ScholarDigital Library
- Butler W. Lampson. 2001. The ABCD's of Paxos. In Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing (PODC'01). 13 pages. Google ScholarDigital Library
- Joao Leitao, Jose Pereira, and Luis Rodrigues. 2007. Epidemic Broadcast Trees. In 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007). 301--310. Google ScholarCross Ref
- Meng-Jang Lin and Keith Marzullo. 1999. Directional Gossip: Gossip in a Wide Area Network. In Proceedings of Third European Dependable Computing Conference (EDCC-3). Springer Berlin Heidelberg, 364--379. Google ScholarCross Ref
- Yanhua Mao, Flavio P. Junqueira, and Keith Marzullo. 2008. Mencius: Building Efficient Replicated State Machines for WANs. In Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation (San Diego, California) (OSDI'08). USENIX Association, 369--384.Google Scholar
- Parisa Jalili Marandi, Samuel Benz, Fernando Pedonea, and Kenneth P. Birman. 2014. The Performance of Paxos in the Cloud. In IEEE 33rd International Symposium on Reliable Distributed Systems. 41--50. Google ScholarDigital Library
- Parisa Jalili Marandi, Marco Primi, Nicolas Schiper, and Fernando Pedone. 2010. Ring Paxos: A high-throughput atomic broadcast protocol. In Proceedings of IEEE/IFIP International Conference on Dependable Systems and Networks (DSN '10). 527--536. Google ScholarCross Ref
- Roie Melamed and Idit Keidar. 2004. Araneola: a scalable reliable multicast system for dynamic environments. In Third IEEE International Symposium on Network Computing and Applications (NCA 2004). Google ScholarCross Ref
- Iulian Moraru, David G. Andersen, and Michael Kaminsky. 2013. There is More Consensus in Egalitarian Parliaments. In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles (SOSP '13). 358--372. Google ScholarDigital Library
- Moni Naor and Eylon Yogev. 2013. Sliding Bloom Filters. In Algorithms and Computation. Springer Berlin Heidelberg, 513--523. Google ScholarCross Ref
- Diego Ongaro and John Ousterhout. 2014. In Search of an Understandable Consensus Algorithm. In 2014 USENIX Annual Technical Conference (USENIX ATC 14). USENIX Association, 305--319.Google ScholarDigital Library
- Derek C. Oppen and Yogen K. Dalal. 1983. The clearinghouse: a decentralized agent for locating named objects in a distributed environment. ACM Transactions on Information Systems (TOIS) 1, 3 (July 1983), 230--253. Google ScholarDigital Library
- Fred B. Schneider. 1990. Implementing fault-tolerant services using the state machine approach: a tutorial. Comput. Surveys 22, 4 (Dec. 1990), 299--319. Google ScholarDigital Library
- Libra Engineering Team. 2018. Libra: The path forward. Online. https://libra.org/en-US/blog/the-path-forward/ [Accessed 2020-06-01].Google Scholar
- Robbert van Renesse, Kenneth Birman, Dan Dumitriu, and Werner Vogels. 2002. Scalable Management and Data Mining Using Astrolabe*. In Peer-to-Peer Systems. Springer Berlin Heidelberg, 280--294. Google ScholarCross Ref
- Robbert van Renesse, Yaron Minsky, and Mark Hayden. 1998. A Gossip-Style Failure Detection Service. In Middleware'98. Springer London, 55--70. Google ScholarCross Ref
- Werner Vogels, Robbert van Renesse, and Ken Birman. 2003. The power of epidemics. ACM SIGCOMM Computer Communication Review 33, 1 (Jan. 2003), 131--135. Google ScholarDigital Library
- Spyros Voulgaris and Maartenvan Steen. 2013. Vicinity: A Pinch of Randomness Brings out the Structure. In Middleware 2013. Springer Berlin Heidelberg, 21--40. Google ScholarCross Ref
- Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan Gueta, and Ittai Abraham. 2018. HotStuff: BFT Consensus in the Lens of Blockchain. arXiv:1803.05069 [cs.DC] https://arxiv.org/abs/1803.05069v6Google Scholar
Index Terms
- Gossip consensus
Recommendations
Heterogeneous gossip
Middleware '09: Proceedings of the 10th ACM/IFIP/USENIX International Conference on MiddlewareGossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. Load-balancing is inherent in these protocols as the dissemination work is evenly spread among all nodes. Yet, large-scale ...
GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks
Abstract In peer-to-peer (P2P) networks, reputation aggregation and ranking are the most time-consuming and space-demanding operations. This paper proposes a new gossip protocol for fast score aggregation. We developed a Bloom filter architecture for ...
Gossip-Style Failure Detection and Distributed Consensus for Scalable Heterogeneous Clusters
Gossip protocols provide a means by which failures can be detected in large, distributed systems in an asynchronous manner without the limits associated with reliable multicasting for group communications. However, in order to be effective with ...
Comments