An efficient reliable ring protocol

Reuven Cohen; Adrian Segall

doi:10.1007/3-540-51687-5_33

An efficient reliable ring protocol

Reuven Cohen, Adrian Segall

Technion-Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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.

Original language	English
Title of host publication	Distributed Algorithms - 3rd International Workshop, Proceedings
Editors	Jean-Claude Bermond, Michel Raynal
Publisher	Springer Verlag
Pages	70-82
Number of pages	13
ISBN (Print)	9783540516873
DOIs	https://doi.org/10.1007/3-540-51687-5_33
State	Published - 1989
Externally published	Yes
Event	3rd International Workshop on Distributed Algorithms, WDAG 1989 - Nice, France Duration: 26 Sep 1989 → 28 Sep 1989

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	392 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	3rd International Workshop on Distributed Algorithms, WDAG 1989
Country/Territory	France
City	Nice
Period	26/09/89 → 28/09/89

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1989.

Access to Document

10.1007/3-540-51687-5_33

Cite this

Cohen, R., & Segall, A. (1989). An efficient reliable ring protocol. In J.-C. Bermond, & M. Raynal (Eds.), Distributed Algorithms - 3rd International Workshop, Proceedings (pp. 70-82). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 392 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-51687-5_33

@inproceedings{6b63bed8d1994009a88f9f29f1482d85,

title = "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 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.",

author = "Reuven Cohen and Adrian Segall",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1989.; 3rd International Workshop on Distributed Algorithms, WDAG 1989 ; Conference date: 26-09-1989 Through 28-09-1989",

year = "1989",

doi = "10.1007/3-540-51687-5_33",

language = "אנגלית",

isbn = "9783540516873",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "70--82",

editor = "Jean-Claude Bermond and Michel Raynal",

booktitle = "Distributed Algorithms - 3rd International Workshop, Proceedings",

address = "גרמניה",

}

Cohen, R & Segall, A 1989, An efficient reliable ring protocol. in J-C Bermond & M Raynal (eds), Distributed Algorithms - 3rd International Workshop, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 392 LNCS, Springer Verlag, pp. 70-82, 3rd International Workshop on Distributed Algorithms, WDAG 1989, Nice, France, 26/09/89. https://doi.org/10.1007/3-540-51687-5_33

An efficient reliable ring protocol. / Cohen, Reuven; Segall, Adrian.
Distributed Algorithms - 3rd International Workshop, Proceedings. ed. / Jean-Claude Bermond; Michel Raynal. Springer Verlag, 1989. p. 70-82 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 392 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An efficient reliable ring protocol

AU - Cohen, Reuven

AU - Segall, Adrian

PY - 1989

Y1 - 1989

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=2242472105&partnerID=8YFLogxK

U2 - 10.1007/3-540-51687-5_33

DO - 10.1007/3-540-51687-5_33

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:2242472105

SN - 9783540516873

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 70

EP - 82

BT - Distributed Algorithms - 3rd International Workshop, Proceedings

A2 - Bermond, Jean-Claude

A2 - Raynal, Michel

PB - Springer Verlag

T2 - 3rd International Workshop on Distributed Algorithms, WDAG 1989

Y2 - 26 September 1989 through 28 September 1989

ER -

An efficient reliable ring protocol

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this