IEEE/ACM Transactions on Networking
Previous analytical studies of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this paper, we overcome these limitations by introducing a general node-isolation model for heavy-tailed user lifetimes and arbitrary neighbor-selection algorithms. Using this model, we analyze two age-biased neighbor-selection strategies and show that they significantly improve the residual lifetimes of chosen users, which dramatically reduces the probability of user isolation and graph partitioning compared with uniform selection of neighbors. In fact, the second strategy based on random walks on age-proportional graphs demonstrates that, for lifetimes with infinite variance, the system monotonically increases its resilience as its age and size grow. Specifically, we show that the probability of isolation converges to zero as these two metrics tend to infinity. We finish the paper with simulations in finite-size graphs that demonstrate the effect of this result in practice.
144 - 157
Copyright © 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
graph theory, peer-to-peer computing, probability, random processes, telecommunication network reliability, age-proportional graphs, arbitrary age-biased neighbor-selection algorithm, exponential user lifetimes, finite-size graphs, graph partitioning, heavy-tailed user lifetimes, node-isolation model, probability, random walks, residual lifetimes, unstructured P2P network resilience, user isolation, Age-based selection, heavy-tailed lifetimes, node isolation, peer-to-peer networks, user churn
Yao, Zhongmei; Leonard, Derek; and Loguinov, Dmitri, "Node Isolation Model and Age-Based Neighbor Selection in Unstructured P2P Networks" (2009). Computer Science Faculty Publications. 7.
Databases and Information Systems Commons, Numerical Analysis and Scientific Computing Commons, OS and Networks Commons, Other Computer Sciences Commons, Systems Architecture Commons, Theory and Algorithms Commons