TY - GEN
T1 - Unstructured membership management for byzantine fault tolerance in Clouds
AU - Lim, Jongbeom
AU - Jung, Daeyong
AU - Suh, Taeweon
AU - Yu, Heonchang
N1 - Funding Information:
This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MEST) (No. NRF-2012R1A2A2A02046684).
Publisher Copyright:
© VDE VERLAG GMBH - Berlin - Offenbach, Germany.
PY - 2014
Y1 - 2014
N2 - To tolerate against Byzantine failures, a traditional system requires n = 3f + 1, where n is the number of nodes and f is the number of Byzantine nodes. More recently, a more efficient methodology has been proposed, requiring only n = 2f + 1 by separating agreement from execution. We argue that since nodes are prone to churn and the network topology is not often fully connected in a dynamic system (e.g., cloud computing), an unstructured form of achieving Byzantine fault tolerance is necessary such as using gossip. In such a case, however, due to the presence of malicious Byzantine nodes, existing membership management mechanisms are not suitable for preserving uniformity of random sampling. In this paper, we propose a novel unstructured membership management implementation for Byzantine fault tolerance in clouds. Analytic studies reveal that our implementation of membership management leads to a more adequate and satisfactory solution than existing ones.
AB - To tolerate against Byzantine failures, a traditional system requires n = 3f + 1, where n is the number of nodes and f is the number of Byzantine nodes. More recently, a more efficient methodology has been proposed, requiring only n = 2f + 1 by separating agreement from execution. We argue that since nodes are prone to churn and the network topology is not often fully connected in a dynamic system (e.g., cloud computing), an unstructured form of achieving Byzantine fault tolerance is necessary such as using gossip. In such a case, however, due to the presence of malicious Byzantine nodes, existing membership management mechanisms are not suitable for preserving uniformity of random sampling. In this paper, we propose a novel unstructured membership management implementation for Byzantine fault tolerance in clouds. Analytic studies reveal that our implementation of membership management leads to a more adequate and satisfactory solution than existing ones.
UR - http://www.scopus.com/inward/record.url?scp=85014504560&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85014504560
T3 - ARCS 2014 - 2014 Workshop Proceedings on Architecture of Computing Systems
BT - ARCS 2014 - 2014 Workshop Proceedings on Architecture of Computing Systems
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 27th International Conference on Architecture of Computing Systems Workshop, ARCS 2014
Y2 - 25 February 2014 through 28 February 2014
ER -