Abstract
An efficient way to synchronize an asynchronous network with a bounded delay message delivery is presented. Two types of synchronization algorithms are presented. Both types require an initializing phase that costs |E| messages (where |E| is the number of links). The first requires an additional bit in every message and increases the time complexity by a factor of 2. The second does not require any additional bits but increases the time complexity by a factor of 3.
This work was done while the author was with IBM T. J. Watson Research Center, Yorktown Heights, N.Y. 10598.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Awerbuch, "Complexity of Network Synchronization," Journal of the ACM, 32(4), pp. 804–823 (October 1985).
I. Cidon, I.S. Gopal and H. Meleis, "PARIS: An Approach to Private Integrated Networks," IBM Research Report, November 1986.
S. Even, "Graph Algorithms," Computer Science Press, Potomac, MD, 1979, pp. 12–18.
A. Segall "Distributed Network Protocols," IEEE Trans. on Information Theory, Vol.IT-29, No.1, pp.23–35, Jan.1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chou, CT., Cidon, I., Gopal, I.S., Zaks, S. (1988). Synchronizing asynchronous bounded delay networks. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019806
Download citation
DOI: https://doi.org/10.1007/BFb0019806
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19366-1
Online ISBN: 978-3-540-39239-2
eBook Packages: Springer Book Archive