Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

An efficient reliable ring protocol

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

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

Included in the following conference series:

  • 228 Accesses

Abstract

In slotted- and token-rings, transmission errors and station failures may induce livelocks and deadlocks. In the present paper we address the problem of ring recovery from such faulty situations. We present a new protocol and prove that it recovers from any combination of transmission errors and station failures in at most 5 ring revolutions. The protocol requires no information about the current topology of the ring, like the number of stations or the ring revolution propagation time. It uses only two frame bits for access control and achieves minimum delay at the ring stations.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. J. Pachl and L. Casey, "A robust ring transmission protocol". Computer Networks and ISDN Systems 13 (1987) 313–321.

    Google Scholar 

  2. J. Pachl, "Livelocks in slotted ring networks". Proceedings of IEEE INFOCOM 88 (March 29–31, 1988, New Orleans, Louisiana), pp. 174–179.

    Google Scholar 

  3. D.T.W. Sze., "A metropolitan area network". IEEE Journal on Selected Areas in Comm. SAC-3 (1985), 815–824.

    Google Scholar 

  4. D. J. Wheeler, "The Livelock-Free Protocol of The Cambridge Ring", The Computer Journal, Vol. 32, No. 1, pp. 95, 1989.

    Google Scholar 

  5. L.M. Casey, R.C. Dittburner and N.D. Gamage, "FXNET: a backbone ring for voice and data". IEEE Communication Magazine 24, 12 (December 1986), 23–28.

    Google Scholar 

  6. IEEE Standards for Local Area Networks: Token ring access method and physical layer specification" ANSI/IEEE Std 802.5 (1985). Published by IEEE. Distributed in cooperation with Wiley-Interscience.

    Google Scholar 

  7. W. Bux, F.H. Closs, K. Kuemmerle, H.J. Keller and H.R. Mueller, "Architecture and design of a reliable token-ring network". IEEE Journal on Selected Areas in Comm. Vol. SAC-1, No. 5, pp. 756–765, Nov. 1983.

    Google Scholar 

  8. R. Cohen and A. Segall, "An Efficient Reliable Ring Protocol", submitted to IEEE Transaction on Communication.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jean-Claude Bermond Michel Raynal

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cohen, R., Segall, A. (1989). An efficient reliable ring protocol. In: Bermond, JC., Raynal, M. (eds) Distributed Algorithms. WDAG 1989. Lecture Notes in Computer Science, vol 392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51687-5_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-51687-5_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51687-3

  • Online ISBN: 978-3-540-46750-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics