Scalable and leaderless Byzantine consensus in cloud computing environments

Authors:
Jongbeom Lim;Taeweon Suh;Joonmin Gil;Heonchang Yu
Affiliations:
Department of Computer Science Education, Korea University, Seoul, Korea;Department of Computer Science Education, Korea University, Seoul, Korea;School of Computer & Information Communications Engineering, Catholic University of Daegu, Daegu, Korea;Department of Computer Science Education, Korea University, Seoul, Korea
Venue:
Information Systems Frontiers
Year:
2014

Citing 23
Cited 1

Implementing fault-tolerant services using the state machine approach: a tutorial

ACM Computing Surveys (CSUR)
Byzantine quorum systems

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The part-time parliament

ACM Transactions on Computer Systems (TOCS)
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Byzantine generals in action: implementing fail-stop processors

ACM Transactions on Computer Systems (TOCS)
Practical byzantine fault tolerance and proactive recovery

ACM Transactions on Computer Systems (TOCS)
Peer-to-Peer Membership Management for Gossip-Based Protocols

IEEE Transactions on Computers
Separating agreement from execution for byzantine fault tolerant services

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
How to Tolerate Half Less One Byzantine Nodes in Practical Distributed Systems

SRDS '04 Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems
Correctness of a gossip based membership protocol

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Attested append-only memory: making adversaries stick to their word

Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Fault-Tolerant Microprocessor-Based Systems

IEEE Micro
Cloud computing and emerging IT platforms: Vision, hype, and reality for delivering computing as the 5th utility

Future Generation Computer Systems
Correctness of gossip-based membership under message loss

Proceedings of the 28th ACM symposium on Principles of distributed computing
An Efficient Byzantine-Resilient Tuple Space

IEEE Transactions on Computers
Networks: An Introduction

Networks: An Introduction
Achieving efficient agreement within a dual-failure cloud-computing environment

Expert Systems with Applications: An International Journal
Prime: Byzantine Replication under Attack

IEEE Transactions on Dependable and Secure Computing
BFTCloud: A Byzantine Fault Tolerance Framework for Voluntary-Resource Cloud Computing

CLOUD '11 Proceedings of the 2011 IEEE 4th International Conference on Cloud Computing
CheapBFT: resource-efficient byzantine fault tolerance

Proceedings of the 7th ACM european conference on Computer Systems
Efficient Byzantine Fault-Tolerance

IEEE Transactions on Computers
Social Cloud Computing: A Vision for Socially Motivated Resource Sharing

IEEE Transactions on Services Computing

Dynamic intelligence towards merging cloud and communication services

Information Systems Frontiers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditional Byzantine consensus in distributed systems requires n 驴 3f + 1, where n is the number of nodes. In this paper, we present a scalable and leaderless Byzantine consensus implementation based on gossip, requiring only n 驴 2f + 1 nodes. Unlike conventional distributed systems, the network topology of cloud computing systems is often not fully connected, but loosely coupled and layered. Hence, we revisit the Byzantine consensus problem in cloud computing environments, in which each node maintains some number of neighbors, called local view. The message complexity of our Byzantine consensus scheme is O(n), instead of O(n 2). Experimental results and correctness proof show that our Byzantine consensus scheme can solve the Byzantine consensus problem safely in a scalable way without a bottleneck and a leader in cloud computing environments.