Scalable and leaderless Byzantine consensus in cloud computing environments

Jongbeom Lim, Taeweon Suh, Joonmin Gil, Heonchang Yu

Research output: Contribution to journalArticle

12 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)19-34
Number of pages16
JournalInformation Systems Frontiers
Volume16
Issue number1
DOIs
Publication statusPublished - 2014 Jan 1

Fingerprint

Cloud computing
Cloud Computing
Consensus Problem
Distributed Systems
Vertex of a graph
Message Complexity
Gossip
Topology
Network Topology
Correctness
Experimental Results

Keywords

  • Byzantine fault tolerance
  • Cloud computing
  • Consensus
  • Gossip

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications
  • Software
  • Theoretical Computer Science

Cite this

Scalable and leaderless Byzantine consensus in cloud computing environments. / Lim, Jongbeom; Suh, Taeweon; Gil, Joonmin; Yu, Heonchang.

In: Information Systems Frontiers, Vol. 16, No. 1, 01.01.2014, p. 19-34.

Research output: Contribution to journalArticle

@article{6b79f19697fa45ba94bfedddac937042,
title = "Scalable and leaderless Byzantine consensus in cloud computing environments",
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, Cloud computing, Consensus, Gossip",
author = "Jongbeom Lim and Taeweon Suh and Joonmin Gil and Heonchang Yu",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/s10796-013-9460-7",
language = "English",
volume = "16",
pages = "19--34",
journal = "Information Systems Frontiers",
issn = "1387-3326",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - Scalable and leaderless Byzantine consensus in cloud computing environments

AU - Lim, Jongbeom

AU - Suh, Taeweon

AU - Gil, Joonmin

AU - Yu, Heonchang

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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.

AB - 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.

KW - Byzantine fault tolerance

KW - Cloud computing

KW - Consensus

KW - Gossip

UR - http://www.scopus.com/inward/record.url?scp=84897976423&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84897976423&partnerID=8YFLogxK

U2 - 10.1007/s10796-013-9460-7

DO - 10.1007/s10796-013-9460-7

M3 - Article

AN - SCOPUS:84897976423

VL - 16

SP - 19

EP - 34

JO - Information Systems Frontiers

JF - Information Systems Frontiers

SN - 1387-3326

IS - 1

ER -