Scalable and leaderless Byzantine consensus in cloud computing environments

Traditional Byzantine consensus in distributed systems requires n ≥ 3f + 1, where n is the number of nodes. In this paper, we present a scalable and leaderless Byzantine consensus implementation based on gossip, requiring only n ≥ 2f + 1 nodes. Unlike conventional distributed systems, the network topology of cloud computing systems is often not fully connected, but loosely coupled and layered. Hence, we revisit the Byzantine consensus problem in cloud computing environments, in which each node maintains some number of neighbors, called local view. The message complexity of our Byzantine consensus scheme is O(n), instead of O(n2). Experimental results and correctness proof show that our Byzantine consensus scheme can solve the Byzantine consensus problem safely in a scalable way without a bottleneck and a leader in cloud computing environments.

[1]  Zibin Zheng,et al.  BFTCloud: A Byzantine Fault Tolerance Framework for Voluntary-Resource Cloud Computing , 2011, 2011 IEEE 4th International Conference on Cloud Computing.

[2]  Alysson Neves Bessani,et al.  An Efficient Byzantine-Resilient Tuple Space , 2009, IEEE Transactions on Computers.

[3]  Scott Shenker,et al.  Attested append-only memory: making adversaries stick to their word , 2007, SOSP.

[4]  Miguel Correia,et al.  How to tolerate half less one Byzantine nodes in practical distributed systems , 2004, Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004..

[5]  Fred B. Schneider,et al.  Implementing fault-tolerant services using the state machine approach: a tutorial , 1990, CSUR.

[6]  Barry W. Johnson.  Fault-Tolerant Microprocessor-Based Systems , 1984, IEEE Micro.

[7]  Deepak Dahiya,et al.  Round Robin with Server Affinity: A VM Load Balancing Algorithm for Cloud Based Infrastructure , 2013, J. Inf. Process. Syst..

[8]  Johannes Behl,et al.  CheapBFT: resource-efficient byzantine fault tolerance , 2012, EuroSys '12.

[9]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

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

[11]  Rajkumar Buyya,et al.  Article in Press Future Generation Computer Systems ( ) – Future Generation Computer Systems Cloud Computing and Emerging It Platforms: Vision, Hype, and Reality for Delivering Computing as the 5th Utility , 2022 .

[12]  Anne-Marie Kermarrec,et al.  Peer-to-Peer Membership Management for Gossip-Based Protocols , 2003, IEEE Trans. Computers.

[13]  Miguel Castro,et al.  Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.

[14]  Arun Venkataramani,et al.  Separating agreement from execution for byzantine fault tolerant services , 2003, SOSP '03.

[15]  Fred B. Schneider,et al.  Byzantine generals in action: implementing fail-stop processors , 1984, TOCS.

[16]  Shu-Chin Wang,et al.  Achieving efficient agreement within a dual-failure cloud-computing environment , 2011, Expert Syst. Appl..

[17]  John E. Hopcroft,et al.  Correctness of a gossip based membership protocol , 2005, PODC '05.

[18]  John Lane,et al.  Prime: Byzantine Replication under Attack , 2011, IEEE Transactions on Dependable and Secure Computing.

[19]  Idit Keidar,et al.  Correctness of gossip-based membership under message loss , 2009, PODC '09.

[20]  Kathryn Bock,et al.  Reaching agreement , 2011 .

[21]  Michael K. Reiter,et al.  Byzantine quorum systems , 1997, STOC '97.

[22]  Kyle Chard,et al.  Social Cloud Computing: A Vision for Socially Motivated Resource Sharing , 2012, IEEE Transactions on Services Computing.

[23]  Mark Newman,et al.  Networks: An Introduction , 2010 .

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

[25]  Vijay K. Garg.  Implementing Fault-Tolerant Services Using State Machines: Beyond Replication , 2010, DISC.

[26]  Joan Jacobs.  Correctness of Gossip-Based Membership under Message Loss , 2009 .

[27]  Miguel Correia,et al.  Efficient Byzantine Fault-Tolerance , 2013, IEEE Transactions on Computers.

[28]  Miguel Oom Temudo de Castro,et al.  Practical Byzantine fault tolerance , 1999, OSDI '99.