%0 Conference Proceedings
%T Gossip Membership Management with Social Graphs for Byzantine Fault Tolerance in Clouds
%+ Korea University [Seoul]
%+ Catholic University of Daegu
%+ Korea National Open University [Seoul]
%+ Seokyeong University [Seoul]
%A Lim, Jongbeom
%A Gil, Joon-Min
%A Chung, Kwang-Sik
%A Kang, Jihun
%A Lee, Daewon
%A Yu, Heonchang
%Z Part 3: Virtualization and Cloud Computing Technologies
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 11th IFIP International Conference on Network and Parallel Computing (NPC)
%C Ilan, Taiwan
%Y Ching-Hsien Hsu
%Y Xuanhua Shi
%Y Valentina Salapura
%I Springer
%3 Network and Parallel Computing
%V LNCS-8707
%P 321-332
%8 2014-09-18
%D 2014
%R 10.1007/978-3-662-44917-2_27
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 10
%Z WG 10.3
%2 https://inria.hal.science/hal-01403099/document
%2 https://inria.hal.science/hal-01403099/file/978-3-662-44917-2_27_Chapter.pdf
%L hal-01403099
%U https://inria.hal.science/hal-01403099
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-LNCS-8707
%~ IFIP-TC10
%~ IFIP-NPC
%~ IFIP-WG10-3