| HAL-Inria | Publications, software ... of Inria's scientists |
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.
Cited literature [24 references]
https://hal.inria.fr/hal-01403099
Contributor : Hal Ifip <>
Submitted on : Friday, November 25, 2016 - 2:33:24 PM
Last modification on : Thursday, March 5, 2020 - 5:40:17 PM
Contributor : Hal Ifip <>
Submitted on : Friday, November 25, 2016 - 2:33:24 PM
Last modification on : Thursday, March 5, 2020 - 5:40:17 PM
File
978-3-662-44917-2_27_Chapter.p...
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution 4.0 International License