Peer-to-Peer Networking and Applications

, Volume 5, Issue 4, pp 363–383 | Cite as

P2P IP Telephony over wireless ad-hoc networks

A smart approach on super node admission
  • Mehdi Mani
  • Winston K. G. Seah
  • Noel Crespi
  • Reza FarahbakhshEmail author


This paper presents a new strategy to form P2P IP Telephony overlay for wireless ad-hoc networks. In the proposed strategy a structured P2P system is considered where some nodes, called super-nodes, with higher capacity form the overlay and provide registry and call routing services. As selection and admission of new super-nodes in wireless ad-hoc networks is more challenging than backbone networks, we define the strategies to select and admit new super-nodes into the overlay. On one hand, scarce resources and fluctuating link quality demand additional criteria than just node computing resources for super-nodes selection. On the other hand, the indiscriminate increase in super-node number can raise the call session setup delay and degrade the quality. This is due to the relaying of packets across multiple wireless links. In this paper, we first define the criteria to select super-nodes and then the major part of the paper is dedicated to defining the required strategies to admit new super-nodes. Our admission strategies add new super-nodes to the system whenever they are required. Since the strategy does not simply admit all eligible super-node candidates, this ensures control over the number of super-nodes and keeps the session setup delay within to the required service level threshold. We define a queuing network to model our system and evaluate the efficacy of our admission strategies with intensive simulations. Furthermore, we have implemented a P2P IP Telephony system that operates on wireless ad-hoc networks and validated the performance of our admission strategies on this real platform.


IP Telephony P2P Wireless ad-hoc networks Distributed hash table 



