Research on churn problem in P2P networks

Ruan Jian Xue Bao/Journal of Software

Volumn 20, Issue 5, 2009, Pages 1362-1376

  Zhang, Yu Xiang ^a,b   Yang, Dong ^a   Zhang, Hong Ke ^a  

^a BEIJING JIAOTONG UNIVERSITY   (China)

^b CIVIL AVIATION UNIVERSITY OF CHINA   (China)

Author keywords

Churn; Measurement of Churn; P2P network; Performance evaluation of P2P under Churn; Strategy to handle Churn

Indexed keywords

CHURN; EXISTING PROBLEMS; GENERATION MECHANISM; P2P NETWORK; PERFORMANCE EVALUATION OF P2P UNDER CHURN; PRECISE MEASUREMENTS; STRATEGY TO HANDLE CHURN;

CLIENT SERVER COMPUTER SYSTEMS;

EID: 65749105587     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: 10.3724/SP.J.1001.2009.03485     Document Type: Article

References (72)

1. Stoica I, Morris R, Liben-Nowell D, Karger DR, Kaashoek MF, Dabek F, Balakrishnan H. Chord: A scalable peer-to-peer lookup service for Internet applications. IEEE/ACM Trans. on Networking, 2003, 11(1): 17-32.
2. Zhao BY, Huang L, Stribling J, Rhea SC, Joseph AD. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 41-53.
3. Godfrey BP, Shenker S, Stoica I. Minimizing churn in distributed systems. In: Proc. of the ACM SIGCOMM 2006. New York: ACM Press, 2006. 147-158.
4. Milojicic DS, Kalogeraki V, Lukose R, Nagaraja K, Pruyne J, Richard B, Rollins S, Xu ZC. Peer-to-Peer computing. Technical Report, HPL-2002-57, Palo Alto: HP Labs, 2002.
5. Andy O. Peer-to-Peer: Harnessing the Power of Disruptive Technologies. Cambridge: O'Reilly and Associates, Inc., 2001. 3-159.
6. Wang CG, Li B. Peer-to-Peer overlay networks: A survey. Technical Report, Hong Kong: Hong Kong University of Science and Technology, 2003.
7. Lua EK, Crowcroft J, Pias M, Sharma R, Lim S. A survey and comparison of peer-to-peer overlay network schemes. Journal of IEEE Communications Survey and Tutorial, 2005, 7(2): 72-93.
8. Ratnasamy S, Francis P, Handley M, Karp R, Shenker S. A scalable content-addressable network. In: Govindan R, ed. Proc. of the ACM SIGCOMM. New York: ACM Press, 2001. 161-172.
9. Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proc. of the 18th IFIP/ACM Int'l Conf. on Distributed Systems Platforms (Middleware 2001). Berlin: Springer-Verlag, 2001. 329-350.
10. Wu D, Tian Y, Ng KW, Datta A. Stochastic analysis of the interplay between object maintenance and churn. Computer Communications, 2008, 31(2): 220-239.
11. Herrera O, Znati T. Modeling churn in P2P networks. In: Proc. of the 40th Annual Simulation Symp. Washington: IEEE Press, 2007. 33-40.
12. Stutzbach D, Rejaie R. Understanding churn in peer-to-peer networks. In: Proc. of the 6th ACM SIGCOMM on IMC. New York: ACM Press, 2006. 189-202.
13. Yao Z, Leonard D, Wang X, Loguinov D. Modeling heterogeneous user churn and local resilience of unstructured P2P networks. In: Proc. of the IEEE Int'l Conf. on Network Protocols (ICNP 2006). Washington: IEEE Press, 2006. 32-41.
14. Li CX, Chen CJ. On Gnutella topology dynamics by studying leaf and ultra connection jointly in phase space. Computer Networks, 2008, 52(3): 695-719.
15. Liu Z, Yuan R, Li Z, Li H, Chen G. Survive under high churn in structured P2P systems: Evaluation and strategy. In: Proc. of the ICCS 2006. Berlin: Springer-Verlag, 2006. 28-31.
16. Gummadi K, Gummadi R, Gribble S, Ratnasamy S, Shenker S, Stoica I. The impact of DHT routing geometry on resilience and proximity. In: Proc. of the ACM SIGCOMM 2003. New York: ACM Press, 2003. 381-394.
17. Kunzmann G, Binzenhöfer A, Henjes R. Analyzing and modifying chords stabilization algorithm to handle high churn rates. In: Proc. of the MICC and ICON 2005. Piscataway: IEEE Press, 2005. 885-890.
18. Leonard D, Yao Z, Rai V, Loguinov D. On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks. IEEE/ACM Trans. on Networking, 2007, 15(3): 644-656.
19. Chu J, Labonte K, Levine B. Availability and locality measurements of peer-to-peer file systems. In: Firoiu V, Zhang ZL, eds. Proc. of the Scalability and Traffic Control in IP Networks II. SPIE 4868, Boston: SPIE, 2002. 310-321.
20. Saroiu S, Gummadi PK, Gribble SD. Measuring and analyzing the characteristics of Napster and Gnutella hosts. Multimedia Systems Journal, 2003, 8(5): 170-184.
21. Rhea S, Geels D, Roscoe T, Kubiatowicz J. Handling churn in a DHT. In: Proc. of the USENIX Annual Technical Conf. Boston: USENIX Association Press, 2004. 127-140.
22. Gnutella. 2005. http://rfc-gnutella.sourceforge.net/.
23. Liu Q, Xu P, Yang H, Peng Y. Research on measurement of peer-to-peer file sharing system. Journal of Software, 2006, 17(10): 2131-2140 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/17/2131.htm
24. Sen S, Wang J. Analyzing peer-to-peer traffic across large networks. IEEE/ACM Trans. on Networking, 2004, 12(2): 219-232.
25. KaZaA. 2003. http://www.kazaa.com
26. Direct connect. 2001. http://www.neo-modus.com
27. Gummadi KP, Dunn RJ, Saroiu S, Gribble SD, Levy HM, Zahorjan J. Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In: Proc. of the 19th ACM Symp. on Operating Systems Principles (SOSP 2003). New York: ACM Press, 2003. 314-329.
28. Karagiannis T, Broido A, Brownlee N, Claffy KC, Faloutsos M. Is P2P dying or just hiding. In: Proc. of the IEEE Globecom 2004. Washington: IEEE Press, 2004. 1532-1538.
29. Napster. 2001. http://www.napster.com
30. Bustamante F, Qiao Y. Friendships that last: Peer lifespan and its role in P2P protocols. In: Proc. of the 8th Int'l Workshop on Web Content Caching and Distribution (WCW 2003). Norwell: Kluwer Academic, 2003. 233-246.
31. Liang J, Kumar R, Ross KW. The KaZaA overlay: A measurement study. Computer Networks, 2006, 50(6): 842-858
32. Stutzbach D, Rejaie R. Characterizing churn in peer-to-peer networks. Technical Report, CIS-TR-2005-03, University of Oregon, 2005.
33. Maymounkov P, Mazieres D. Kademlia: A peer-to-peer information system based on the XOR metric. In: Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems (IPTPS 2002). Berlin: Springer-Verlag, 2002. 53-65.
34. Liben-Nowell D, Balakrishnan H, Karger D. Analysis of the evolution of peer-to-peer systems. In: Proc. of the 21st Annual ACM Symp. on Principles of Distributed Computing (PODC 2002). New York: ACM Press, 2002. 233-242.
35. Wang S, Xuan D, Zhao W. Analyzing and enhancing the resilience of structured peer-to-peer systems. Journal of Parallel and Distributed Computing. 2005, 65(2): 207-219.
36. Krishnamurthy S, El-Ansary S, Aurell E, Haridi S. An analytical study of a structured overlay in the presence of dynamic membership. IEEE/ACM Trans. on Networking, 2008, 16(4): 814-825.
37. Mickens JW, Noble BD. Predicting node availability in peer-to-peer networks. In: Proc. of the ACM SIGMETRICS Int'l Conf. on Measurement and Modeling of Computer Systems. New York: ACM Press, 2005. 378-379.
38. Yao Z, Wang X, Leonard D, Loguinov D. On node isolation under churn in unstructured P2P networks with heavy-tailed lifetimes. In: Proc. of the IEEE INFOCOM 2007. Piscataway: IEEE Press, 2007. 2126-2134.
39. Bustamante F, Qiao Y. Designing less-structured P2P systems for the expected high churn. IEEE/ACM Trans. on Networking, 2008, 16(3): 617-627.
40. Li J, Stribling J, Morris R, Kaashoek F. Bandwidth-Efficient management of DHT routing tables. In: Proc. of the 2nd Conf. on Symp. on Networked Systems Design and Implementation (NSDI 2005). Berkeley: USENI Press, 2005. 99-114.
41. Zhong M, Shen K, Seiferas J. Non-Uniform random membership management in peer-to-peer networks. In: Proc. of the IEEE INFOCOM. Piscataway: IEEE Press, 2005. 1151-1161.
42. Lam S, Liu H. Failure recovery for structured P2P networks: Protocol design and performance under churn. Computer Networks, 2006, 50(16): 3083-3104.
43. Kumar P, Sridhar G, Sridhar V. Bandwidth and latency model for DHT based peer-to-peer networks under variable churn. In: Proc. of the IEEE Systems Communications (ICW 2005). Piscataway: IEEE Press, 2005. 320-325.
44. Stutzbach D, Rejaie R, Sen S. Characterizing unstructured overlay topologies in modern P2P file-sharing systems. IEEE/ACM Trans. on Networking, 2008, 16(2): 267-280.
45. Pandurangan G, Raghavan P, Upfal E. Building low-diameter peer-to-peer network. IEEE Journal on Selected Areas in Communications (JSAC), 2003, 21(6): 995-1002.
46. Leonard D, Yao Z, Wang X, Loguinov D. On static and dynamic partitioning behavior of large-scale networks. In: Proc. of the 13th IEEE Int'l Conf. on Network Protocols (ICNP 2005). Piscataway: IEEE Press, 2005. 345-357.
47. Feldmann A, Whitt W. Fitting mixtures of exponentials to long-tailed distributions to analyze network performance models. Performance Evaluation, 1998, 31(3-4): 245-279.
48. Loguinov D, Casas J, Wang X. Graph-Theoretic analysis of structured peer-to-peer systems: Routing distances and fault resilience. IEEE/ACM Trans. on Networking, 2005, 13(5): 1107-1120.
49. Leighton FT. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. New York: Academic/Morgan Kaufmann Publishers, 1991.
50. Xu J, Kumar A, Yu XX. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. IEEE Journal on Selected Areas on Communications (JSAC), 2004, 22(1): 151-163.
51. King Data Set. 2006. http://pdos.csail.mit.edu/p2psim/kingdata/
52. Li J, Stribling J, Morris R, Kaashoek F, Gil T. A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In: Proc. of the 24th IEEE INFOCOM 2005. Piscataway: IEEE Press, 2005. 225-236.
53. Castro M, Costa M, Rowstron A. Performance and dependability of structured peer-to-peer overlays. In: Proc. of the Dependable Systems and Networks (DSN 2004). Los Alamitos: IEEE Press, 2004. 9-18.
54. Gil TM, Kaashoek F, Li J, Morris R, Stribling J. P2Psim: A simulator for peer-to-peer protocols. 2006. http://pdos.csail.mit.edu/p2psim/
55. Naicken S, Basu A, Livingston B, Rodhetbhai S. A survey of peer-to-peer network simulators. In: Proc. of the 7th Annual Postgraduate Symp. Liverpool: Liverpool John Moores University, 2006. 1-8.
56. Herrera O, Znati T. Static resiliency vs. churn-resistance capability of DHT-protocols. In: Proc. of the 18th Int'l Conf. on Parallel and Distributed Computing Systems (PDCS 2005). Phoenix: IASTED/ACTA Press, 2005. 141-147.
57. Li J, Stribling J, Gil T, Morris R, Kaashoek MF. Comparing the performance of distributed hash tables under churn. In: Proc. of the 3rd Int'l Workshop on Peer-to-Peer Systems (IPTPS 2004). Berlin: Springer-Verlag, 2004. 87-99.
58. Kersch P, Szabo R, Cheng L, Jean K, Galis A. Stochastic maintenance of overlays in structured P2P systems. Computer Communications, 2008, 31(3): 603-619.
59. Dabek F, Kaashoek M, Karger D, Morris R, Stoica I. Wide-Area cooperative storage with CFS. In: Proc. of the 18th ACM Symp. on Operating Systems Principles. New York: ACM Press, 2001. 202-215.
60. Wells C. The oceanstore archive: Goals, structures, and self-repair[MS. Thesis]. Berkeley: UC Berkeley, 2002.
61. Knezevic P, Wombacher A, Risse T. Managing and recovering high data availability in a DHT under churn. In: Proc. of the 2nd Int'l Conf. on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2006). Piscataway: IEEE Press, 2006. 45-55.
62. Rizzo L. Effective erasure codes for reliable computer communication protocols. Computer Communication Review, 1997, 27(2): 24-36.
63. Bhagwan R, Tati K, Cheng Y, Savage S, Voelker G. Total recall: System support for automated availability management. In: Proc. of the 1st ACM/Usenix Symp. on Networked Systems Design and Implementation (NSDI 2004). San Francisco: USENI Press, 2004. 337-350.
64. Datta A, Aberer K. Internet-Scale storage systems under churn-A study of the steady-state using Markov models. In: Proc. of the 6th IEEE Int'l Conf. on Peer-to-Peer Computing (P2P 2006). Piscataway: IEEE Press, 2006. 133-144.
65. Tian J, Dai YF. Study on durable peer-to-peer storage techniques. Journal of Software, 2007, 18(6): 1379-1399 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/18/1379.htm
66. Cohen E, Shenker S. Replication strategies in unstructured peer-to-peer networks. In: Proc. of the ACM SIGCOMM. New York: ACM Press, 2002. 177-190.
67. Ledlie J, Shneidman J, Amis M, Mitzenmacher M, Seltzer M. Reliability- and capacity-based selection in distributed hash tables. Technical Report, Harvard University Computer Science, 2003. 1-14.
68. Garces-Erice L, Biersack EW, Ross KW, Felber PA, Urvoy-Keller G. Hierarchical Peer-to-Peer systems. In: Proc. of the ACM/IFIP Int'l Conf. on Parallel and Distributed Computing (Euro-Par). Berlin: Springer-Verlag, 2003. 1230-1239.
69. Sripanidkulchai K, Ganjam A, Maggs B, Zhang H. The feasibility of supporting large-scale live streaming applications with dynamic application end-points. In: Proc. of the ACM SIGCOMM. New York: ACM Press, 2004. 107-120.
70. Dabek F, Li J, Sit E, Robertson J, Kaashoek MF, Morris R. Designing a DHT for low latency and high throughput. In: Proc. of the 1st USENIX Symp. on Networked Systems Design and Implementation (NSDI 2004). San Francisco: USENI Press, 2004. 85-98.
71. Wu D, Tian Y, Ng KW. Analytical study on improving DHT lookup performance under churn. In: Proc. of the 6th IEEE Int'l Conf. on Peer-to-Peer Computing (P2P 2006). Piscataway: IEEE Press, 2006. 249-258.
72. Stutzbach D, Rejaie R. Improving lookup performance over a widely-deployed DHT. In: Proc. of the IEEE INFOCOM. Washington: IEEE Press, 2006. 1-12.