Unstructured P2P Link Lifetimes Redux

Author

Zhongmei Yao ; Cline, Daren B. H. ; Loguinov, Dmitri

Author_Institution

Univ. of Dayton, Dayton, OH, USA

Volume

23

Issue

3

fYear

2015

fDate

Jun-15

Firstpage

755

Lastpage

767

Abstract

We revisit link lifetimes in random P2P graphs under dynamic node failure and create a unifying stochastic model that generalizes the majority of previous efforts in this direction. We not only allow nonexponential user lifetimes and age-dependent neighbor selection, but also cover both active and passive neighbor-management strategies, model the lifetimes of incoming and outgoing links, derive churn-related message volume of the system, and obtain the distribution of transient in/out degree at each user. We then discuss the impact of design parameters on overhead and resilience of the network.

Keywords

computer network management; computer network reliability; graph theory; peer-to-peer computing; stochastic processes; active neighbor-management strategies; age-dependent neighbor selection; churn-related message volume; design parameters; dynamic node failure; incoming link lifetime; nonexponential user lifetimes; outgoing link lifetime; passive neighbor-management strategies; random P2P graphs; unifying stochastic model; unstructured P2P link lifetimes redux; Delays; IEEE transactions; Peer-to-peer computing; Piecewise linear approximation; Resilience; Shape; Tuning; In-degree; stochastic modeling; user churn;

fLanguage

English

Journal_Title

Networking, IEEE/ACM Transactions on

Publisher

ieee

ISSN

1063-6692

Type

jour

DOI

10.1109/TNET.2014.2306153

Filename

6750099