Information Systems Frontiers

, Volume 16, Issue 1, pp 19–34

Scalable and leaderless Byzantine consensus in cloud computing environments

  • JongBeom Lim
  • Taeweon Suh
  • JoonMin Gil
  • Heonchang Yu
Article

DOI: 10.1007/s10796-013-9460-7

Cite this article as:
Lim, J., Suh, T., Gil, J. et al. Inf Syst Front (2014) 16: 19. doi:10.1007/s10796-013-9460-7

Abstract

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.

Keywords

Byzantine fault tolerance Consensus Gossip Cloud computing 

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • JongBeom Lim
    • 1
  • Taeweon Suh
    • 1
  • JoonMin Gil
    • 2
  • Heonchang Yu
    • 1
  1. 1.Department of Computer Science EducationKorea UniversitySeoulKorea
  2. 2.School of Computer & Information Communications EngineeringCatholic University of DaeguDaeguKorea

Personalised recommendations