Node isolation model and age-based neighbor selection in unstructured P2P networks

IEEE/ACM Transactions on Networking

Volumn 17, Issue 1, 2009, Pages 144-157

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

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Age based selection; Heavy tailed lifetimes; Node isolation; Peer to peer networks; User churn

Indexed keywords

TELECOMMUNICATION NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

AGE-BASED SELECTION; HEAVY-TAILED LIFETIMES; NODE ISOLATION; PEER-TO-PEER NETWORKS; USER CHURN;

DISTRIBUTED COMPUTER SYSTEMS;

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

References (47)

1. F. E. Bustamante and Y. Qiao, "Friendships that last: Peer lifespan and its role in P2P protocols," in Proc. Int.Workshop Web Content Caching Distribution, Sep. 2003, pp. 233-246.
2. M. Castro, M. Costa, and A. Rowstron, "Performance and dependability of structured peer-to-peer overlays," in Proc. DSN, Jun. 2004, pp. 9-18.
3. 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.
4. 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.
5. E. B. Dynkin, "Some limit theorems for sums of independent random variables with infinite mathematical expectations," Sel. Transl. Math. Statist. Probabil., vol. 1, pp. 171-189, 1961.
6. H. Exton, Handbook of Hypergeometric Integrals: Theory, Applications, Tables, Computer Programs. Chichester, U.K.: Ellis Horwood, 1978.
7. A. Feldmann and W. Whitt, "Fitting mixtures of exponentials to long-tailed distributions to analyze network performance models," Perform. Eval., vol. 31, no. 3-4, pp. 245-279, Jan. 1998.
8. W. Feller, An Introduction to Probability Theory and Its Applications, Volume 2. New York: Wiley, 1966.
9. C. Gkantsidis, M. Mihail, and A. Saberi, "Random walks in peer-to-peer networks," in Proc. IEEE INFOCOM, Mar. 2004, pp. 120-130.
10. P. B. Godfrey, S. Shenker, and I. Stoica, "Minimizing churn in distributed systems," in Proc. ACM SIGCOMM, Sep. 2006, pp. 147-158.
11. 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.
12. T. Hettmansperger and M. Keenan, "Tailweight, statistical inference, and families of distributions - A brief survey," in Statist. Distrib. Scientif. Work, G. P. Patil, S. Kotz, and J. K. Ord, Eds. : Kluwer, 1980, vol. 1, pp. 161-172.
13. M. F. Kaashoek and D. Karger, "Koorde: A simple degree-optimal distributed hash table," in Proc. IPTPS, Feb. 2003, pp. 98-107.
14. M. Kijima, Markov Processes for Stochastic Modeling. London, U.K.: Chapman & Hall, 1997.
15. 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.
16. 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.
17. J. Ledlie, J. Shneidman, M. Amis, and M. Seltzer, Reliability- and Capacity-Based Selection in Distributed Hash Tables Harvard Univ., Dept. Comput. Sci., Sep. 2003, Tech. Rep..
18. 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.
19. 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.
20. 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.
21. J. Li, J. Stribling, R. Morris, and M. F. Kaashoek, "Bandwidth-efficient management of DHT routing tables," in Proc. USENIX NSDI, May 2005, pp. 1-11.
22. 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.
23. L. Lovász, "Random Walks on graphs: A survey," in Combinatorics, Paul Erdös is Eighty, D. Miklós, V. T. Sós, and T. Szonyi, Eds. Budapest, Hungary: János Bolyai Math. Soc., 1996, vol. 2, pp. 353-398.
24. 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.
25. P. Maymounkov and D. Mazieres, "Kademlia: A peer-to-peer information system based on the XOR metric," in Proc. IPTPS, Mar. 2002, pp. 53-65.
26. C. D. Meyer, Matrix Analysis and Applied Linear Algebra. Philadelphia, PA: SIAM, 2000.
27. 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.
28. C. G. Plaxton, R. Rajaraman, and A. W. Richa, "Accessing nearby copies of replicated objects in a fistributed rnvironment," in Proc. ACM SPAA, 1997, pp. 311-320.
29. 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.
30. 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.
31. S. Resnick, Adventures in Stochastic Processes. : Birkhäuser, 2002.
32. 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.
33. A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems," in Proc. IFIP/ACM Int. Conf. Distrib. Syst. Platforms (Middleware), Nov. 2001, pp. 329-350.
34. 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.
35. 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.
36. M. Srivatsa, B. Gedik, and L. Liu, "Large scaling unstructured peer-to-peer networks with heterogeneity-aware topology and routing," IEEE Trans. Parallel Distrib. Syst., vol. 17, no. 11, pp. 1277-1293, Nov. 2006.
37. 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.
38. 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.
39. V. Venkataraman, P. Francisy, and J. Calandrino, "Chunkyspread: Multitree unstructured peer-to-peer multicast," in Proc. IPTPS, Feb. 2006.
40. V. Vishnumurthy and P. Francis, "On Heterogeneous overlay construction and random node selection in unstructured P2P networks," in Proc. IEEE INFOCOM, Apr. 2006.
41. X. Wang, Z. Yao, and D. Loguinov, "Residual-based measurement of peer and link lifetimes in Gnutella networks," in Proc. IEEE INFOCOM, May 2007, pp. 391-399.
42. R. W. Wolff, Stochastic Modeling and the Theory of Queues. Englewood Cliffs, NJ: Prentice-Hall, 1989.
43. Z. Yao, D. Leonard, X. Wang, and D. Loguinov, "Modeling heterogeneous user churn and local resilience of unstructured P2P networks," in Proc. IEEE ICNP, Nov. 2006, pp. 32-41.
44. 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.
45. 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.
46. 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.
47. 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.