TY - JOUR
T1 - A new look at fault-tolerant network routing
AU - Dolev, Danny
AU - Halpern, Joseph Y.
AU - Simons, Barbara
AU - Strong, H. Raymond
PY - 1987/3
Y1 - 1987/3
N2 - We model a communication network as a graph in which a processor is a node and a communication link is an edge. A routing for such a network is a fixed path, or route, between each pair of nodes. Given a network with a predefined routing, we study the effects of faulty components on the routing. Of particular interest is the number of routes along which a message must travel between any two non-faulty nodes. This problem is analyzed for specific families of graphs and for classes of routings. We also give some bounds for general versions of the problem. Finally, we conclude with one of the most important contributions of this paper, a list of interesting and apparently difficult open problems.
AB - We model a communication network as a graph in which a processor is a node and a communication link is an edge. A routing for such a network is a fixed path, or route, between each pair of nodes. Given a network with a predefined routing, we study the effects of faulty components on the routing. Of particular interest is the number of routes along which a message must travel between any two non-faulty nodes. This problem is analyzed for specific families of graphs and for classes of routings. We also give some bounds for general versions of the problem. Finally, we conclude with one of the most important contributions of this paper, a list of interesting and apparently difficult open problems.
UR - http://www.scopus.com/inward/record.url?scp=0023308417&partnerID=8YFLogxK
U2 - 10.1016/0890-5401(87)90031-9
DO - 10.1016/0890-5401(87)90031-9
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0023308417
SN - 0890-5401
VL - 72
SP - 180
EP - 196
JO - Information and Computation
JF - Information and Computation
IS - 3
ER -