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

Performance Evaluation Review

Volumn 33, Issue 1, 2005, Pages 26-37

  Leonard, Derek ^a   Rai, Vivek ^a   Loguinov, Dmitri ^a  

^a Texas AandM University   (United States)

Author keywords

Pareto; Peer to Peer; Stochastic Lifetime Resilience

Indexed keywords

FAILURE ANALYSIS; GRAPH THEORY; PROBABILITY; RANDOM PROCESSES; USER INTERFACES;

PARETO; PEER-TO-PEER; STOCHASTIC LIFETIME RESILIENCE;

COMPUTER NETWORKS;

EID: 33244488536     PISSN: 01635999     EISSN: 01635999     Source Type: Conference Proceeding    
DOI: 10.1145/1071690.1064217     Document Type: Conference Paper

References (36)

1. M. Abadi and A. Calves, "Inequalities for the Occurrence Times of Rare Events in Mixing Processes. The State of the Art," Markov Proc. Relat. Fields, vol. 7, no. 1, 2001.
2. P.W. Atkins. Physical Chemistry. Freeman, NY, 1986.
3. D.J. Aldous and M. Brown, "Inequalities for Rare Events in Time-Reversible Markov Chains II," Stochastic Processes and their Applications, vol. 44, 1993.
4. J. Aspnes, Z. Diamadi, and G. Shah, "Fault Tolerant Routing in Peer to Peer Systems," ACM PODC, 2002.
5. R. Bhagwan, S. Savage, and G.M. Voelker, "Understanding Availability," IPTPS, 2003.
6. B. Bollobás. Random Graphs. Cambridge U. Press, 2001.
7. Yu.D. Burtin, "Connection Probability of a Random Subgraph of an n-Dimensional Cube," Probl. Pered. Inf., vol. 13, no. 2, April-June 1977.
8. F.E. Bustemante and Y. Qiao, "Friendships that Last: Peer Lifespan and its Role in P2P Protocols," Intl. Workshop on Web Caching and Distribution, September 2003.
9. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, "Making Gnutella Like P2P Systems Scalable", ACM SIGCOMM, 2003.
10. R. Cohen, K. Erez, D. ben-Avraham, and S. Havlin, "Resilience of the Internet to Random Breakdowns," Physical Review Letters, vol. 85, no. 21, November 2000.
11. A. Fiat and J. Saia, "Censorship Resistant Peer-to-Peer Content Addressable Networks," ACM-SIAM SODA, 2002.
12. A. Ganesh and L. Massoulie, "Failure Resilience in Balanced Overlay Networks," Allerton Conference on Communication, Control and Computing, 2003.
13. C. Gkantsidis, M. Mihail, A. Saberi, "Random Walks in Peer-to-Peer Networks," IEEE INFOCOM, March 2004.
14. K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica, "The Impact of DHT Routing Geometry on Resilience and Proximity," ACM SIGCOMM, 2003.
15. D. Heath, S. Resnick, and G. Samorodnitsky, "Patterns Of Buffer Overflow In A Class Of Queues With Long Memory In The Input Stream," Annals of Probability, 1997.
16. M.F. Kaashoek and D. Karger, "Koorde: A Simple Degree-optimal Distributed Hash Table, " IPTPS, 2003.
17. F.T. Leighton, B.M. Maggs, and R.K. Sitamaran, "On the Fault Tolerance of Some Popular Bounded-Degree Networks," IEEE FOCS, 1995.
18. W.E. Leland, M.S. Taqqu, W. Willinger, and D.V. Wilson, "On the Self-Similar Nature of Ethernet Traffic," ACM SIGCOMM, 1993.
19. R.B. Lenin and P.R. Parthasarathy, "Transient Analysis in Discrete Time of Markovian Queues with Quadratic Rates," Southwest J. Pure and Appl. Math., July 2000.
20. D. Leonard, V. Rai, and D. Loguinov, "On Lifetime-Based Node Failure and Resilience of Decentralized Peer-to-Peer Networks (extended version)," Texas A&M Technical Report, April 2005.
21. S. Liu, K-H. Cheng, and X. Liu, "Network Reliability with Node Failures," Networks, vol. 35, no. 2, March 2000.
22. D. Liben-Nowell, H. Balakrishnan, and D. Karger, "Analysis of the Evolution of Peer-to-Peer Systems," ACM PODC, 2002.
23. D. Loguinov, A. Kumar, V. Rai, and S. Ganesh, "Graph-Theoretic Analysis of Peer-to-Peer Systems: Routing Distances and Fault Resilience," ACM SIGCOMM, 2003.
24. G.S. Manku, M. Naor, and U. Weider, "Know thy Neighbor's Neighbor: The Power of Lookahead in Randomized P2P Networks," ACM STOC, June 2004.
25. L. Massoulié, A.-M. Kermarrec, and A. Ganesh, "Network Awareness and Failure Resilience in Self-Organising Overlay Networks," IEEE Symposium on Reliable and Distributed Systems, 2003.
26. G. Pandurangan, P. Raghavan, E. Upfal, "Building Low-Diameter Peer-to-Peer Networks, " IEEE JSAC, vol. 21, no. 6, August 2003.
27. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," ACM SIGCOMM, 2001.
28. S. Resnick. Adventures in Stochastic Processes. Birkhäuser, Boston, 2002.
29. A. Rowstron and P. Druschel, "Pastry: Scalable, Decentralized, Object Location and Routing for Large-Scale Peer-to-Peer Systems," IFIP/ACM Middleware, 2001.
30. J. Saia, A. Fiat, S. Gribble, A.R. Karlin, and S. Saroiu, "Dynamically Fault-Tolerant Content Addressable Networks," IPTPS, 2002.
31. S. Saroiu, P.K. Gummadi, and S.D. Gribble, "A Measurement Study of Peer-to-Peer File Sharing Systems," MMCN, 2002.
32. K. Sripanidkulchai, B. Maggs, H. Zhang, "Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems," IEEE INFOCOM, March 2003.
33. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer lookup Service for Internet Applications," ACM SIGCOMM, 2001.
34. A. Shwartz and A. Weiss. Large Deviations for Performance Analysis. Chapman and Hall, 1995.
35. W. Willinger, M.S. Taqqu, R. Sherman, and D.V. Wilson, "Self-Similarity Through High-Variability: Statistical Analysis of Ethernet LAN Traffic at the Source Level," ACM SIGCOMM, 1995.
36. R.W. Wolff. Stochastic Modeling and the Theory of Queues. Prentice Hall, 1989.