On fault tolerant routings in general networks

David Peleg; Barbara Simons

doi:10.1145/10590.10599

On fault tolerant routings in general networks

David Peleg, Barbara Simons

IBM

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

4 Scopus citations

Abstract

We construct fault tolerant routings for several families of graphs, including all graphs of maximal degree less than cm^1/3 for some c > 0. With these routings, the diameter of the survival graph is bounded by a constant (e.g., 4 or 6), so long as the number of faults is less than the connectivity of the graph. This result partially confirms a conjecture of Dolev et. al. [DHSS].

Original language	English
Title of host publication	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
Publisher	Association for Computing Machinery
Pages	98-107
Number of pages	10
ISBN (Electronic)	0897911989
DOIs	https://doi.org/10.1145/10590.10599
State	Published - 1 Nov 1986
Externally published	Yes
Event	5th Annual ACM Symposium on Principles of Distributed Computing, PODC 1986 - Calgary, Canada Duration: 11 Aug 1986 → 13 Aug 1986

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	5th Annual ACM Symposium on Principles of Distributed Computing, PODC 1986
Country/Territory	Canada
City	Calgary
Period	11/08/86 → 13/08/86

Bibliographical note

Publisher Copyright:
© 1986 ACM.

Access to Document

10.1145/10590.10599

Cite this

@inproceedings{43e6ddbfc47b4af8977aab481ca2ee8f,

title = "On fault tolerant routings in general networks",

abstract = "We construct fault tolerant routings for several families of graphs, including all graphs of maximal degree less than cm1/3 for some c > 0. With these routings, the diameter of the survival graph is bounded by a constant (e.g., 4 or 6), so long as the number of faults is less than the connectivity of the graph. This result partially confirms a conjecture of Dolev et. al. [DHSS].",

author = "David Peleg and Barbara Simons",

note = "Publisher Copyright: {\textcopyright} 1986 ACM.; 5th Annual ACM Symposium on Principles of Distributed Computing, PODC 1986 ; Conference date: 11-08-1986 Through 13-08-1986",

year = "1986",

month = nov,

day = "1",

doi = "10.1145/10590.10599",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

pages = "98--107",

booktitle = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

}

Peleg, D & Simons, B 1986, On fault tolerant routings in general networks. in Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, pp. 98-107, 5th Annual ACM Symposium on Principles of Distributed Computing, PODC 1986, Calgary, Canada, 11/08/86. https://doi.org/10.1145/10590.10599

On fault tolerant routings in general networks. / Peleg, David; Simons, Barbara.
Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 1986. p. 98-107 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

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

TY - GEN

T1 - On fault tolerant routings in general networks

AU - Peleg, David

AU - Simons, Barbara

PY - 1986/11/1

Y1 - 1986/11/1

N2 - We construct fault tolerant routings for several families of graphs, including all graphs of maximal degree less than cm1/3 for some c > 0. With these routings, the diameter of the survival graph is bounded by a constant (e.g., 4 or 6), so long as the number of faults is less than the connectivity of the graph. This result partially confirms a conjecture of Dolev et. al. [DHSS].

AB - We construct fault tolerant routings for several families of graphs, including all graphs of maximal degree less than cm1/3 for some c > 0. With these routings, the diameter of the survival graph is bounded by a constant (e.g., 4 or 6), so long as the number of faults is less than the connectivity of the graph. This result partially confirms a conjecture of Dolev et. al. [DHSS].

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

U2 - 10.1145/10590.10599

DO - 10.1145/10590.10599

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

AN - SCOPUS:84916431041

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 98

EP - 107

BT - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery

T2 - 5th Annual ACM Symposium on Principles of Distributed Computing, PODC 1986

Y2 - 11 August 1986 through 13 August 1986

ER -

On fault tolerant routings in general networks

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this