Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Gossip Membership Management with Social Graphs for Byzantine Fault Tolerance in Clouds

Abstract : As computer systems have become more complex and dynamic, unstructured and decentralized techniques serve as basic building blocks in large-scale systems such as cloud computing systems. In particular, we consider a gossip-based algorithm, one of the unstructured overlay construction techniques. In this paper, we propose a membership management mechanism using the gossip-based algorithm with social graphs for the Byzantine fault tolerance problem. Experimental results show that our membership management mechanism copes with Byzantine nodes effectively in a scalable way without a bottleneck in dynamic computing environments, requiring only n ≥ 2f + 1 nodes.
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, November 25, 2016 - 2:33:24 PM
Last modification on : Thursday, March 5, 2020 - 5:40:17 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Jongbeom Lim, Joon-Min Gil, Kwang-Sik Chung, Jihun Kang, Daewon Lee, et al.. Gossip Membership Management with Social Graphs for Byzantine Fault Tolerance in Clouds. 11th IFIP International Conference on Network and Parallel Computing (NPC), Sep 2014, Ilan, Taiwan. pp.321-332, ⟨10.1007/978-3-662-44917-2_27⟩. ⟨hal-01403099⟩



Record views


Files downloads