Abstract
This paper studies the usage of broadcast communication in distributed services. The approach taken is practical: all the algorithms are asynchronous, and tolerate realistic faults. We study four problems in a broadcast domain: clock synchronization, reliable and ordered broadcast, membership, and file replication. The clock synchronization algorithm shows for the first time how to utilize broadcast communication for synchronization. The master synchronizes any number of slaves while incurring a constant load. The approach taken in the file replication tool uses snooping in order to enhance the availability of file systems, at almost no cost.
This work was supported in part by GIF I-207-199.6/91
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Y. Amir, D. Dolev, S. Kramer, and D. Malki. Membership Algorithms for Multicast Communication Groups. In Intl. Workshop on Distributed Algorithms proceedings (WDAG-6), (LCNS, 647), number 6th, pages 292–312, November 1992.
Y. Amir, D. Dolev, S. Kramer, and D. Malki. Transis: A Communication Sub-System for High Availability. In Annual International Symposium on Fault-Tolerant Computing, number 22, pages 76–84, July 1992.
Y. Amir, L. E. Moser, P. M. Melliar-Smith, D. A. Agarwal, and P. Ciarfella. Fast Message Ordering and Membership Using a Logical Token-Passing Ring. In Intl. conf. on Distributed Computing Systems, 1993. to appear.
J. Auerbach, M. Gopal, M. Kaplan, and S. Kutten. Multicast group membership management in high speed wide area networks. In proc. intl. conference on Distributed Computing Systems, number 11, pages 231–238, May 1991.
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, R. Cooper, T. A. Joseph, K. Marzullo, M. Makpangou, K. Kane, F. Schmuck, and M. Wood. The ISIS System Manual. Dept of Computer Science, Cornell University, Sep 90.
K. Birman, A. Schiper, and P. Stephenson. Lightweight Causal and Atomic Group Multicast. ACM Trans. Comput. Syst., 9(3):272–314, 1991.
D. R. Cheriton and W. Zwaenepoel. Distributed Process Groups in the V Kernel. ACM Trans. Comput. Syst., 2(3):77–107, May 1985.
F. Cristian. Reaching Agreement on Processor Group Membership in Synchronous Distributed Systems. Distributed Computing, 4(4), April 1991.
S. E. Deering. Host extensions for IP multicasting. RFC 1112, SRI Network Information Center, August 1989.
D. Dolev, C. Dwork, and L. Stockmeyer. On the minimal synchrony needed for distributed consensus. J. ACM, 34(1):77–97, Jan. 1987.
D. Dolev, S. Kramer, and D. Malki. Early Delivery Totally Ordered Broadcast in Asynchronous Environments. In Annual International Symposium on Fault-Tolerant Computing, number 23, June 1993.
D. Dolev, R.Reischuk, and H.R.Strong. Clock Synchronization Algorithms on a LAN. in preparation, 1993.
M. Fischer, N. Lynch, and M. Paterson. Impossibility of Distributed Consensus with One Faulty Process. J. ACM, 32:374–382, April 1985.
Y. Harari. Warm Backup Tool for Unix Network File System. internal manuscript, 1992.
F. Jahanian and W. Moran. Strong, Weak and Hybrid Group Membership. unpublished, IBM internal draft, 1992.
M. F. Kaashoek, A. S. Tanenbaum, S. F. Hummel, and H. E. Bal. An Efficient Reliable Broadcast Protocol. Operating Systems Review, 23(4):5–19, October 1989.
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.
J. B. Postel. User Datagram Protocol. RFC 768, SRI Network Information Center, August 1980.
A. M. Ricciardi and K. P. Birman. Using Process Groups to Implement Failure Detection in Asynchronous Environments. In proc. annual ACM Symposium on Principles of Distributed Computing, pages 341–352, August 1991.
A. M. Ricciardi, K. P. Birman, and P. Stephenson. The Cost of Order in Asynchronous Systems. In Intl. Workshop on Distributed Algorithms proceedings (WDAG-6), (LCNS, 647), number 6th, pages 329–345, November 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dolev, D., Malki, D. (1993). On distributed algorithms in a broadcast domain. In: Lingas, A., Karlsson, R., Carlsson, S. (eds) Automata, Languages and Programming. ICALP 1993. Lecture Notes in Computer Science, vol 700. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_87
Download citation
DOI: https://doi.org/10.1007/3-540-56939-1_87
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56939-8
Online ISBN: 978-3-540-47826-3
eBook Packages: Springer Book Archive