Routing complexity of faulty networks
- 9 March 2007
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 32 (1) , 71-87
Abstract
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This article investigates how big the failure probability can be, before the capability to efficiently find a path in the network is lost. Our main results show tight upper and lower bounds for the failure probability, which permits routing both for the hypercube and for thed‐dimensional mesh. We use tools from percolation theory to show that in thed‐dimensional mesh, once a giant component appears—efficient routing is possible. A different behavior is observed when the hypercube is considered. In the hypercube there is a range of failure probabilities in which short paths exist with high probability, yet finding them must involve querying essentially the entire network. Thus the routing complexity of the hypercube shows an asymptotic phase transition. The critical probability with respect to routing complexity lies in a different location than that of the critical probability with respect to connectivity. Finally we show that an oracle access to links (as opposed to local routing) may reduce significantly the complexity of the routing problem. We demonstrate this fact by providing tight upper and lower bounds for the complexity of routing in the random graphGn,p. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-CubeCombinatorica, 2006
- Percolation on finite graphs and isoperimetric inequalitiesThe Annals of Probability, 2004
- A Sharp Threshold for Network ReliabilityCombinatorics, Probability and Computing, 2002
- Percolation1999
- On the chemical distance for supercritical Bernoulli percolationThe Annals of Probability, 1996
- The Evolution of Random Subgraphs of the CubeRandom Structures & Algorithms, 1992
- The supercritical phase of percolation is well behavedProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1990
- The Diameter of a Cycle Plus a Random MatchingSIAM Journal on Discrete Mathematics, 1988
- Largest random component of ak-cubeCombinatorica, 1982
- Evolution of the n-cubeComputers & Mathematics with Applications, 1979