Gossip membership management with social graphs for byzantine fault tolerance in clouds

Jongbeom Lim, Joon Min Gil, Kwang Sik Chung, Jihun Kang, Daewon Lee, Heonchang Yu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationNetwork and Parallel Computing - 11th IFIP WG 10.3 International Conference, NPC 2014, Proceedings
PublisherSpringer Verlag
Pages321-332
Number of pages12
ISBN (Print)9783662449165
DOIs
Publication statusPublished - 2014
Event11th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2014 - Ilan, Taiwan, Province of China
Duration: 2014 Sep 182014 Sep 20

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8707 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other11th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2014
CountryTaiwan, Province of China
CityIlan
Period14/9/1814/9/20

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Gossip membership management with social graphs for byzantine fault tolerance in clouds'. Together they form a unique fingerprint.

Cite this