A New Look at Fault Tolerant Network Routing

  title={A New Look at Fault Tolerant Network Routing},
  author={Danny Dolev and Joseph Y. Halpern and Barbara B. Simons and H. Raymond Strong},
  journal={Inf. Comput.},
Consider a communication network G in which a limited number of link and/or node faults F might occur. A routing &rgr; 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,&rgr;)/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… CONTINUE READING