On node isolation under churn in unstructured P2P networks with heavy-tailed lifetimes

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 2126-2134

  Yao, Zhongmei ^a   Wang, Xiaoming ^a   Leonard, Derek ^a   Loguinov, Dmitri ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; GRAPH THEORY; MATHEMATICAL MODELS; PROBABILITY; USER INTERFACES;

AGE WEIGHTED GRAPHS; FINITE SIZE GRAPHS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 34548312410     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.246     Document Type: Conference Paper

References (32)

1. F. E. Bustamante and Y. Qiao, "Friendships that Last: Peer Lifespan and its Role in P2P Protocols," in Proc. Intl. Workshop on Web Content Caching and Distribution, Sep. 2003.
2. 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.
3. B.-G. Chun, B. Zhao, and J. Kubiatowicz, "Impact of Neighbor Selection on Performance and Resilience of Structured P2P Networks," in Proc. IPTPS, Feb. 2005, pp. 264-274.
4. H. Exton, Handbook of Hypergeometric Integrals: Theory, Applications, Tables, Computer Programs. Ellis Horwood, Chichester, England, 1978.
5. A. Feldmann and W. Whitt, "Fitting Mixtures of Exponentials to Long-tailed Distributions to Analyze Network Performance Models," Performance Evaluation, vol. 31, no. 3-4, pp. 245-279, Jan. 1998.
6. C. Gkantsidis, M. Mihail, and A. Saberi, "Random Walks in Peer-to-Peer Networks," in Proc. IEEE INFOCOM, Mar. 2004, pp. 120-130.
7. 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.
8. T. Hettmansperger and M. Keenan, "Tailweight, Statistical Inference, and Families of Distributions - A Brief Survey," Statist. Distributions in Scientific Work, G. P. Patil et al. (eds), vol. 1, pp. 161-172, 1980.
9. S. Krishnamurthy, S. El-Ansary, E. Aurell, and S. Haridi, "A Statistical Theory of Chord under Chum," in Proc. IPTPS, Feb. 2005, pp. 93-103.
10. S. S. Lam and H. Liu, "Failure Recovery for Structured P2P Networks: Protocol Design and Performance Evaluation," in Proc. ACM SIGMETRICS, Jun. 2004, pp. 199-210.
11. J. Ledlie, J. Shneidman, M. Amis, and M. Seltzer, "Reliability- and Capacity-Based Selection in Distributed Hash Tables," Harvard University Computer Science, Tech. Rep., Sep. 2003.
12. 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.
13. D. Leonard, Z. Yao, X. Wang, and D. Loguinov, "On Static and Dynamic Partitioning Behavior of Large-Scale Networks," in Proc. IEEE ICNP, Nov. 2005, pp. 345-357.
14. J. Li, J. Stribling, T. M. Gil, R. Morris, and M. F. Kaashoek, "Comparing the Performance of Distributed Hash Tables under Churn," in Proc. IPTPS, Feb. 2004, pp. 87-99.
15. D. Liben-Nowell, H. Balakrishnan, and D. Karger, "Analysis of the Evolution of the Peer-to-Peer Systems," in Proc. ACM PODC, Jul. 2002, pp. 233-242.
16. L. Lovász, "Random Walks on Graphs: A Survey," Combinatorics, Paul Erdõs is Eighty, D. Miklds et al. (eds), vol. 2, pp. 353-398, 1996.
17. L. Massoulié, A.-M. Kermarrec, and A. Ganesh, "Network Awareness and Failure Resilience in Self-Organising Overlay Networks," in Proc. IEEE SRDS, Oct. 2003, pp. 47-55.
18. 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.
19. 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.
20. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, "Topologically- Aware Overlay Construction and Server Selection," in Proc. IEEE INFOCOM, Jun. 2002, pp. 1190-1199.
21. S. Resnick, Adventures in Stochastic Processes. Birkhäuser, 2002.
22. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, "Handling Churn in a DHT," in Proc. USENIX Ann. Tech. Conf., Jun. 2004, pp. 127-140.
23. A. Rowstron and P. Druschel, "Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems," in Proc. IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Nov. 2001, pp. 329-350.
24. D. Rubenstein and S. Sahu, "Can Unstructured P2P Protocols Survive Flash Crowds," IEEE/ACM Trans. Netw., vol. 13, no. 3, pp. 501-512, Apr. 2005.
25. K. Sripanidkulchai, A. Ganjam, B. Maggs, and H. Zhang, "The Feasibility of Supporting Large-Scale Live Streaming Applications with Dynamic Application End-Points," in Proc. ACM SIGCOMM, Aug. 2004, pp. 107-120.
26. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," in Proc. ACM SIGCOMM, Aug. 2001, pp. 149-160.
27. M. S. Taqqu, W. Willinger, and R. Sherman, "Proof of a Fundamental Result in Self-Similar Traffic Modeling," ACM Comput. Commun. Rev., vol. 27, no. 2, pp. 5-23, Apr. 1997.
28. R. W. Wolff, Stochastic Modeling and the Theory of Queues. Prentice Hall, 1989.
29. H. Zhang, A. Goal, and R. Govindan, "Incrementally Improving Lookup Latency in Distributed Hash Table Systems," in Proc. ACM SIGMETRICS, Jun. 2003, pp. 114-125.
30. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. Kubiatowicz, "Tapestry: A Resilient Global-Scale Overlay for Service Deployment," IEEE J. Sel. Areas Commun., vol. 22, no. 1, pp. 41-53, Jan. 2004.
31. M. Zhong, K. Shen, and J. Seiferas, "Non-Uniform Random Membership Management in Peer-to-Peer Networks," in Proc. IEEE INFOCOM, Mar. 2005, pp. 1151-1161.
32. D. Zhou, J. Huang, and B. Schölkopf, "Learning from Labeled and Unlabeled Data on a Directed Graph," in Proc. ICML 2005, Aug. 2005, pp. 1036-1043.