Skip to main content
SpringerLink
Log in

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

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29
Fig. 30

Similar content being viewed by others

References

  1. Akella A, Maggs B, Seshan S, Shaikh A, Sitaraman R (2003) A measurement-based analysis of multihoming. In: SIGCOMM, pp. 353~364

  2. Akella A, Seshan S, Shaikh A (2003) An empirical evaluation of wide-area internet bottlenecks. In: SIGMETRICS, pp. 316~317

  3. Amir Y, Danilov C, Goose S, Hedqvist D, Terzis A (2006) An overlay architecture for high quality VoIP streams. IEEE Trans Multimed 8(6):1250–1262

    Article  Google Scholar 

  4. Andersen D, Balakrishnan H, Kaashoek F, Morris R (2001) Resilient overlay networks. In: 18th ACM Symposium on Operating Systems Principles, pp. 131~145

  5. Bo Z, Ng TSE, Nandi A, Riedi RH, Druschel P, Guohui W (2010) Measurement-based analysis, modeling, and synthesis of the internet delay space. IEEE/ACM Trans Netw 18(1):229–242

    Article  Google Scholar 

  6. Castro M, Druschel P, Charlie Hu Y, Rowstron A (2002) Exploiting network proximity in distributed hash tables. In: International Workshop on Future Directions in Distributed Computing, pp. 52~55

  7. Fei T, Tao S, Gao L, Guerin R (2006) How to select a good alternate path in large peer-to-peer systems. In: INFOCOM, pp. 1~13

  8. Gummadi KP, Madhyastha HV, Gribble SD, Levy HM, Wetherall D (2004) Improving the reliability of internet paths with one-hop source routing. In: USENIX Operating Systems Design and Implementation (OSDI), pp. 183~198

  9. Gummadi K, Saroiu S, Gribble S (2002) King: estimating latency between arbitrary internet end hosts. In: Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurement, pp. 5~18

  10. Karger D, Lehman E, Leighton T, Levine M, Lewin D, Panigrahy R (1997) Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 654~663

  11. Lakhina A, Papagiannaki K, Crovella M, Diot C, Kolaczyk ED, Taft N (2004) Structural analysis of network traffic flows. In: SIGMETRICS, pp. 61~72

  12. Lee S, Zhang Z, Sahu S, Saha D (2006) On suitability of Euclidean embedding of internet hosts. In: SIGMETRICS, pp. 157~168

  13. Lumezanu C, Baden R, Spring N, Bhattacharjee B (2009) Triangle inequality and routing policy violations in the Internet. In: 10th International Conference on Passive and Active Network Measurement, pp. 45~54

  14. Lumezanu C, Baden R, Spring N, Bhattacharjee B (2009) Triangle inequality variations in the internet. In: 9th ACM SIGCOMM conference on Internet measurement conference, pp. 177~183

  15. Markopoulou A, Tobagi F, Karam M (2003) Assessing the quality of voice communications over internet backbones. IEEE/ACM Trans Netw 11(5):747–760

    Article  Google Scholar 

  16. Monnerat L, Amorim C (2006) D1HT: a distributed one hop hash table. In: 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1~10

  17. Rajendran RK, Ganguly S, Izmailov R, Rubenstein D (2006) Performance optimization of VoIP using an overlay network. In: INFOCOM, pp. 1~12

  18. Ratnasamy S, Handley M, Karp R, Shenker S (2002) Topologically-aware overlay construction and server selection. In: INFOCOM, pp. 1190~1199

  19. Ren S, Guo L, Zhang X (2006) ASAP: an AS-aware peer-relay protocol for high quality VoIP. In: 26th IEEE International Conference on Distributed Computing Systems, pp. 70

  20. Rosenberg J, Schulzrinne H, Camarillo G, Johnston AR, Peterson J, Sparks R, Handley M, Schooler E (2002) SIP: session initiation protocol. RFC 3261, Internet Engineering Task Force

  21. Stoica I, Morris R, Liben-Nowell D, Karger DR, Kaashoek MF, Dabek F, Balakrishnan H (2003) Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans Netw 11(1):17–32

    Article  Google Scholar 

  22. Tao S, Xu K, Estepa A, Fei T, Gao L, Gúerin R, Kurose J, Towsley D, Zhang Z (2005) Improving VoIP quality through path switching. In: INFOCOM, pp. 2268~2278

  23. Zhao BY, Huang L, Stribling J, Rhea SC, Joseph AD, Kubiatowicz JD (2004) Tapestry: a resilient global-scale overlay for service deployment. IEEE J Sel Area Comm 22(1):41–53

    Article  Google Scholar 

Download references

Acknowledgment

We thank anonymous reviewers for their constructive suggestions. This work is supported by the International Scientific and Technological Cooperation Projects under No. 2010DFA12780, the Key National Science & Technology Specific Projects under No. 2010ZX03005-003 and the Fundamental Research Funds for the Central Universities under No. 2009RC0121.

Author information

Authors and Affiliations

  1. Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing, China

    Gang Wang, Chunhong Zhang, Xiaofeng Qiu & Zhimin Zeng

  2. Mobile Life and New Media Lab, Beijing University of Posts and Telecommunications, Beijing, China

    Gang Wang, Chunhong Zhang, Xiaofeng Qiu & Zhimin Zeng

Authors
  1. Gang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chunhong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaofeng Qiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zhimin Zeng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gang Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, G., Zhang, C., Qiu, X. et al. An efficient relay node selection scheme to improve the performance of P2P-based VoIP applications in Chinese internet. Multimed Tools Appl 64, 599–625 (2013). https://doi.org/10.1007/s11042-011-0952-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-011-0952-5

Keywords

Search

Navigation