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.
Type de document :
Communication dans un congrès
Ching-Hsien Hsu; Xuanhua Shi; Valentina Salapura. 11th IFIP International Conference on Network and Parallel Computing (NPC), Sep 2014, Ilan, Taiwan. Springer, Lecture Notes in Computer Science, LNCS-8707, pp.321-332, 2014, Network and Parallel Computing. 〈10.1007/978-3-662-44917-2_27〉
https://hal.inria.fr/hal-01403099
Contributeur : Hal Ifip
<>
Soumis le : vendredi 25 novembre 2016 - 14:33:24
Dernière modification le : vendredi 1 décembre 2017 - 01:10:06
