A new look at fault tolerant network routing

Danny Dolev, Joe Halpern, Barbara Simons, Ray Strong

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

28 Scopus citations

Abstract

Consider a communication network G in which a limited number of link and/or node faults F might occur. A routing p for the network (a fixed path between each pair of nodes) must be chosen without any knowledge of which components might become faulty. Choosing a good routing corresponds to bounding the diameter of the surviving route graph R(G,ρ)/F, where two nonfaulty nodes are joined by an edge if there are no faults on the route between them. We prove a number of results concerning the diameter of surviving route graphs. We show that if p is a minimal length routing, then the diameter of R(G, ρ)/F can be on the order of the number of nodes of G, even if F consists of only a single node. However, if G is the n-dimensional cube, the diameter of R(G, ρ)/F<3 for any minimal length routing p and any set of faults F with IFl<n. We also show that if F consists only of edges and does not disconnect G, then the diameter of R(G, ρ)/F is < 3IFI+1, while if F consists only of nodes and does not disconnect G, then the diameter of R(G, ρ)/F is < the sum of the degrees of the nodes in F, where in both cases ρ is an arbitrary minimal length routing. We conclude with one of the most important contributions of this paper: a list of interesting and apparently difficult open problems.

Original languageEnglish
Title of host publicationProceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC 1984
PublisherAssociation for Computing Machinery
Pages526-535
Number of pages10
ISBN (Electronic)0897911334
DOIs
StatePublished - 1 Dec 1984
Event16th Annual ACM Symposium on Theory of Computing, STOC 1984 - Washington, United States
Duration: 30 Apr 19842 May 1984

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference16th Annual ACM Symposium on Theory of Computing, STOC 1984
Country/TerritoryUnited States
CityWashington
Period30/04/842/05/84

Bibliographical note

Publisher Copyright:
© 1984 ACM.

Fingerprint

Dive into the research topics of 'A new look at fault tolerant network routing'. Together they form a unique fingerprint.

Cite this