Characterizing Chord, Kelips and Tapestry algorithms in P2P streaming applications over wireless network

In the last few years, there is a tendency of shifting P2P applications toward multimedia services, especially P2P streaming applications. The reason behind this is the clear advantages of flexibility, efficiency and self-scalability of P2P networks, which greatly reduce the infrastructure cost of service providers. However, supporting P2P streaming over wireless environment is a very challenging task due to the intermittent nature of wireless link and the energy-saving mechanisms of mobile devices. As a result, the P2P streaming over wireless will be largely different from wired P2P application due to the high frequency of node joining & leaving the network, namely churn rate. Since most of third generation of P2P applications implement distributed hash table algorithm (DHT), it is crucial to deeply investigate and improve DHTs in order to adapt them in the harsh wireless environments. Our study use simulation approach to characterize and compare the performance of three popular DHT algorithms Chord, Kelips and Tapestry under high churn rate. The major contribution of this paper is the identification of the most important parameters of DHTs to their performance and the comparisons between these mechanisms under extreme conditions of wireless environment. We observed several interesting behaviors of DHTs including: 1) Tapestry works better than Chord and Kelips in terms of successful lookup rate at very high churn rate less than 120s but Chord achieves the best performance among three DHTs when churn rate is more than 300s. 2) Tapestry performance is more sensitive to RTT than Kelips and Chord. 3) Both Chord and Tapestry shows high scalability under high churn (except for some extreme cases when Chord fails at very high churn rate). 4) Churn rate strongly affects to the successful lookup ratio, but shows very slight effect on medium lookup latency of all three protocols. 5) We also found Chord is inferior to the two other DHT in terms of performance optimization.

[1]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[2]  Laurent Massoulié,et al.  Push-to-Peer Video-on-Demand System: Design and Evaluation , 2007, IEEE Journal on Selected Areas in Communications.

[3]  Keith W. Ross,et al.  Inferring Network-Wide Quality in P2P Live Streaming Systems , 2007, IEEE Journal on Selected Areas in Communications.

[4]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[5]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[6]  Krishna P. Gummadi,et al.  The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.

[7]  Robert Tappan Morris,et al.  A performance vs. cost framework for evaluating DHT design tradeoffs under churn , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[8]  Robert Tappan Morris,et al.  Designing a DHT for Low Latency and High Throughput , 2004, NSDI.

[9]  Bo Li,et al.  An Empirical Study of the Coolstreaming+ System , 2007, IEEE Journal on Selected Areas in Communications.

[10]  Chuan Wu,et al.  Characterizing Peer-to-Peer Streaming Flows , 2007, IEEE Journal on Selected Areas in Communications.

[11]  Shueng-Han Gary Chan,et al.  VMesh: Distributed Segment Storage for Peer-to-Peer Interactive Video Streaming , 2007, IEEE Journal on Selected Areas in Communications.

[12]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.

[13]  Anjali Gupta,et al.  Efficient Routing for Peer-to-Peer Overlays , 2004, NSDI.

[14]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[15]  Indranil Gupta,et al.  Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead , 2003, IPTPS.

[16]  Djamal-Eddine Meddour,et al.  Open Issues in P2P Multimedia Streaming , 2006 .

[17]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .