Skip to main content
SpringerLink
Log in

Directed network protocols

  • 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

We present a uniform approach to the description and validation of several known and unknown distributed algorithms for solving control problems in computer networks using unidirectional communication. After introducing two basic protocols, we use these to build algorithms for Resynch [Fi79], Connectivity, Min Hop Routing and Distributed Infimum Approximation [Te86]. All protocols are extended in a uniform way to cope with changing network topology and the failure of nodes and links. The protocols are all optimal in time complexity.

This work was supported by the Foundation for Computer Science (SION) of the Netherlands Organization for the Advancement of Pure Research (ZWO). The author's UUCP address is: ..!mcvax!ruuinfvax!gerard.

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.

10 References

  1. Awerbuch, B., Complexity of network synchronization, J. ACM 32 (Oct 1985), 804–823.

    Article  Google Scholar 

  2. Dijkstra, E.W., and C.S. Scholten, Termination detection for diffusing computations, Inf. Proc. Let. 11 (August 1980), 1–4.

    Article  Google Scholar 

  3. Erikson, O., and S. Skyum, Symmetric distributed termination, Techn. Rep. DAIMI PB189, Univ. of Aarhus, Aarhus, 1985.

    Google Scholar 

  4. Finn, S.G., Resynch procedures and a fail-safe network protocol, IEEE Trans. Communications COM-27 (June 1979), 840–845.

    Article  Google Scholar 

  5. Francez, N., Distributed termination, ACM ToPLaS 2 (1980), 42–55.

    Article  Google Scholar 

  6. Gafni, E., and Y. Afek, Election and traversal in unidirectional networks, Proc. 4th symp. on Principles of Distr. Comp., Vancouver, Canada, 1984.

    Google Scholar 

  7. Gafni, E., M.C. Loui, P. Tiwari, D.B. West, S. Zaks, Lower bounds on common knowledge in distributed systems, Techn. Rep R-1017, Coordinated Science Laboratory, University of Illinois, September 1984.

    Google Scholar 

  8. Gafni, E., Perspectives on distributed network protocols: a case for building blocks, MILCOM86.

    Google Scholar 

  9. Jefferson, D.R., Virtual time, ACM ToPLaS 7 (1985), 404–423.

    Article  Google Scholar 

  10. Kutten, S., Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed graphs, Technion, Haifa, 1987.

    Google Scholar 

  11. Segall, A., Distributed network protocols, IEEE Trans. Inf. Theory IT-29 (1983), 23–25.

    Article  Google Scholar 

  12. Sarin, S.K., and N.A. Lynch, Discarding obsolete information in a replicated database system, IEEE Trans. Soft. Eng. SE-13 (Jan. 1987), 39–47.

    Google Scholar 

  13. Szymanski, B., Y. Shy, and N. Prywes, Terminating iterative solutions of simultaneous equations in distributed message passing systems, Proc. 4th symp. on Principles of Distr. Comp., Vancouver, Canada, 1984.

    Google Scholar 

  14. Tel, G., Distributed infimum approximation, Techn. Rep. RUU-CS-86-12, Univ. of Utrecht, Utrecht, 1986.

    Google Scholar 

  15. Tel, G., and R.B. Tan, The Equivalence of Some Network Problems, notes July 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Utrecht, P.O. Box 80.012, 3508 TA, Utrecht, The Netherlands

    Gerard Tel

Authors
  1. Gerard Tel
    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

Tel, G. (1988). Directed network protocols. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019791

Download citation

  • DOI: https://doi.org/10.1007/BFb0019791

  • 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