Group communication in partitionable systems: specification and algorithms

Babaoğlu, Özalp; Davoli, Renzo; Montresor, Alberto

doi:10.1109/32.917522

Cited by 54 publications

(137 citation statements)

References 26 publications

Supporting

Mentioning

103

Contrasting

Unclassified

Order By: Relevance

“…Previous membership algorithms (e.g., Friedman and van Renesse 1995;Schiper and Ricciardi 1993;Babaoglu et al 2001]) satisfy the termination property, and therefore terminate even in unstable situations.…”

Section: Avoiding Delivery Of Obsolete Viewsmentioning

confidence: 99%

“…Previous membership service specifications (e.g., Friedman and van Renesse 1995;Babaoglu et al 2001]) had included a termination property, that is, they required that every instance of the membership algorithm terminate even if the network is unstable forever. Previous membership algorithms (e.g., Friedman and van Renesse 1995;Schiper and Ricciardi 1993;Babaoglu et al 2001]) satisfy the termination property, and therefore terminate even in unstable situations.…”

Section: Avoiding Delivery Of Obsolete Viewsmentioning

confidence: 99%

“…Typical group membership algorithm instead terminate in all runs 2δ time after network stabilization occurs and all of the servers correctly detect the network connectivity (for example, Agarwal et al 1998;Ricciardi and Birman 1991;Babaoglu et al 2001;Hiltunen and Schlichting 1998;Schiper and Ricciardi 1993;Malloth et al 1995]). As discussed in Section 7, our algorithm terminated in one round in almost 99% of the cases, and seldom exceeded 2δ.…”

Section: Low Message Overheadmentioning

confidence: 99%

“…Other WAN membership algorithms that do not have such a separation, like Totem ] and Spread [Amir and Stanton 1998], are significantly more complex than Moshe. Such separation does exist, however, in several membership algorithms designed for LANs, for example, [Babaoglu et al 2001;van Renesse et al 1994;Dolev et al 1994;Hayden and van Renesse 1996;Malloth et al 1995;Mishra et al 1993;Hiltunen and Schlichting 1998]. …”

Section: Introductionmentioning

confidence: 99%

“…Moshe is complemented by a virtually synchronous communication service [Keidar and Khazan 2000], and it is partitionable Chockler et al 2001;Babaoglu et al 2001], that is, several disjoint views can exist concurrently.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Moshe

Keidar

Sussman

Marzullo

et al. 2002

ACM Trans. Comput. Syst.

View full text Add to dashboard Cite

We present Moshe, a novel scalable group membership algorithm built specifically for use in wide area networks (WANs), which can suffer partitions. Moshe is designed with three new significant features that are important in this setting: it avoids delivering views that reflect out-of-date memberships; it requires a single round of messages in the common case; and it employs a clientserver design for scalability. Furthermore, Moshe's interface supplies the hooks needed to provide clients with full virtual synchrony semantics. We have implemented Moshe on top of a network event mechanism also designed specifically for use in a WAN.In addition to specifying the properties of the algorithm and proving that this specification is met, we provide empirical results of an implementation of Moshe running over the Internet. The empirical results justify the assumptions made by our design and exhibit good performance. In particular, Moshe terminates within a single communication round over 98% of the time. The experimental results also lead to interesting observations regarding the performance of membership algorithms over the Internet.

show abstract

Section: Avoiding Delivery Of Obsolete Viewsmentioning

confidence: 99%

Section: Avoiding Delivery Of Obsolete Viewsmentioning

confidence: 99%

Section: Low Message Overheadmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Moshe

Keidar

Sussman

Marzullo

et al. 2002

ACM Trans. Comput. Syst.

View full text Add to dashboard Cite

show abstract

Three‐tier replication for FT‐CORBA infrastructures

Baldoni

Marchetti

2003

Softw Pract Exp

View full text Add to dashboard Cite

Enforcing strong replica consistency among a set of replicas of a service deployed across an asynchronous distributed system in the presence of crash failures is a real practical challenge. If each replica runs the consistency protocol bundled with the actual service implementation, this target cannot be achieved, as replicas need to be located over a partially synchronous distributed system to solve the distributed agreement problems underlying strong replica consistency. A three-tier architecture for software replication enables the separation of the replication logic, i.e. protocols and mechanisms necessary for managing software replication, from both clients and server replicas. The replication logic is embedded in a middle-tier that confines the need of partial synchrony and thus frees replica deployment. In this paper we first introduce the basic concepts underlying three-tier replication. Then we present the interoperable replication logic (IRL) architecture, a fault-tolerant CORBA compliant infrastructure. IRL exploits a three-tier approach to replicate stateful deterministic CORBA objects and allows object replicas to run on object request brokers from different vendors. A description of an IRL prototype developed in our department is proposed along with an extensive performance analysis. Copyright (C) 2003 John Wiley Sons, Ltd

show abstract

Jgroup/ARM: a distributed object group platform with autonomous replication management

et al. 2007

View full text Add to dashboard Cite

This paper presents the design and implementation of Jgroup/ARM, a distributed object group platform with autonomous replication management along with a novel measurement‐based assessment technique that is used to validate the fault‐handling capability of Jgroup/ARM. Jgroup extends Java RMI through the group communication paradigm and has been designed specifically for application support in partitionable systems. ARM aims at improving the dependability characteristics of systems through a fault‐treatment mechanism. Hence, ARM focuses on deployment and operational aspects, where the gain in terms of improved dependability is likely to be the greatest. The main objective of ARM is to localize failures and to reconfigure the system according to application‐specific dependability requirements. Combining Jgroup and ARM can significantly reduce the effort necessary for developing, deploying and managing dependable, partition‐aware applications. Jgroup/ARM is evaluated experimentally to validate its fault‐handling capability; the recovery performance of a system deployed in a wide area network is evaluated. In this experiment multiple nearly coincident reachability changes are injected to emulate network partitions separating the service replicas. The results show that Jgroup/ARM is able to recover applications to their initial state in several realistic failure scenarios, including multiple, concurrent network partitionings. Copyright © 2007 John Wiley & Sons, Ltd.

show abstract

Group communication in partitionable systems: specification and algorithms

Cited by 54 publications

References 26 publications

Moshe

Moshe

Three‐tier replication for FT‐CORBA infrastructures

Jgroup/ARM: a distributed object group platform with autonomous replication management

Contact Info

Product

Resources

About