On the Inherent Cost of Atomic Broadcast and Multicast in Wide Area Networks

Schiper, Nicolas; Pedone, Fernando

doi:10.1007/978-3-540-77444-0_12

Cited by 19 publications

(32 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the last two stages, the clock of g is updated to a value bigger than m's final timestamp and m is delivered when its timestamp is the smallest among all messages that are in one of the four stages. In [21], the authors present an optimization of [13] that allows messages to skip the second and third stages in certain conditions, therefore sparing the execution of consensus instances. The algorithms of [13,21] can deliver messages in two inter-group message delays; [21] shows that this is optimal.…”

Section: Related Workmentioning

confidence: 99%

“…The algorithm is inspired by the atomic broadcast algorithm of [21]. We first recall its main ideas and then explain how we cope with group failures- [21] assumes that there is at least one correct process in every group.…”

Section: Algorithm Overviewmentioning

confidence: 99%

“…We first recall its main ideas and then explain how we cope with group failures- [21] assumes that there is at least one correct process in every group. We then show how local messages to some group g, i.e., messages multicast from processes inside g and addressed to g only, may be delivered with no inter-group communication at all.…”

Section: Algorithm Overviewmentioning

confidence: 99%

“…Previous work on atomic multicast [3,20,9,13,21] all assume that, inside each group, there exists at least one non-faulty process. We here do not make this assumption and allow groups to entirely crash.…”

Section: Introductionmentioning

confidence: 99%

“…Multicast messages may be addressed to any subset of groups, each message possibly being multicast to a different subset. Several papers previously studied this problem either in local area networks [3,9,20] or wide area networks [13,21]. However, none of them considered atomic multicast when groups may crash.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Solving Atomic Multicast When Groups Crash

Schiper

Pedone

2008

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

In this paper, we study the atomic multicast problem, a fundamental abstraction for building faulttolerant systems. In the atomic multicast problem, the system is divided into non-empty and disjoint groups of processes. Multicast messages may be addressed to any subset of groups, each message possibly being multicast to a different subset. Several papers previously studied this problem either in local area networks [3,9,20] or wide area networks [13,21]. However, none of them considered atomic multicast when groups may crash. We present two atomic multicast algorithms that tolerate the crash of groups. The first algorithm tolerates an arbitrary number of failures, is genuine (i.e., to deliver a message m, only addressees of m are involved in the protocol), and uses the perfect failures detector P. We show that among realistic failure detectors, i.e., those that do not predict the future, P is necessary to solve genuine atomic multicast if we do not bound the number of processes that may fail. Thus, P is the weakest realistic failure detector for solving genuine atomic multicast when an arbitrary number of processes may crash. Our second algorithm is non-genuine and less resilient to process failures than the first algorithm but has several advantages: (i) it requires perfect failure detection within groups only, and not across the system, (ii) as we show in the paper it can be modified to rely on unreliable failure detection at the cost of a weaker liveness guarantee, and (iii) it is fast, messages addressed to multiple groups may be delivered within two inter-group message delays only.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Algorithm Overviewmentioning

confidence: 99%

Section: Algorithm Overviewmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

Solving Atomic Multicast When Groups Crash

Schiper

Pedone

2008

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

GeoRep—Resilient Storage for Wide Area Networks

Brahneborg

Duvignau

Afzal³

et al. 2022

IEEE Access

View full text Add to dashboard Cite

Embedded systems typically have limited processing and storage capabilities, and may only intermittently be powered on. After sending an event upstreams with data from its sensors, the system must therefore be able to trust that the data, once acknowledged, is not lost. The purpose of this work is to propose a novel solution for replicating data between the upstreams nodes in such systems, with a minimal effect on the software architecture. Based on the assumption that there would be no relative order between replicated data tuples, we designed a new replication protocol which uses only 2 communication steps per data tuple, instead of between 3 and 12 used by other solutions. We verified its failover mechanism in a proof-ofconcept implementation of the protocol using simulated network failures, and evaluated the implementation on throughput and latency in several controlled experiments using up to 7 nodes in up to 5 geographically separated areas, with up to 1000 data producers per node. The recorded system throughput increased linearly relative to both the number of nodes and the number of data producers. For comparison, with 3 nodes Paxos showed a similar performance as our protocol, but it instead got slower when nodes were added. The lack of a relative order, in combination with partial replication, enables our system to continue working during network partitions, not only in the part containing the majority of the nodes, but also in any sufficiently large minority partitions.

show abstract

Multi-Ring Paxos

Marandi

Primi

Pedone

2012

IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012)

Self Cite

View full text Add to dashboard Cite

This paper addresses the scalability of group communication protocols. Scalability has become an issue of prime importance as data centers become commonplace. By scalability we mean the ability to increase the throughput of a group communication protocol, measured in number of requests ordered per time unit, by adding resources (i.e., nodes). We claim that existing group communication protocols do not scale in this respect and introduce Multi-Ring Paxos, a protocol that orchestrates multiple instances of Ring Paxos in order to scale to a large number of nodes. In addition to presenting Multi-Ring Paxos, we describe a prototype of the system we have implemented and a detailed evaluation of its performance.

show abstract

On the Inherent Cost of Atomic Broadcast and Multicast in Wide Area Networks

Cited by 19 publications

References 11 publications

Solving Atomic Multicast When Groups Crash

Solving Atomic Multicast When Groups Crash

GeoRep—Resilient Storage for Wide Area Networks

Multi-Ring Paxos

Contact Info

Product

Resources

About