P2P IP Telephony over wireless ad-hoc networks

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.

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

[2]  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.

[3]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[4]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[5]  Henning Schulzrinne,et al.  An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol , 2004, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[6]  Robert A. Scholtz,et al.  Performance Analysis of , 1998 .

[7]  Rakesh Kumar,et al.  Optimal peer selection for P2P downloading and streaming , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[8]  Margo I. Seltzer,et al.  Network-Aware Overlays with Network Coordinates , 2006, 26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06).

[9]  A. Girotra,et al.  Performance Analysis of the IEEE 802 . 11 Distributed Coordination Function , 2005 .

[10]  Henning Schulzrinne,et al.  Using an External DHT as a SIP Location Service , 2006 .

[11]  Gian Paolo Jesi,et al.  Proximity-Aware Superpeer Overlay Topologies , 2006, IEEE Transactions on Network and Service Management.

[12]  Bharat K. Bhargava,et al.  Peer-to-peer file-sharing over mobile ad hoc networks , 2004, IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second.

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

[14]  Antony I. T. Rowstron,et al.  Virtual ring routing: network routing inspired by DHTs , 2006, SIGCOMM.

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

[16]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[17]  David R. Karger,et al.  Analysis of the evolution of peer-to-peer systems , 2002, PODC '02.

[18]  Winston Khoon Guan Seah,et al.  Super nodes positioning for P2P IP telephony over wireless ad-hoc networks , 2007, MUM.

[19]  Samrat Ganguly,et al.  IP Multimedia Subsystem (IMS) , 2008 .

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

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

[22]  Marcel Waldvogel,et al.  Efficient topology-aware overlay network , 2003, CCRV.

[23]  Mehdi Mani,et al.  SCOPE- service classified overlay for P2P environment, a service platform for P2P services over ad-hoc networks , 2008, 2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[24]  Roy T. Fielding,et al.  Uniform Resource Identifiers (URI): Generic Syntax , 1998, RFC.

[25]  Mehdi Mani,et al.  What's up: P2P spontaneous social networking , 2009, 2009 IEEE International Conference on Pervasive Computing and Communications.

[26]  Suresh Jagannathan,et al.  Enhancing locality in structured peer-to-peer networks , 2004, Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004..

[27]  Hector Garcia-Molina,et al.  Designing a super-peer network , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[28]  Henning Schulzrinne,et al.  Predicting Internet Telephony Call Setup Delay , 2000 .

[29]  Milan Randić Characterization of Molecular Attributes , 1998 .

[30]  Brighten Godfrey,et al.  OpenDHT: a public DHT service and its uses , 2005, SIGCOMM '05.

[31]  Myron Hlynka,et al.  Queueing Networks and Markov Chains (Modeling and Performance Evaluation With Computer Science Applications) , 2007, Technometrics.

[32]  Tarek F. Abdelzaher,et al.  Range-free localization schemes for large scale sensor networks , 2003, MobiCom '03.