Abstract
We introduce a membership protocol that maintains the set of currently connected machines in an asynchronous and dynamic environment. The protocol handles both failures and joining of machines. It operates within a multicast communication sub-system.
It is well known that solving the membership problem in an asynchronous environment when faults may be present is impossible. In order to circumvent this difficulty, our approach rarely extracts from the membership live (but not active) machines unjustfully. The benefit is that our procotol always terminates within a finite time. In addition, if a machine is inadvertently taken out of the membership, it can rejoin it right away using the membership protocol.
Despite the asynchrony, configuration changes are logically synchronized with all the regular messages in the system, and appear virtually synchronous to the application layer.
The protocol presented here supports partitions and merges. When partitions and merging occur, the protocol provides the application with exact information about the status of the system. It is up to the application designer to merge the partitioned histories correctly.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Y. Amir, D. Dolev, S. Kramer, and D. Malki. Total ordering of messages in broadcast domains. Technical Report CS92-9, Dept. of Comp. Sci., the Hebrew University of Jerusalem, 1992.
Y. Amir, D. Dolev, S. Kramer, and D. Malki. Transis: A communication subsystem for high availability. In FTCS conference, number 22, pages 76–84, July 1992. previous version available as TR CS91-13, Dept. of Comp. Sci., the Hebrew University of Jerusalem.
K. Birman, R. Cooper, and B. Gleeson. Programming with process groups: Group and multicast semantics. TR 91-1185, dept. of Computer Science, Cornell University, Jan 1991.
K. Birman and T. Joseph. Exploiting virtual synchrony in distributed systems. In Ann. Symp. Operating Systems Principles, number 11, pages 123–138. ACM, Nov 87.
K. Birman, A. Schiper, and P. Stephenson. Lightweight causal and atomic group multicast. TR 91-1192, dept. of comp. sci., Conrell University, 91. revised version of ‘fast causal multicast'.
F. Cristian. Reaching agreement on processor group membership in synchronous distributed systems. Research Report RJ 5964, IBM Almaden Research Center, Mar. 1988.
D. Dolev, C. Dwork, and L. Stockmeyer. On the minimal synchrony needed for distributed consensus. J. ACM, 34(1):77–97, Jan. 1987.
M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32:374–382, April 1985.
A. Griefer and R. Strong. Dcf: Distributed communication with fault tolerance. In Ann. Symp. Principles of Distributed Computing, number 7, pages 18–27, August 1988.
L. Lamport. Time, clocks, and the ordering of events in a distributed system. Comm. ACM, 21(7):558–565, July 78.
P. M. Melliar-Smith, L. E. Moser, and V. Agrawala. Broadcast protocols for distributed systems. IEEE Trans. Parallel & Distributed Syst., (1), Jan 1990.
P. M. Melliar-Smith, L. E. Moser, and V. Agrawala. Membership algorithms for asynchronous distributed systems. In Intl. Conf. Distributed Computing Systems, May 91.
S. Mishra, L. L. Peterson, and R. D. Schlichting. A membership protocol based on partial order. In proc. of the intl. working conf. on Dependable Computing for Critical Applications, Feb 1991.
L. L. Peterson, N. C. Buchholz, and R. D. Schlichting. Preserving and using context information in interprocess communication. ACM Trans. Comput. Syst., 7(3):217–246, August 89.
A. M. Ricciardi and K. P. Birman. Using process groups to implement failure detection in asynchronous environments. TR 91-1188, Dept. of Computer Science, Cornell University, Feb 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amir, Y., Dolev, D., Kramer, S., Malki, D. (1992). Membership algorithms for multicast communication groups. In: Segall, A., Zaks, S. (eds) Distributed Algorithms. WDAG 1992. Lecture Notes in Computer Science, vol 647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56188-9_20
Download citation
DOI: https://doi.org/10.1007/3-540-56188-9_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56188-0
Online ISBN: 978-3-540-47484-5
eBook Packages: Springer Book Archive