Scalable group membership services for novel
                    applications

Anker, Tal; Chockler, Gregory; Dolev, Danny; Keidar, Idit

doi:10.1090/dimacs/045/02

Cited by 32 publications

(34 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moshe is part of a novel architecture for group membership services designed for CSCW applications in WANs [Anker et al 1998]. This architecture employs a client-server approach: group membership services are provided by dedicated membership servers, which themselves are not members of any multicast group.…”

Section: A Client-server Designmentioning

confidence: 99%

“…A similar guarantee is formally defined in terms of network stability and failure detector properties in [Anker et al 1998;Chockler et al 2001].…”

Section: Membership Guaranteesmentioning

confidence: 99%

“…Moshe is implemented as part of a novel group membership service for computer supported cooperative work (CSCW) applications in WANs [Anker et al 1998]. 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 2 more Smart Citations

Moshe

Keidar

Sussman

Marzullo

et al. 2002

ACM Trans. Comput. Syst.

Self Cite

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: A Client-server Designmentioning

confidence: 99%

“…A similar guarantee is formally defined in terms of network stability and failure detector properties in [Anker et al 1998;Chockler et al 2001].…”

Section: Membership Guaranteesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Moshe

Keidar

Sussman

Marzullo

et al. 2002

ACM Trans. Comput. Syst.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Some of them (e.g. [15,16,17]) implement different semantics, with more relaxed consistency guarantees.…”

Section: Motivation and Scopementioning

confidence: 99%

Protocolos de pertenencia a grupos para entornos dinámicos

Polo¹,

Carmén²

View full text Add to dashboard Cite

En primer lugar me gustaría dar las gracias a mi director de tesis, el Profesor Pablo Galdámez Saiz, por su apoyo y colaboración a lo largo del trabajo científico, y por su ayuda para lidiar con los trámites burocráticos en la etapa final de esta tesis.Al Profesor José M. Bernabéu Aubán agradezco que me diera en primer lugar la oportunidad de entrar a formar parte del grupo de Sistemas Distribuidos. Asimismo, agradezco al Instituto Tecnológico de Informática el haberme permitido investigar durante estos años los problemas de algoritmos distribuidos tratados en esta tesis, y compaginar mi trabajo con la investigación y la docencia en otros campos.Mi agradecimiento también es para el profesor Francesc D. Muñoz Escoí, cuya revisión y asesoramiento han sido de gran ayuda a lo largo de las distintas fases del trabajo. También agradezco al profesor Pietro Manzoni las sugerencias que llevaron a desarrollar laúltima parte de esta tesis.Agradezco igualmente a los revisores de este manuscrito los comentarios y correcciones que han contribuido a mejorarlo y a darle su forma definitiva.Quiero dar las gracias a todos los miembros de los grupos de investigación de Sistemas Fiables y Sistemas Distribuidos del ITI, y en particular a Emili Miedes y Juan Carlos García, con quienes he colaborado directamente en algunos de losúltimos trabajos, y a Rubén de Juan por su colaboración en la revisión de este texto. Hago extensivo mi agradecimiento a todos los compañeros del Instituto por su ayuda con los diferentes problemas técnicos y por hacer el trabajo de cada día más ameno y gratificante.Porúltimo, aunque no por ello menos importante, agradezco a toda mi familia su apoyo yánimo. Y muy especialmente agradezco a Emi el que esté siempre a mi lado, confiando en mí y alentándome a continuar cuando no sé cómo seguir adelante.

show abstract

“…Recently, Keidar et al 27,8] proposed a novel client-server oriented group membership service that decouples membership maintenance from group multicast, in order to provide scalable membership services in a wide area network (WAN). In their approach, a small set of dedicated membership servers maintains client membership information (i.e., which clients are members of each group).…”

Section: Introductionmentioning

confidence: 99%

A client-server approach to virtually synchronous group multicast: specifications and algorithms

Keidar¹,

Khazan

Proceedings 20th IEEE International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

This paper presents a formal design for a novel group multicast service that provides virtually synchronous semantics in asynchronous fault-prone environments. The design employs a clientserver architecture in which group membership is maintained not by e v ery process but only by dedicated membership servers, while virtually synchronous group multicast is implemented by service end-points running at the clients. This architecture allows the service to be scalable in the topology it spans, in the number of groups, and in the number of clients. Our design allows the virtual synchrony algorithm to run in a single message exchange round, in parallel with the membership algorithm: it does not require pre-agreement upon a common identi er by the membership algorithm.Speci cally, the paper de nes service semantics for the client-server interface, that is, for the group membership service. The paper then speci es virtually synchronous semantics for the new group multicast service, as a collection of safety a n d l i v eness properties. These properties have been previously suggested and have been shown to be useful for distributed applications. The paper then presents new algorithms that use the de ned group membership service to implement the speci ed properties. The speci cations and algorithms are presented incrementally, using a novel inheritance-based formal construct 26]. The algorithm that provides the complete virtually synchronous semantics executes in a single message round, and is therefore more e cient than previously suggested algorithms providing such semantics. The algorithm has been implemented in C++. All the speci cations and algorithms are presented using the I/O automaton formalism. Furthermore, the paper includes formal proofs showing that the algorithms meet their speci cations. Safety properties are proven using invariant assertions and simulations. Liveness is proven using invariant assertions and careful operational arguments.

show abstract

Scalable group membership services for novel applications

Cited by 32 publications

References 8 publications

Moshe

Moshe

Protocolos de pertenencia a grupos para entornos dinámicos

A client-server approach to virtually synchronous group multicast: specifications and algorithms

Contact Info

Product

Resources

About