On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks

—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to lifetime-based node failure and derives the expected delay before a user is forcefully isolated from the graph and the probability that this occurs within his/her lifetime. Using these metrics, we show that systems with heavy-tailed lifetime distributions are more resilient than those with light-tailed (e.g., exponential) distributions and that for a given average degree, -regular graphs exhibit the highest level of fault tolerance. As a practical illustration of our results, each user in a system with = 100 billion peers, 30-minute average lifetime, and 1-minute node-replacement delay can stay connected to the graph with probability 1 1 using only 9 neighbors. This is in contrast to 37 neighbors required under previous modeling efforts. We finish the paper by observing that many P2P networks are almost surely...

• Type: Conference
• Year: 2005
• Where: SIGMETRICS
• Authors: Derek Leonard, Vivek Rai, Dmitri Loguinov
• Keywords: Heavy-tailed Lifetime Distributions, Model P2p Networks, P2P Networks, SIGMETRICS 2005