Name
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 non-exponential 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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/TNET.2014.2306153 | Networking, IEEE/ACM Transactions |
Keywords | Field | DocType |
Peer-to-peer computing,Resilience,IEEE transactions,Tuning,Delays,Shape,Piecewise linear approximation | Graph theory,Redux,Psychological resilience,Graph,Computer science,Peer to peer computing,Stochastic process,Theoretical computer science,Stochastic modelling,Distributed computing | Conference |
Volume | Issue | ISSN |
23 | 3 | 1063-6692 |
ISBN | Citations | PageRank |
978-1-4673-5944-3 | 1 | 0.35 |
References | Authors | |
19 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhongmei Yao | 1 | 218 | 11.27 |
| Daren B. H. Cline | 2 | 16 | 5.02 |
| Dmitri Loguinov | 3 | 1298 | 91.08 |