Scalable and leaderless Byzantine consensus in cloud computing environments
- Authors
- Lim, JongBeom; Suh, Taeweon; Gil, JoonMin; Yu, Heonchang
- Issue Date
- Mar-2014
- Publisher
- SPRINGER
- Keywords
- Byzantine fault tolerance; Consensus; Gossip; Cloud computing
- Citation
- INFORMATION SYSTEMS FRONTIERS, v.16, no.1, pp.19 - 34
- Indexed
- SCIE
SCOPUS
- Journal Title
- INFORMATION SYSTEMS FRONTIERS
- Volume
- 16
- Number
- 1
- Start Page
- 19
- End Page
- 34
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/99139
- DOI
- 10.1007/s10796-013-9460-7
- ISSN
- 1387-3326
- Abstract
- Traditional Byzantine consensus in distributed systems requires n a parts per thousand yen 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 a parts per thousand yen 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(n (2)). 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School > Department of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholar.korea.ac.kr/handle/2021.sw.korea/99139)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.