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.
Original language | English |
---|---|
Title of host publication | Network and Parallel Computing - 11th IFIP WG 10.3 International Conference, NPC 2014, Proceedings |
Publisher | Springer Verlag |
Pages | 321-332 |
Number of pages | 12 |
ISBN (Print) | 9783662449165 |
DOIs | |
Publication status | Published - 2014 |
Event | 11th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2014 - Ilan, Taiwan, Province of China Duration: 2014 Sept 18 → 2014 Sept 20 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 8707 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Other
Other | 11th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2014 |
---|---|
Country/Territory | Taiwan, Province of China |
City | Ilan |
Period | 14/9/18 → 14/9/20 |
Bibliographical note
Funding Information:This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea goverment (MEST) (No. NRF-2012R1A2A2A02046684).
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science