Multi-factors oriented study of P2P Churn

International Journal of Communication Systems

Volumn 22, Issue 9, 2009, Pages 1089-1103

  Yang, Dong ^a   Zhang, Yu Xian ^a   Zhang, Hong Ke ^a   Wu, Tin Yu ^b   Chao, Han Chieh ^c,d  

^a BEIJING JIAOTONG UNIVERSITY   (China)

^b TAMKANG UNIVERSITY   (Taiwan)

^c NATIONAL ILAN UNIVERSITY   (Taiwan)

^d NATIONAL DONG HWA UNIVERSITY   (Taiwan)

Author keywords

Chord; Churn; Multi factors; P2P

Indexed keywords

ANALYTICAL MODEL; CAUSAL RELATIONSHIPS; CHORD; CHURN; INFLUENCE FACTORS; INPUT DATAS; MULTI-FACTORS; P2P; P2P NETWORK; P2P PROTOCOLS; PEER-TO-PEER SYSTEM; PERFORMANCE EVALUATION;

EID: 69449094322     PISSN: 10745351     EISSN: 10991131     Source Type: Journal    
DOI: 10.1002/dac.1001     Document Type: Article

References (24)

1. Li J, Stribling J, Kaashoek F, Morris R, Gil T. A performance vs cost framework for evaluating DHT design Tradeoffs under Churn. INFOCOM, Miami, FL, U.S.A., 2005.
2. Rhea S, Geels D, Roscoe T. Handling Churn in a DHT. Proceedings of the 2004 USENIX Technical Conference, Boston, MA, U.S.A., 2004; 127-140.
3. Kumar P, Sridhar G, Sridhar V. Bandwidth and latency model for DHT based peer-to-peer networks under variable. Systems Communications Proceedings, Montreal, Canada, 14-17 August 2005; 320-325.
4. Godfrey PB, Shenker S, Stoica I. Minimizing Churn in distributed systems. Proceedings of ACM SIGCOMM '06, Pisa, Italy, 2006.
5. Stutzbach D, Rejaie R. Understanding churn in peer-to-peer networks. Internet Measurement Conference, Rio de Janeiro, Brazil, 2006.
6. Qiao Y, Bustamante FE. Elders know best-handling Churn in less structured P2P systems. Proceedings of the IEEE International Conference on Peer-to-Peer Computing (P2P), Konstanz, Germany, September 2005.
7. Kuhn F, Schmid S, Smit J, Wattenhofer R. A Blueprint for constructing peer-to-peer systems robust to dynamic worst-case joins and leaves. 14th IEEE International Workshop on Quality of Service, 2006. IWQoS 2006, New Haven, CT, U.S.A., June 2006; 12-19.
8. Krishnamurthy S, El-Ansary S, Aurell E, Haridi S. A statistical theory of chord under churn. International Workshop on Peer-to-Peer Systems (IPTPS), Ithaca, NY, February 2005.
9. Kunzmann G, Binzen A, Henjes R. Analyzing and modifying chord's stabilization algorithm to handle high churn rates. The 6th Malaysia International Conference on Communications (MICC) in Conjunction with International Conference on Networks (ICON), Kuala Lumpur, Malaysia, 2005.
10. Lynch N, Stoica I. MultiChord: a resilient namespace management algorithm. Technical Memo MIT-LCS-TR-936, 2004.
11. Hsiao H, Kin C. Mobility Churn in DHT. Proceedings of the 25th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'05), Taiwan, 2005; 799-805.
12. Lynch N, Malkhi D, Ratajczak D. Atomic data access in distributed hash tables. Proceedings of International Peer-to-Peer Symposium, Linkoping, Sweden, 7-8 March 2002.
13. Hildrum K, Kubiatowicz J, Rao S, Zhao B. Distributed object location in a dynamic network. Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, Winnipeg, MB, Canada, 2002; 41-52.
14. Risson J, Robinson K, Moors T. Fault tolerant active rings for structured peer-to-peer overlays. Proceedings of the 30th Annual IEEE Conference on Local Computer Networks, Sydney, Australia, 15-17 November 2005; 18-25.
15. Loguinov D, Kumar A, Ganesh S. Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. Proceedings of 2003 Conference on Applications, Technologies, Architectures and Protocols for Computer Communications, Karlsruhe, Germany, 25-29 August 2003; 395-406.
16. Zhuang S, Geels D, Stoica I, Katz R. On failure detection algorithms in overlay networks. Proceedings of IEEE Infocomm, Miami, FL, U.S.A., 13-17 March 2005.
17. Gummadi K, Gummadi R, Gribble S, Ratnasamy S, Shenker S, Stoica I. The impact of DHT routing geometry on resilience and proximity. Proceedings of 2003 Conference on Applications, Technologies, Architectures and Protocols for Computer Communications, Karlsruhe, Germany, 2003; 381-394.
18. p2psim[EB/OL] Available at: http://pdos.lcs.mit.edu/p2psim.
19. Stoica I, Morris R, Karger D. Chord: a scalable peer-to-peer lookup service for Internet applications. ACM SIG-COMM Conference, San Diego, CA, U.S.A., vol.4(31), 2001; 149-160. (Pubitemid 32981961)
20. Zhao B, Huang L, Stribling J. Tapestry: a resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications 2004; 22(1):41-53.
21. Kubiatowicz J. Oceanstore: an architecture for global-scale persistent storage. Proceedings of ASPLOS, Cambridge, MA, 12-15 November 2000; 190-201.
22. Gupta I, Birman K, Linga P. Kelips: building an efficient and stable P2P DHT through increased memory and background overhead. Second International Workshop on Peer-to-Peer Systems (IP1TPS), Berkeley, CA, U.S.A., 2003.
23. Kingdata[EB/OL] Available at: http://pdos.csail.mit.edu/p2psim/kingdata/.
24. Gummadi K, Saroiu S, Gribble S. King: estimating latency between arbitrary Internet end hosts. Proceedings of the 2002 SIGCOMM Internet Measurement Workshop, Marseille, France, 2002; 5-18.