Byzantine-resilient dual gossip membership management in clouds

Jong Beom Lim, Kwang Sik Chung, Hwa Min Lee, Kangbin Yim, Heonchang Yu

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper, we present an effective and efficient Byzantine-resilient dual membership management technique in cloud environments, in which nodes are prone to churn and the network topology is not fully connected. Our method is based on unstructured message communication model, namely a gossip protocol that is able to handle the dynamic behavior of nodes properly in the system. We argue that due to the presence of malicious Byzantine nodes, existing membership management mechanisms are not suitable for preserving uniformity of random sampling. Therefore, we propose a new membership management mechanism using gossip with social membership information. The proposed membership management scheme maintains not only neighbor nodes in a social graph, but also Byzantine nodes in a local data structure. The results show that our dual membership management effectively deals with Byzantine nodes, requiring only n(Formula presented.) 2f + 1, where n is the number of nodes and f is the number of Byzantine nodes in the system. The message complexity is reduced from O(n(Formula presented.)) to O(n) with our proposed algorithm compared to broadcast-based algorithms.

Original languageEnglish
Pages (from-to)1-12
Number of pages12
JournalSoft Computing
DOIs
Publication statusAccepted/In press - 2017 Mar 21

Fingerprint

Gossip
Vertex of a graph
Data structures
Message Complexity
Topology
Random Sampling
Sampling
Local Structure
Network Topology
Uniformity
Broadcast
Dynamic Behavior
Communication
Data Structures
Graph in graph theory

Keywords

  • Byzantine fault tolerance
  • Cloud computing
  • Membership management
  • Social graph

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Geometry and Topology

Cite this

Byzantine-resilient dual gossip membership management in clouds. / Lim, Jong Beom; Chung, Kwang Sik; Lee, Hwa Min; Yim, Kangbin; Yu, Heonchang.

In: Soft Computing, 21.03.2017, p. 1-12.

Research output: Contribution to journalArticle

Lim, Jong Beom ; Chung, Kwang Sik ; Lee, Hwa Min ; Yim, Kangbin ; Yu, Heonchang. / Byzantine-resilient dual gossip membership management in clouds. In: Soft Computing. 2017 ; pp. 1-12.
@article{e609a1706a4b412c9ab118066fe2c0a1,
title = "Byzantine-resilient dual gossip membership management in clouds",
abstract = "In this paper, we present an effective and efficient Byzantine-resilient dual membership management technique in cloud environments, in which nodes are prone to churn and the network topology is not fully connected. Our method is based on unstructured message communication model, namely a gossip protocol that is able to handle the dynamic behavior of nodes properly in the system. We argue that due to the presence of malicious Byzantine nodes, existing membership management mechanisms are not suitable for preserving uniformity of random sampling. Therefore, we propose a new membership management mechanism using gossip with social membership information. The proposed membership management scheme maintains not only neighbor nodes in a social graph, but also Byzantine nodes in a local data structure. The results show that our dual membership management effectively deals with Byzantine nodes, requiring only n(Formula presented.) 2f + 1, where n is the number of nodes and f is the number of Byzantine nodes in the system. The message complexity is reduced from O(n(Formula presented.)) to O(n) with our proposed algorithm compared to broadcast-based algorithms.",
keywords = "Byzantine fault tolerance, Cloud computing, Membership management, Social graph",
author = "Lim, {Jong Beom} and Chung, {Kwang Sik} and Lee, {Hwa Min} and Kangbin Yim and Heonchang Yu",
year = "2017",
month = "3",
day = "21",
doi = "10.1007/s00500-017-2553-3",
language = "English",
pages = "1--12",
journal = "Soft Computing",
issn = "1432-7643",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Byzantine-resilient dual gossip membership management in clouds

AU - Lim, Jong Beom

AU - Chung, Kwang Sik

AU - Lee, Hwa Min

AU - Yim, Kangbin

AU - Yu, Heonchang

PY - 2017/3/21

Y1 - 2017/3/21

N2 - In this paper, we present an effective and efficient Byzantine-resilient dual membership management technique in cloud environments, in which nodes are prone to churn and the network topology is not fully connected. Our method is based on unstructured message communication model, namely a gossip protocol that is able to handle the dynamic behavior of nodes properly in the system. We argue that due to the presence of malicious Byzantine nodes, existing membership management mechanisms are not suitable for preserving uniformity of random sampling. Therefore, we propose a new membership management mechanism using gossip with social membership information. The proposed membership management scheme maintains not only neighbor nodes in a social graph, but also Byzantine nodes in a local data structure. The results show that our dual membership management effectively deals with Byzantine nodes, requiring only n(Formula presented.) 2f + 1, where n is the number of nodes and f is the number of Byzantine nodes in the system. The message complexity is reduced from O(n(Formula presented.)) to O(n) with our proposed algorithm compared to broadcast-based algorithms.

AB - In this paper, we present an effective and efficient Byzantine-resilient dual membership management technique in cloud environments, in which nodes are prone to churn and the network topology is not fully connected. Our method is based on unstructured message communication model, namely a gossip protocol that is able to handle the dynamic behavior of nodes properly in the system. We argue that due to the presence of malicious Byzantine nodes, existing membership management mechanisms are not suitable for preserving uniformity of random sampling. Therefore, we propose a new membership management mechanism using gossip with social membership information. The proposed membership management scheme maintains not only neighbor nodes in a social graph, but also Byzantine nodes in a local data structure. The results show that our dual membership management effectively deals with Byzantine nodes, requiring only n(Formula presented.) 2f + 1, where n is the number of nodes and f is the number of Byzantine nodes in the system. The message complexity is reduced from O(n(Formula presented.)) to O(n) with our proposed algorithm compared to broadcast-based algorithms.

KW - Byzantine fault tolerance

KW - Cloud computing

KW - Membership management

KW - Social graph

UR - http://www.scopus.com/inward/record.url?scp=85015741726&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015741726&partnerID=8YFLogxK

U2 - 10.1007/s00500-017-2553-3

DO - 10.1007/s00500-017-2553-3

M3 - Article

AN - SCOPUS:85015741726

SP - 1

EP - 12

JO - Soft Computing

JF - Soft Computing

SN - 1432-7643

ER -