Advertisement

Synchronizing asynchronous bounded delay networks

  • Ching-Tsun Chou
  • Israel Cidon
  • Inder S. Gopal
  • Shmuel Zaks
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 312)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    B. Awerbuch, "Complexity of Network Synchronization," Journal of the ACM, 32(4), pp. 804–823 (October 1985).CrossRefGoogle Scholar
  2. [2]
    I. Cidon, I.S. Gopal and H. Meleis, "PARIS: An Approach to Private Integrated Networks," IBM Research Report, November 1986.Google Scholar
  3. [3]
    S. Even, "Graph Algorithms," Computer Science Press, Potomac, MD, 1979, pp. 12–18.Google Scholar
  4. [4]
    A. Segall "Distributed Network Protocols," IEEE Trans. on Information Theory, Vol.IT-29, No.1, pp.23–35, Jan.1983.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Ching-Tsun Chou
    • 1
  • Israel Cidon
    • 2
  • Inder S. Gopal
    • 2
  • Shmuel Zaks
    • 3
  1. 1.Department of Computer ScienceUniversity of CaliforniaLos Angeles
  2. 2.IBM T. J. Watson Research CenterYorktown Heights
  3. 3.Department of Computer Science, TechnionHaifaIsrael

Personalised recommendations