Routing complexity of faulty networks

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 the d‐dimensional mesh. We use tools from percolation theory to show that in the d‐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 graph Gn,p. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008

[1]  I. Benjamini,et al.  A phase transition for the metric distortion of percolation on the hypercube , 2003, Comb..

[2]  J. Spencer,et al.  Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube , 2004, Comb..

[3]  Ali Esmaili,et al.  Probability and Random Processes , 2005, Technometrics.

[4]  Moni Naor,et al.  Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks , 2004, STOC '04.

[5]  N. Alon,et al.  Percolation on finite graphs and isoperimetric inequalities , 2002, math/0207112.

[6]  John Kubiatowicz,et al.  Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks , 2003, DISC.

[7]  Krishna P. Gummadi,et al.  The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.

[8]  Moni Naor,et al.  Scalable and dynamic quorum systems , 2003, PODC '03.

[9]  Moni Naor,et al.  A Simple Fault Tolerant Distributed Hash Table , 2003, IPTPS.

[10]  James Aspnes,et al.  Skip graphs , 2003, SODA '03.

[11]  Benny Sudakov,et al.  A Sharp Threshold for Network Reliability , 2002, Combinatorics, Probability and Computing.

[12]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[13]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[14]  Jon M. Kleinberg,et al.  Small-World Phenomena and the Dynamics of Information , 2001, NIPS.

[15]  J. Costa,et al.  ESTRESSES POR SOMBREAMENTO E DESFOLHAMENTO NO RENDIMENTO E SEUS COMPONENTES DA VARIEDADE DE FEIJÃO CARIOCA , 2000 .

[16]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[17]  Jeffrey E. Steif,et al.  On the continuity of the critical value for long range percolation in the exponential case , 1996 .

[18]  I. Benjamini,et al.  Percolation Beyond $Z^d$, Many Questions And a Few Answers , 1996 .

[19]  Ãgoston Pisztora,et al.  ON THE CHEMICAL DISTANCE FOR SUPERCRITICAL BERNOULLI PERCOLATION , 1996 .

[20]  Richard Cole,et al.  Routing on butterfly networks with random faults , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[21]  Anna R. Karlin,et al.  On the fault tolerance of the butterfly , 1994, STOC '94.

[22]  Richard Cole,et al.  Multi-scale self-simulation: a technique for reconfiguring arrays with faults , 1993, STOC '93.

[23]  Bruce M. Maggs,et al.  On the fault tolerance of some popular bounded-degree networks , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[24]  Thomas R. Mathies.  Percolation theory and computing with faulty arrays of processors , 1992, SODA '92.

[25]  Yoshiharu Kohayakawa,et al.  The Evaluation of Random Subgraphs of the Cube , 1992, Random Struct. Algorithms.

[26]  Anna R. Karlin,et al.  Asymptotically tight bounds for computing with faulty arrays of processors , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[27]  G. Grimmett,et al.  The supercritical phase of percolation is well behaved , 1990, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[28]  J. Håstad,et al.  Fast computation using faulty hypercubes , 1989, Symposium on the Theory of Computing.

[29]  Béla Bollobás,et al.  The Diameter of a Cycle Plus a Random Matching , 1988, SIAM J. Discret. Math..

[30]  Frank Thomson Leighton,et al.  Reconfiguring a hypercube in the presence of faults , 1987, STOC.

[31]  L. Schulman,et al.  One dimensional 1/|j − i|S percolation models: The existence of a transition forS≦2 , 1986 .

[32]  János Komlós,et al.  Largest random component of ak-cube , 1982, Comb..

[33]  H. Poincaré,et al.  Percolation ? , 1982 .

[34]  J. Spencer,et al.  EVOLUTION OF THE n-CUBE , 1979 .