On static and dynamic partitioning behavior of large-scale networks

In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affect the resilience of such graphs. We start by applying classical results from random graph theory to show that a large variety of deterministic and random P2P graphs almost surely (i.e., with probability 1-o(1)) remain connected under random failure if and only if they have no isolated nodes. This simple, yet powerful, result subsequently allows us to derive in closed-form the probability that a P2P network develops isolated nodes, and therefore partitions, under both types of node failure. We finish the paper by demonstrating that our models match simulations very well and that dynamic P2P systems are extremely resilient under node churn as long as the neighbor replacement delay is much smaller than the average user lifetime

[1]  Béla Bollobás.  The Evolution of the Cube , 1983 .

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

[3]  Laurent Massoulié,et al.  Failure resilience in balanced overlay networks , 2003 .

[4]  Shietung Peng,et al.  Unicast in Hypercubes with Large Number of Faulty Nodes , 1999, IEEE Trans. Parallel Distributed Syst..

[5]  Béla Bollobás,et al.  Random Graphs , 1985 .

[6]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[7]  Anne-Marie Kermarrec,et al.  Network awareness and failure resilience in self-organizing overlay networks , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[8]  Dmitri Loguinov,et al.  On zone-balancing of peer-to-peer networks: analysis of random node join , 2004, SIGMETRICS '04/Performance '04.

[9]  Seif Haridi,et al.  A Statistical Theory of Chord Under Churn , 2005, IPTPS.

[10]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[11]  Stefan Savage,et al.  Understanding Availability , 2003, IPTPS.

[12]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[13]  Abdol-Hossein Esfahanian,et al.  Generalized Measures of Fault Tolerance with Application to N-Cube Networks , 1989, IEEE Trans. Computers.

[14]  By DAVID J. ALDOUS,et al.  INEQUALITIES FOR RARE EVENTS IN TIME-REVERSIBLE MARKOV CHAINS I , 1992 .

[15]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[16]  Jianer Chen,et al.  Hypercube network fault tolerance: a probabilistic approach , 2002, Proceedings International Conference on Parallel Processing.

[17]  R. B. Lenin,et al.  Transient analysis in discrete time of Markovian queues with quadratic rates. , 2000 .

[18]  Eli Upfal,et al.  Building low-diameter peer-to-peer networks , 2003, IEEE J. Sel. Areas Commun..

[19]  Daniel Gross,et al.  A coherent model for reliability of multiprocessor networks , 1996, IEEE Trans. Reliab..

[20]  Jean-Luc Gaudiot,et al.  Network Resilience: A Measure of Network Fault Tolerance , 1990, IEEE Trans. Computers.

[21]  Shahram Latifi.  Combinatorial Analysis of the Fault-Diameter of the n-cube , 1993, IEEE Trans. Computers.

[22]  David R. Karger,et al.  Analysis of the evolution of peer-to-peer systems , 2002, PODC '02.

[23]  Antonio Galves,et al.  Inequalities for the occurrence times of rare events in mixing processes. The state of the art , 2000 .

[24]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[25]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[26]  David R. Karger,et al.  Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.

[27]  David Aldous,et al.  Inequalities for rare events in time-reversible Markov chains II , 1993 .

[28]  S. Resnick.  Adventures in stochastic processes , 1992 .

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

[30]  Klaus Sutner,et al.  The Complexity of the Residual Node Connectedness Reliability Problem , 1991, SIAM J. Comput..

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

[32]  Dmitri Loguinov,et al.  Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience , 2003, IEEE/ACM Transactions on Networking.

[33]  B. Bollobás.  The evolution of random graphs , 1984 .

[34]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[35]  Fabián E. Bustamante,et al.  Friendships that Last: Peer Lifespan and its Role in P2P Protocols , 2003, WCW.

[36]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[37]  Mathew D. Penrose,et al.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[38]  M. Penrose.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

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

[40]  Masaaki Kijima,et al.  Markov processes for stochastic modeling , 1997 .

[41]  Ben Y. Zhao,et al.  Impact of Neighbor Selection on Performance and Resilience of Structured P2P Networks , 2005, IPTPS.

[42]  L. Gordon,et al.  Two moments su ce for Poisson approx-imations: the Chen-Stein method , 1989 .