Consul: a communication substrate for fault-tolerant distributed programs

Mishra, Shivakant

doi:10.1088/0967-1846/1/2/004

Cited by 92 publications

(50 citation statements)

References 58 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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

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: Introductionmentioning

confidence: 99%

Moshe

Keidar

Sussman

Marzullo

et al. 2002

ACM Trans. Comput. Syst.

View full text Add to dashboard Cite

show abstract

“…Process membership services have been developed in the context of group-based systems, and their main objective is to provide a consistent view of which processes are currently members of a group, despite process joints, departures or failures [2][3][4][5][6][7][8]. Distributed system-level diagnosis protocols locate process failures, and then distribute this information in such a way that each node can independently determine the set of failure-free processes [9][10][11][12][13][14].…”

Section: Related Workmentioning

confidence: 99%

Fault detection using hints from the socket layer

Neves

Fuchs²

Proceedings of SRDS'97: 16th IEEE Symposium on Reliable Distributed Systems

View full text Add to dashboard Cite

show abstract

“…Other real-time protocols include TTP [15], and XPA [18]. Non-real-time group communication protocols include ISIS [7], Consul [17], Delta-4 [18], Spinglass [6], and Transis [11].…”

Section: Application Overviewmentioning

confidence: 99%