This work has been supported by the EU ITEA-2 project 10029 TWIRL founded by DGCIS.


  1. 1.
    3GPP: IP Multimedia Subsystem (IMS). TS 23.228, Release 8, v8.2.0 (2007)Google Scholar
  2. 2.
    Adler M, Kumar R, Ross KW, Rubenstein D, Suel T, Yao DD (2005) Optimal peer selection for P2P downloading and streaming. In: Proceeding of 24th annual joint conference of the IEEE computer and communications societies (INFOCOM), vol 3, pp 1538–1549Google Scholar
  3. 3.
  4. 4.
    Baset SA, Schulzrinne HG (2006) An analysis of the Skype Peer-to-Peer internet telephony protocol. In: Proceeding of the 25th IEEE international conference on computer communications (INFOCOM). Barcelona, Spain, pp 1–11Google Scholar
  5. 5.
    Berners-Lee T, Fielding R, Masinter L (1998) Uniform resource identifiers (URI): generic syntax. IETF RFC 2396Google Scholar
  6. 6.
    Bianchi G (2000) Performance analysis of the IEEE 802.11 distributed coordination function. IEEE J Sel Areas Commun 18:535–547CrossRefGoogle Scholar
  7. 7.
    Bolch G, Greiner S, de Meer H, Trivedi KS (2006) Queueing networks and Markov chains: modeling and performance evaluation with computer science applications, 2nd edn. Wiley, New YorkzbMATHCrossRefGoogle Scholar
  8. 8.
    Caesar M, Castro M, Nightingale EB, O’Shea G, Rowstron AIT (2006) Virtual ring routing: network routing inspired by DHTs. In: Proceedings of ACM SIGCOMM. Pisa, Italy, pp 351–362Google Scholar
  9. 9.
    Clausen T, Jacquet P (2003) Optimized Link State Routing protocol (OLSR). IETF RFC-3684Google Scholar
  10. 10.
    Ding G, Bhargava B (2004) Peer-to-peer file-sharing over mobile ad hoc networks. In: Proceedings of the 2nd IEEE annual conference on Pervasive Computing and Communications (PerCom) workshops, pp 104–108Google Scholar
  11. 11.
  12. 12.
    Eyers T, Schulzrinne H (1998) Predicting internet telephony call setup delay. In: Proceeding of International Conference on Network Protocols (ICNP)Google Scholar
  13. 13.
    Ferreira R, Jagannathan S, Grama A (2004) Enhancing locality in structured peer-to-peer networks. In: Proceedings of 10th International Conference on the Parallel and Distributed Systems (ICPADS), pp 25–34Google Scholar
  14. 14.
    Ghimire J, Mani M, Crespi N (2009) Delay and capacity analysis of structured peer-to-peer networks for ip telephony. Technical Report RR 09 012 RS2M, Institut TELECOM, Telecom SudParisGoogle Scholar
  15. 15.
    Ghimire J, Mani M, Crespi N (2009) A novel node connectivity index for wireless ad hoc networks. Technical Report RR 09 011 RS2M, Institut TELECOM, Telecom SudParisGoogle Scholar
  16. 16.
    He T, Huang C, Blum BM, Stankovic JA, Abdelzaher T (2003) Range-free localization schemes for large scale sensor networks. In: Proceedings of the 9th annual international conference on Mobile Computing and networking (MobiCom). San Diego, USA, pp 81–95Google Scholar
  17. 17.
    ITU-T (1999) Network grade of service parameters and target values for circuit-switched services in the evolving ISDN. Recommendation E.721, Telecommunication Standardization Sector of ITU, Geneva, SwitzerlandGoogle Scholar
  18. 18.
    ITU-T (2006) Packet-based multimedia communications systems. T-REC-H.323, Telecommunication Standardization Sector of ITU, Geneva, SwitzerlandGoogle Scholar
  19. 19.
    Jesi GP, Montresor A, Babaoglu Z (2006) Proximity-aware superpeer overlay topologies. In: Keller A, Martin-Flatin JP (eds) SelfMan, lecture notes in computer science, vol 3996. Springer, pp 43–57Google Scholar
  20. 20.
    Liben-Nowell D, Balakrishnan H, Karger D (2002) Analysis of the evolution of peer-to-peer systems. In: Proceeding of ACM Conf. on Principles of Distributed Computing (PODC), pp 233–242Google Scholar
  21. 21.
    Lua EK, Crowcroft J, Pias M, Sharma R, Lim S (2005) A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Surveys & Tutorials 7(2):72–93. Google Scholar
  22. 22.
    Mani M, Nguyen AM, Crespi N (2008) Scope—service classified overlay for P2P environment, a service platform for P2P services over ad-hoc networks. In: Proceeding of 5th IEEE international conference on mobile ad hoc and sensor systems (MASS), pp 541–543Google Scholar
  23. 23.
    Mani M, Ngyuen AM, Crespi N (2009) What’s up: P2P spontaneous social networking. In: Proceedings of IEEE international conference on Pervasive Computing and Communications (PerCom). TX, USA, pp 1–2Google Scholar
  24. 24.
    Mani M, Seah W, Crespi N (2007) Super nodes positioning for P2P ip telephony over wireless ad-hoc networks. In: Proceedings of the 6th international conference on mobile and ubiquitous multimedia, MUM ’07. ACM, NY, USAGoogle Scholar
  25. 25.
    Pietzuch P, Ledlie J, Mitzenmacher M, Seltzer M (2006) Network-aware overlays with network coordinates. In: Proceeding of 26th IEEE International Conference on Distributed Computing Systems (ICDCS) Workshops. Lisboa, PortugalGoogle Scholar
  26. 26.
  27. 27.
    Randic M (1998) On characterization of molecular attributes. Acta Chim Slov 30(12):239–252Google Scholar
  28. 28.
    Ratnasamy S, Francis P, Handley M, Karp R, Schenker S (2001) A scalable content-addressable network. In: Proceedings of ACM SIGCOMM. San Diego, USA, pp 161–172Google Scholar
  29. 29.
    Ratnasamy S, Handley M, Karp RM, Shenker S (2002) Topologically-aware overlay construction and server selection. In: Proceeding of the 21st annual joint conference of the IEEE computer and communications societies (INFOCOM), vol 3. New York, USA, pp 1190–1199Google Scholar
  30. 30.
    Rhea S, Godfrey B, Karp B, Kubiatowicz J, Ratnasamy S, Shenker S, Stoica I, Yu H (2005) OpenDHT: a public DHT service and its uses. In: Proceedings of ACM SIGCOMM. Philadelphia, USA, pp 73–84Google Scholar
  31. 31.
    Rhea SC, Geels D, Roscoe T, Kubiatowicz J (2004) Handling Churn in a DHT. In: Proceedings of the annual conference on USENIX Annual Technical Conference (ATEC). Boston, USA, pp 10–10Google Scholar
  32. 32.
    Rosenberg J, Schulzrinne H, Camarillo G, Johnston A, J Peterson RS, Handley M, Schooler E (2002) SIP: Session Initiation Protocol. IETF RFC 3261Google Scholar
  33. 33.
    Rowstronl A, Druschel P (2001) Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms (Middleware). Springer, London, UK, pp 329–350Google Scholar
  34. 34.
    Singh K, Schulzrinne H (2006) Using an external DHT as a SIP location service. Columbia University Technical Report (CUCS-007-06)Google Scholar
  35. 35.
  36. 36.
    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–32Google Scholar
  37. 37.
    Waldvogel M, Rinaldi R (2003) Efficient topology-aware overlay network. Comput Commun Rev 33(1):101–106CrossRefGoogle Scholar
  38. 38.
    Waldwogel M, Rinaldi R (2003) Efficient topology-aware overlay network. ACM SIGCOMM Computer Communication Review, pp 101–106Google Scholar
  39. 39.
    Yang B, Garcia-Molina H (2003) Designing a super-peer network. In: Proceeding of 19th International Conference on Data Engineering (ICDE). Bangalore, India, pp 49–60Google Scholar
  40. 40.
    Zhao BY, Huang L, Stribling J, Rhea SC, Joseph AD, Kubiatowicz J (2004) Tapestry: a resilient global-scale overlay for service deployment. IEEE J Sel Areas Commun 22:41–53Google Scholar

Copyright information

© Springer Science + Business Media, LLC 2012

Authors and Affiliations

  • Mehdi Mani
    • 1
  • Winston K. G. Seah
    • 2
  • Noel Crespi
    • 1
  • Reza Farahbakhsh
    • 1
    Email author
  1. 1.CNRS Lab UMR5157Institut TELECOM, Telecom SudParisParisFrance
  2. 2.Victoria University of WellingtonWellingtonNew Zealand

Personalised recommendations