ACM SIGMETRICS Performance Evaluation Review
This paper builds a complete modeling framework for understanding user churn and in-degree dynamics in unstructured P2P systems in which each user can be viewed as a stationary alternating renewal process. While the classical Poisson result on the superposition of n stationary renewal processes for n→∞ requires that each point process become sparser as n increases, it is often difficult to rigorously show this condition in practice. In this paper, we first prove that despite user heterogeneity and non-Poisson arrival dynamics, a superposition of edge-arrival processes to a live user under uniform selection converges to a Poisson process when system size becomes sufficiently large. Using this finding, we then obtain closed-form results on the transient behavior of in-degree, paving novel ways for a variety of additional analysis of decentralized P2P systems.
Copyright © ACM, 2011. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Sigmetrics Performance Evaluation Review, Volume 38, Issue 3 (2011).
Place of Publication
New York, NY
P2P networks, Poisson, user churn, in-degree dynamics, algorithms, peer-to-peer, superposition
Association for Computing Machinery
Yao, Zhongmei; Cline, Daren B. H.; and Loguinov, Dmitri, "In-Degree Dynamics of Large-Scale P2P Systems" (2011). Computer Science Faculty Publications. 12.
Databases and Information Systems Commons, Graphics and Human Computer Interfaces Commons, Numerical Analysis and Scientific Computing Commons, OS and Networks Commons, Other Computer Sciences Commons, Software Engineering Commons, Theory and Algorithms Commons