Byzantine-resilient dual gossip membership management in clouds
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lim, JongBeom | - |
dc.contributor.author | Chung, Kwang-Sik | - |
dc.contributor.author | Lee, HwaMin | - |
dc.contributor.author | Yim, Kangbin | - |
dc.contributor.author | Yu, Heonchang | - |
dc.date.accessioned | 2021-09-02T12:29:19Z | - |
dc.date.available | 2021-09-02T12:29:19Z | - |
dc.date.created | 2021-06-16 | - |
dc.date.issued | 2018-05 | - |
dc.identifier.issn | 1432-7643 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/76040 | - |
dc.description.abstract | In this paper, we present an effective and efficient Byzantine-resilient dual membership management technique in cloud environments, in which nodes are prone to churn and the network topology is not fully connected. Our method is based on unstructured message communication model, namely a gossip protocol that is able to handle the dynamic behavior of nodes properly in the system. We argue that due to the presence of malicious Byzantine nodes, existing membership management mechanisms are not suitable for preserving uniformity of random sampling. Therefore, we propose a new membership management mechanism using gossip with social membership information. The proposed membership management scheme maintains not only neighbor nodes in a social graph, but also Byzantine nodes in a local data structure. The results show that our dual membership management effectively deals with Byzantine nodes, requiring only n 2f + 1, where n is the number of nodes and f is the number of Byzantine nodes in the system. The message complexity is reduced from O(n ) to O(n) with our proposed algorithm compared to broadcast-based algorithms. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.subject | PEER | - |
dc.subject | DISSEMINATION | - |
dc.title | Byzantine-resilient dual gossip membership management in clouds | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Yu, Heonchang | - |
dc.identifier.doi | 10.1007/s00500-017-2553-3 | - |
dc.identifier.scopusid | 2-s2.0-85015741726 | - |
dc.identifier.wosid | 000429464200016 | - |
dc.identifier.bibliographicCitation | SOFT COMPUTING, v.22, no.9, pp.3011 - 3022 | - |
dc.relation.isPartOf | SOFT COMPUTING | - |
dc.citation.title | SOFT COMPUTING | - |
dc.citation.volume | 22 | - |
dc.citation.number | 9 | - |
dc.citation.startPage | 3011 | - |
dc.citation.endPage | 3022 | - |
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, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.subject.keywordPlus | PEER | - |
dc.subject.keywordPlus | DISSEMINATION | - |
dc.subject.keywordAuthor | Membership management | - |
dc.subject.keywordAuthor | Byzantine fault tolerance | - |
dc.subject.keywordAuthor | Social graph | - |
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.