Scalable and leaderless Byzantine consensus in cloud computing environments
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lim, JongBeom | - |
dc.contributor.author | Suh, Taeweon | - |
dc.contributor.author | Gil, JoonMin | - |
dc.contributor.author | Yu, Heonchang | - |
dc.date.accessioned | 2021-09-05T11:00:21Z | - |
dc.date.available | 2021-09-05T11:00:21Z | - |
dc.date.created | 2021-06-15 | - |
dc.date.issued | 2014-03 | - |
dc.identifier.issn | 1387-3326 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/99139 | - |
dc.description.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. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.subject | GENERALS | - |
dc.title | Scalable and leaderless Byzantine consensus in cloud computing environments | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Suh, Taeweon | - |
dc.contributor.affiliatedAuthor | Yu, Heonchang | - |
dc.identifier.doi | 10.1007/s10796-013-9460-7 | - |
dc.identifier.scopusid | 2-s2.0-84897976423 | - |
dc.identifier.wosid | 000333350800003 | - |
dc.identifier.bibliographicCitation | INFORMATION SYSTEMS FRONTIERS, v.16, no.1, pp.19 - 34 | - |
dc.relation.isPartOf | INFORMATION SYSTEMS FRONTIERS | - |
dc.citation.title | INFORMATION SYSTEMS FRONTIERS | - |
dc.citation.volume | 16 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 19 | - |
dc.citation.endPage | 34 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | GENERALS | - |
dc.subject.keywordAuthor | Byzantine fault tolerance | - |
dc.subject.keywordAuthor | Consensus | - |
dc.subject.keywordAuthor | Gossip | - |
dc.subject.keywordAuthor | Cloud computing | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.