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

IEEE/ACM Transactions on Networking

Volumn 15, Issue 3, 2007, Pages 644-656

  Leonard, Derek ^a   Yao, Zhongmei ^a   Rai, Vivek ^b   Loguinov, Dmitri ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Lifetime node failure; Network disconnection; Peer to peer networks; Stochastic resilience; User isolation

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; COMPUTER NETWORKS; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS;

LIFETIME NODE FAILURE; NETWORK DISCONNECTION; USER ISOLATION;

NETWORK PROTOCOLS;

EID: 34250797392     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2007.893199     Document Type: Article

References (40)

1. M. Abadi and A. Galves, "Inequalities for the occurrence times of rare events in mixing processes. The state of the art," Markov Proc. Relat. Fields, vol. 7, no. 1, pp. 97-112, 2001.
2. D. Aldous and M. Brown, "Inequalities for rare events in time-reversible Markov chains II," Stochastic Processes and Their Applications, vol. 44, no. 1, pp. 15-25, Jan. 1993.
3. J. Aspnes, Z. Diamadi, and G. Shah, "Fault tolerant routing in peer to peer systems," in Proc. ACM PODC, Jul. 2002, pp. 223-232.
4. P. Atkins, Physical Chemistry. New York: Freeman, 1986.
5. R. Bhagwan, S. Savage, and G. Voelker, "Understanding availability," in Proc. IPTPS, Feb. 2003, pp. 256-267.
6. B. Bollobás, Random Graphs. Cambridge, U.K.: Cambridge Univ. Press, 2001.
7. Y. Burtin, "Connection probability of a random subgraph of an n-dimensional cube," Probl. Pered. Inf., vol. 13, no. 2, pp. 147-152, Apr. -Jun. 1977.
8. F. Bustamante and Y. Qiao, "Friendships that last: Peer lifespan and its role in P2P protocols," in Proc. IEEE WCW, Sep. 2003, pp. 233-246.
9. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, "Making Gnutella like P2P systems scalable," in Proc. ACM SIGCOMM Aug. 2003, pp. 407-418.
10. R. Cohen, K. Erez, D. Ben Avraham, and S. Havlin, "Resilience of the internet to random breakdowns," Phys. Rev. Lett., vol. 85, no. 21, pp. 4626-4628, Nov. 2000.
11. H. Exton, Handbook of Hypergeometric Integrals: Theory, Applications, Tables, Computer Programs. Chichester, U.K.: Ellis Horwood, 1978.
12. A. Fiat and J. Saia, "Censorship resistant peer-to-peer content addressable networks," in Proc. ACM-SIAM SODA, Jan. 2002, pp. 94-103.
13. A. Ganesh and L. Massoulie, "Failure resilience in balanced overlay networks," in Allerton Conf. Communication, Control and Computing Oct. 2003.
14. C. Gkantsidis, M. Mihail, and A. Saberi, "Random walks in peer-to-peer networks," in Proc. IEEE INFOCOM, Mar. 2004, pp. 119-130.
15. P. Golle, K. Leyton-Brown, I. Mironov, and M. Lillibridge, "Incentives for sharing in peer-to-peer networks," in Proc. ACM Conf. Electronic Commerce, Oct. 2001, pp. 264-267.
16. K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica, "The impact of DHT routing geometry on resilience and proximity," in Proc. ACM SIGCOMM, Aug. 2003, pp. 381-394.
17. D. Heath, S. Resnick, and G. Samorodnitsky, "Patterns of buffer overflow in a class of queues with long memory in the input stream," Ann. Appl. Probabil., vol. 7, no. 4, pp. 1021-1057, Nov. 1997.
18. M. Kaashoek and D. Karger, "Koorde: A simple degree-optimal distributed hash table," in Proc. IPTPS, Feb. 2003, pp. 98-107.
19. S. Krishnamurthy, S. El-Ansary, E. Aurell, and S. Haridi, "A statistical theory of chord under churn," in Proc. IPTPS, Feb. 2005, pp. 93-103.
20. F. Leighton, B. Maggs, and R. Sitamaran, "On the fault tolerance of some popular bounded-degree networks," in Proc. IEEE FOCS, Oct. 1995, pp. 542-552.
21. W. Leland, M. Taqqu, W. Willinger, and D. Wilson, "On the self-similar nature of ethernet traffic," in Proc. ACM SIGCOMM, Sep. 1993, pp. 183-193.
22. R. Lenin and P. Parthasarathy, "Transient analysis in discrete time of markovian queues with quadratic rates," Southwest J. Pure Appl. Math., pp. 1-15, Jul. 2000.
23. D. Leonard, V. Rai, and D. Loguinov, "On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks," in Proc. ACM SIGMETRICS, Jun. 2005, pp. 26-37.
24. D. Liben-Nowell, H. Balakrishnan, and D. Karger, "Analysis of the evolution of peer-to-peer systems," in Proc. ACM PODC, Jul. 2002, pp. 233-242.
25. S. Liu, K.-H. Cheng, and X. Liu, "Network reliability with node failures," Networks, vol. 35, no. 2, pp. 109-117, Mar. 2000.
26. D. Loguinov, A. Kumar, V. Rai, and S. Ganesh, "Graph-theoretic analysis of structured peer-to-peer systems: Routing distances and fault resilience," in Proc. ACM SIGCOMM, Aug. 2003, pp. 395-406.
27. G. Manku, M. Naor, and U. Weider, "Know thy neighbor's neighbor: The power of lookahead in randomized P2P networks," in Proc. ACM STOC Jun. 2004, pp. 54-63.
28. L. Massoulié, A.-M. Kermarrec, and A. Ganesh, "Network awareness and failure resilience in self-organising overlay networks," in Proc. IEEE Symp. Reliable Distributed Systems, Oct. 2003, pp. 47-55.
29. G. Pandurangan, P. Raghavan, and E. Upfal, "Building low-diameter peer-to-peer networks," IEEE J. Sel. Areas Commun., vol. 21, no. 6, pp. 995-1002, Aug. 2003.
30. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Proc. ACM SIGCOMM, Aug. 2001, pp. 161-172.
31. S. Resnick, Adventures in Stochastic Processes. Boston, MA: Birkhäuser, 2002.
32. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, "Handling churn in a DHT," in USENIX Annu. Technical Conf., Jun./Jul. 2004, pp. 127-140.
33. A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems," in Proc. IFIP/ACM Middleware, Nov. 2001, pp. 329-350.
34. J. Saia, A. Fiat, S. Gribble, A. Karlin, and S. Saroiu, "Dynamically fault-tolerant content addressable networks," in Proc. IPTPS, Mar. 2002, pp. 270-279.
35. S. Saroiu, P. Gummadi, and S. Gribble, "A measurement study of peer-to-peer file sharing systems," in Proc. MMCN, Jan. 2002, pp. 156-170.
36. A. Shwartz and A. Weiss, Large Deviations for Performance Analysis London, U.K.: Chapman and Hall, 1995.
37. K. Sripanidkulchai, B. Maggs, and H. Zhang, "Efficient content location using interest-based locality in peer-to-peer systems," in Proc. IEEE INFOCOM, Mar. 2003, pp. 2166-2176.
38. I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," in Proc. ACM SIGCOMM, Aug. 2001, pp. 149-160.
39. W. Willinger, M. Taqqu, R. Sherman, and D. Wilson, "Self-similarity through high-variability: Statistical analysis of ethernet LAN traffic at the source level," in Proc. ACM SIGCOMM, Aug. 1995, pp. 100-113.
40. R.Wolff, Stochastic Modeling and the Theory of Queues. Englewood Cliffs, NJ: Prentice-Hall, 1989.