Space Efficient Edge-Fault Tolerant Routing

  title={Space Efficient Edge-Fault Tolerant Routing},
  author={Varun Rajan},
Let G be an undirected weighted graph with n vertices and m edges, and k ≥ 1 be an integer. We preprocess the graph in Õ(mn)1 time, constructing a data structure of size Õ(k · deg(v) + n1/k) words per vertex v ∈ V , which is then used by our routing scheme to ensure successful routing of packets even in the presence of a single edge fault. The scheme adds only O(k) words of information to the message. Moreover, the stretch of the routing scheme, i.e., the maximum ratio of the cost of the path… CONTINUE READING