Skip to main content
SpringerLink
Log in

Analysis of toggle protocols

  • Published:
Distributed Computing Aims and scope Submit manuscript

Summary

The paper deals with the problem of managing full and empty slots in a slotted ring network. Two solutions are formally described and proved correct. The first solution is deterministic; it recovers inO(N) round trips after the last error, whereN is the number of nodes in the network. The second solution is randomized; the expected number of round trips to recovery after the last error isO(lnN).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bain LJ: Statistical analysis of reliability and life-testing models. Dekker, New York 1978

    Google Scholar 

  2. Cohen R, Segall A: An efficient reliable ring protocol. Manuscript (1989)

  3. Dijkstra EW: Self-stabilizing systems in spite of distributed control. Commun ACM 17:643–644 (1974)

    Article  MATH  Google Scholar 

  4. Pachl J, Casey L: A robust ring transmission protocol. Comput Networks ISDN Syst 13:313–321 (1987)

    Google Scholar 

  5. Pachl J: Livelocks in slotted ring networks. Proc IEEE INFOCOM 88 Conference (March 29–31, 1988, New Orleans, Louisiana), pp 174–179

  6. Pachl J: Analysis of a nearly robust protocol for slotted ring networks. IBM Res Rep RZ 1854 (1989)

  7. Ross SM: Stochastic processes. Wiley. 1983

  8. Wilkes MV, Wheeler DJ: The Cambridge digital communication ring. In: Meisner NB, Rosenthal R (ed) Proc of the LAN Symposium (May 1979, Boston, Mass.), pp 47–61

  9. Wheeler DJ: The livelock-free protocol of the Cambridge Ring. Comput J 32: 95 (1989)

    Article  Google Scholar 

  10. Zafiropulo P, Rothauser EH: Signalling and frame structures in highly decentralized loop systems. Proc 1 st Int Conf on Computer Communications (October 24–26, 1972, Washington, DC), pp 309–315

Download references

Author information

Authors and Affiliations

  1. IBM Research Division, Zurich Research Laboratory, Säumerstrasse 4, CH-8803, Rüschlikon, Switzerland

    Jan Pachl

Authors
  1. Jan Pachl
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Jan Pachl works at IBM Zurich Research Laboratory. Previously he worked at BNR in Ottawa and at the University of Waterloo. His interests include communication protocols, distributed systems, skiing and loud music.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pachl, J. Analysis of toggle protocols. Distrib Comput 5, 25–35 (1991). https://doi.org/10.1007/BF02311230

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Key words

Search

Navigation