An efficient relay node selection scheme to improve the performance of P2P-based VoIP applications in Chinese internet

Peer-to-peer (P2P) systems have been widely deployed and used to provide voice-over-IP (VoIP) service in the Internet. However, the current best-effort Internet cannot readily provide the service guarantees that meet the quality standards achieved in the public switched telephone network (PSTN). To address this problem, many studies have demonstrated that exploiting path diversity is a promising approach, such as multi-homing and overlay routing. In this paper, we focus on the overlay scenario and bring forward a previously unexplored approach that exploits the properties of delay space of Internet to select relay node to enhance the performance of P2P-based VoIP applications in Chinese Internet. By conducting intensive Internet measurements, we analyze the properties of delay space of Chinese Internet and show these properties can be readily exploited to select relay node with as small a cost as possible. Exploiting these properties we bring forward an efficient relay node selection scheme to improve the performance of P2P-based VoIP applications in Chinese Internet. Our intensive evaluation by trace-driven simulation shows our scheme is highly efficient and easy to be implemented.

[1]  Krishna P. Gummadi,et al.  Improving the Reliability of Internet Paths with One-hop Source Routing , 2004, OSDI.

[2]  Rauf Izmailov,et al.  Performance Optimization of VoIP using an Overlay Network , 2005 .

[3]  Anees Shaikh,et al.  An empirical evaluation of wide-area internet bottlenecks , 2003, SIGMETRICS '03.

[4]  Gade Krishna,et al.  A scalable peer-to-peer lookup protocol for Internet applications , 2012 .

[5]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[6]  Athina Markopoulou,et al.  Assessing the quality of voice communications over internet backbones , 2003, TNET.

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

[8]  Bobby Bhattacharjee,et al.  Triangle Inequality and Routing Policy Violations in the Internet , 2009, PAM.

[9]  Konstantina Papagiannaki,et al.  Structural analysis of network traffic flows , 2004, SIGMETRICS '04/Performance '04.

[10]  Zhi-Li Zhang,et al.  On suitability of Euclidean embedding of internet hosts , 2006, SIGMETRICS '06/Performance '06.

[11]  Donald F. Towsley,et al.  Improving VoIP quality through path switching , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[12]  Anees Shaikh,et al.  A measurement-based analysis of multihoming , 2003, SIGCOMM '03.

[13]  Mark Handley,et al.  SIP: Session Initiation Protocol , 1999, RFC.

[14]  Xiaodong Zhang,et al.  ASAP: an AS-Aware Peer-Relay Protocol for High Quality VoIP , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[15]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[16]  Roch Guérin,et al.  How to Select a Good Alternate Path in Large Peer-to-Peer Systems? , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[17]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[18]  Andreas Terzis,et al.  An Overlay Architecture for High-Quality VoIP Streams , 2006, IEEE Transactions on Multimedia.

[19]  Bo Zhang,et al.  Measurement-Based Analysis, Modeling, and Synthesis of the Internet Delay Space , 2006, IEEE/ACM Transactions on Networking.

[20]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.

[21]  Cláudio L. Amorim,et al.  D1HT: a distributed one hop hash table , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[22]  Peter Druschel,et al.  Measurement-based analysis, modeling, and synthesis of the internet delay space , 2010, TNET.

[23]  Peter Druschel,et al.  Exploiting Network Proximity in Distributed Hash Tables , 2002 .

[24]  Bobby Bhattacharjee,et al.  Triangle inequality variations in the internet , 2009, IMC '09.