Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks

Previous analytical results on the resilience of unstructured P2P systems have not explicitly modeled heterogeneity of user churn (i.e., difference in online behavior) or the impact of in-degree on system resilience. To overcome these limitations, we introduce a generic model of heterogeneous user churn, derive the distribution of the various metrics observed in prior experimental studies (e.g., lifetime distribution of joining users, joint distribution of session time of alive peers, and residual lifetime of a randomly selected user), derive several closed-form results on the transient behavior of in-degree, and eventually obtain the joint in/out degree isolation probability as a simple extension of the out-degree model.

[1]  Frederic Paik Schoenberg,et al.  Rescaling Marked Point Processes , 2004 .

[2]  Simon S. Lam,et al.  Failure recovery for structured P2P networks: protocol design and performance evaluation , 2004, SIGMETRICS '04/Performance '04.

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

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

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

[6]  Ming Zhong,et al.  Non-uniform random membership management in peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[7]  Walter Willinger,et al.  Proof of a fundamental result in self-similar traffic modeling , 1997, CCRV.

[8]  Dmitri Loguinov,et al.  On static and dynamic partitioning behavior of large-scale networks , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

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

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

[11]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[12]  Anja Feldmann,et al.  Fitting Mixtures of Exponentials to Long-Tail Distributions to Analyze Network , 1998, Perform. Evaluation.

[13]  S. Bernstein,et al.  Sur les fonctions absolument monotones , 1929 .

[14]  Walter Willinger,et al.  Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level , 1997, TNET.

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

[16]  V. V. Petrov.  Sums of Independent Random Variables , 1975 .

[17]  Krishna P. Gummadi,et al.  Measurement study of peer-to-peer file system sharing , 2002 .

[18]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[19]  James Aspnes,et al.  Fault-tolerant routing in peer-to-peer systems , 2002, PODC '02.

[20]  Daniel P. Heyman,et al.  Stochastic models in operations research , 1982 .

[21]  Robert Tappan Morris,et al.  Bandwidth-efficient management of DHT routing tables , 2005, NSDI.

[22]  S. Resnick,et al.  Is network traffic approximated by stable Levy motion or fractional Brownian motion , 2002 .

[23]  Daniel Stutzbach,et al.  Understanding churn in peer-to-peer networks , 2006, IMC '06.

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

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

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

[27]  I. Kaj,et al.  Convergence of scaled renewal processes and a packet arrival model , 2003 .

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

[29]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[30]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

[31]  Dmitri Loguinov,et al.  On Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-Peer Networks , 2005, IEEE/ACM Transactions on Networking.

[32]  I. Kaj.  On Scaling Limits of Arrival Processes with Long-Range Dependence , 2002 .

[33]  Robert Tappan Morris,et al.  Comparing the Performance of Distributed Hash Tables Under Churn , 2004, IPTPS.

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

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

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

[37]  Krishna P. Gummadi,et al.  Measurement, modeling, and analysis of a peer-to-peer file-sharing workload , 2003, SOSP '03.

[38]  Alan F. Karr,et al.  Point Processes and Their Statistical Inference , 1991 .

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