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

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...

Full description

Saved in:
Bibliographic Details
Published inNetwork and Parallel Computing pp. 321 - 332
Main Authors Lim, JongBeom, Gil, Joon-Min, Chung, Kwang-Sik, Kang, Jihun, Lee, Daewon, Yu, Heonchang
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2014
SeriesLecture Notes in Computer Science
Subjects
Cloud Computing Environment
Cloud Computing System
Local View
Overlay Network
Social Graph
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea goverment (MEST) (No. NRF-2012R1A2A2A02046684).
ISBN:9783662449165
3662449161
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-662-44917-2_27