About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
An Efficient Reliable Ring Protocol
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 five-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. © 1991 IEEE