Modeling and validating the performance of atomic broadcast algorithms in high latency networks

Authors:
Richard Ekwall;André Schiper
Affiliations:
École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland;École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
Venue:
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Year:
2007

Citing 10
Cited 1

Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
Replication management using the state-machine approach

Distributed systems (2nd Ed.)
Evaluating the running time of a communication round over the internet

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach

Proceedings of the 13th International Symposium on Distributed Computing
Optimistic Total Order in Wide Area Networks

SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
An Indulgent Uniform Total Order Algorithm with Optimistic Delivery

SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Token-based Atomic Broadcast using Unreliable Failure Detectors

SRDS '04 Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems
High Throughput Total Order Broadcast for Cluster Environments

DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
Consistent data replication: is it feasible in WANs?

Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing

Total order broadcast on pervasive systems

Proceedings of the 2008 ACM symposium on Applied computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The performance of consensus and atomic broadcast algorithms using failure detectors is often affected by a trade-off between the number of communication steps and the number of messages needed to reach a decision. In this paper, we model the performance of three consensus and atomic broadcast algorithms using failure detectors in the oft-neglected setting of wide area networks and validate this model by experimentally evaluating the algorithms in several different setups.