A Decentralized Directory Service for Peer-to-Peer-Based Telephony

IP telephony has long been one of the most widely used applications of the peer-to-peer paradigm. Hardware phones with built-in peer-to-peer stacks are used to enable IP telephony in closed networks at large company sites, while the wide adoption of smart phones provides the infrastructure for software applications enabling ubiquitous Internet-scale IP-telephony. Decentralized peer-to-peer systems fit well as the underlying infrastructure for IP-telephony, as they provide the scalability for a large number of participants, and are able to handle the limited storage and bandwidth capabilities on the clients. We studied a commercial peer-to-peer-based decentralized communication platform supporting video communication, voice communication, instant messaging, et cetera. One of the requirements of the communication platform is the implementation of a user directory, allowing users to search for other participants. In this chapter, we present the Extended Prefix Hash Tree algorithm that enables the implementation of a user directory on top of the peer-to-peer communication platform in a fully decentralized way. We evaluate the performance of the algorithm with a real-world phone book. The results can be transferred to other scenarios where support for range queries is needed in combination with the decentralization, self-organization, and resilience of an underlying peer-to-peer infrastructure. DOI: 10.4018/978-1-60960-603-9.ch021

[1]  Srinivasan Seshan,et al.  Mercury: supporting scalable multi-attribute range queries , 2004, SIGCOMM 2004.

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

[3]  Santosh S. Vempala,et al.  Locality-preserving hashing in multidimensional spaces , 1997, STOC '97.

[4]  Daniel Stutzbach,et al.  Understanding churn in peer-to-peer networks , 2006, IMC '06.

[5]  Jörg P. Müller,et al.  Data Centric Peer-to-Peer Communication in Power Grids , 2009, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[6]  Emmanuel Udoh.  Evolving Developments in Grid and Cloud Computing: Advancing Research , 2012 .

[7]  James Aspnes,et al.  Skip graphs , 2003, SODA '03.

[8]  Kang-Won Lee,et al.  Supporting efficient keyword-based file search in peer-to-peer file sharing systems , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[9]  Jani Hautakorpi,et al.  A Feasibility Study of an Arbitrary Search in Structured Peer-to-Peer Networks , 2010, 2010 Proceedings of 19th International Conference on Computer Communications and Networks.

[10]  David Abramson,et al.  An Evaluation of Economy-based Resource Trading and Scheduling on Computational Power Grids for Parameter Sweep Applications , 2000 .

[11]  Hai Jiang,et al.  State-Carrying Code for Computation Mobility , 2010 .

[12]  Jack Dongarra,et al.  Handbook of Research on Scalable Computing Technologies , 2009 .

[13]  Manish Parashar,et al.  Enabling flexible queries with guarantees in P2P systems , 2004, IEEE Internet Computing.

[14]  Angela C. Sodan,et al.  Adaptive Job Scheduling Via Predictive Job Resource Allocation , 2006, JSSPP.

[15]  Marcin Dabrowski,et al.  Collaborative Web-Based System for Knowledge Transfer to Distributed Groups of Users Within Strategic Noise Mapping Domain , 2013, Int. J. Distributed Syst. Technol..

[16]  Tim Moors,et al.  Survey of Research towards Robust Peer-to-Peer Networks: Search Methods , 2007, RFC.

[17]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.