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

doi:10.1007/978-3-662-44917-2_27

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 proceeding › Conference contribution

1 Citation (Scopus)

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	https://doi.org/10.1007/978-3-662-44917-2_27
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

Access to Document

10.1007/978-3-662-44917-2_27

Cite this

Lim, J., Gil, J. M., Chung, K. S., Kang, J., Lee, D., & Yu, H. (2014). Gossip membership management with social graphs for byzantine fault tolerance in clouds. In Network and Parallel Computing - 11th IFIP WG 10.3 International Conference, NPC 2014, Proceedings (pp. 321-332). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8707 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-662-44917-2_27

Gossip membership management with social graphs for byzantine fault tolerance in clouds. / Lim, Jongbeom; Gil, Joon Min; Chung, Kwang Sik et al.
Network and Parallel Computing - 11th IFIP WG 10.3 International Conference, NPC 2014, Proceedings. Springer Verlag, 2014. p. 321-332 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8707 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Lim, J, Gil, JM, Chung, KS, Kang, J, Lee, D & Yu, H 2014, Gossip membership management with social graphs for byzantine fault tolerance in clouds. in Network and Parallel Computing - 11th IFIP WG 10.3 International Conference, NPC 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8707 LNCS, Springer Verlag, pp. 321-332, 11th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2014, Ilan, Taiwan, Province of China, 14/9/18. https://doi.org/10.1007/978-3-662-44917-2_27

Lim J, Gil JM, Chung KS, Kang J, Lee D, Yu H. Gossip membership management with social graphs for byzantine fault tolerance in clouds. In Network and Parallel Computing - 11th IFIP WG 10.3 International Conference, NPC 2014, Proceedings. Springer Verlag. 2014. p. 321-332. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-44917-2_27

Lim, Jongbeom ; Gil, Joon Min ; Chung, Kwang Sik et al. / Gossip membership management with social graphs for byzantine fault tolerance in clouds. Network and Parallel Computing - 11th IFIP WG 10.3 International Conference, NPC 2014, Proceedings. Springer Verlag, 2014. pp. 321-332 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{0200fe8b11ed413cbdd78f42879f1825,

title = "Gossip membership management with social graphs for byzantine fault tolerance in clouds",

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

author = "Jongbeom Lim and Gil, {Joon Min} and Chung, {Kwang Sik} and Jihun Kang and Daewon Lee and Heonchang Yu",

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).; 11th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2014 ; Conference date: 18-09-2014 Through 20-09-2014",

year = "2014",

doi = "10.1007/978-3-662-44917-2_27",

language = "English",

isbn = "9783662449165",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "321--332",

booktitle = "Network and Parallel Computing - 11th IFIP WG 10.3 International Conference, NPC 2014, Proceedings",

}

TY - GEN

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

AU - Lim, Jongbeom

AU - Gil, Joon Min

AU - Chung, Kwang Sik

AU - Kang, Jihun

AU - Lee, Daewon

AU - Yu, Heonchang

N1 - Funding Information: This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea goverment (MEST) (No. NRF-2012R1A2A2A02046684).

PY - 2014

Y1 - 2014

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

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

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

U2 - 10.1007/978-3-662-44917-2_27

DO - 10.1007/978-3-662-44917-2_27

M3 - Conference contribution

AN - SCOPUS:84906726838

SN - 9783662449165

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 321

EP - 332

BT - Network and Parallel Computing - 11th IFIP WG 10.3 International Conference, NPC 2014, Proceedings

PB - Springer Verlag

T2 - 11th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2014

Y2 - 18 September 2014 through 20 September 2014

ER -

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

Abstract

Publication series

Other

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this