Skip to main content
SpringerLink
Log in

Synchronizing asynchronous bounded delay networks

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 312))

Included in the following conference series:

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.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Awerbuch, "Complexity of Network Synchronization," Journal of the ACM, 32(4), pp. 804–823 (October 1985).

    Article  Google Scholar 

  2. I. Cidon, I.S. Gopal and H. Meleis, "PARIS: An Approach to Private Integrated Networks," IBM Research Report, November 1986.

    Google Scholar 

  3. S. Even, "Graph Algorithms," Computer Science Press, Potomac, MD, 1979, pp. 12–18.

    Google Scholar 

  4. A. Segall "Distributed Network Protocols," IEEE Trans. on Information Theory, Vol.IT-29, No.1, pp.23–35, Jan.1983.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, 90024, Los Angeles, CA

    Ching-Tsun Chou

  2. IBM T. J. Watson Research Center, 10598, Yorktown Heights, NY

    Israel Cidon & Inder S. Gopal

  3. Department of Computer Science, Technion, 32000, Haifa, Israel

    Shmuel Zaks

Authors
  1. Ching-Tsun Chou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Israel Cidon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Inder S. Gopal
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shmuel Zaks
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Leeuwen

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation