Affiliation:
1. Siemens Corporate Technology, Germany
2. Technische Universität München, Germany
3. Clausthal University of Technology, Germany
Abstract
Besides file sharing, IP telephony has become the most widely used peer-to-peer-based application. Software and hardware phones with built-in peer-to-peer stacks are used to enable IP telephony in closed networks on large company sites as well as in the Internet. As part of the PeerThings project1, Siemens developed a decentralized communication platform supporting video communication, voice communication, instant messaging, and so on. While decentralized communication has already been implemented in related work, providing a scalable peer-to-peer-based distributed directory for searching user entries is still an unsolved challenge. In this article we present the Extended Prefix Hash Tree algorithm that can be used to implement an indexing infrastructure supporting range queries on top of DHTs.
Subject
Computer Networks and Communications
Reference11 articles.
1. Barsanti, L., & Sodan, A. (2007). Adaptive Job Scheduling Via Predictive Job Resource Allocation. Job Scheduling Strategies for Parallel Processing (pp. 115-140).
2. Bellare, M., & Rogaway, P. (1993). Random oracles are practical: A paradigm for designing efficient protocols. In CCS ’93: Proc. of the 1st ACM conference on Computer and communications security (pp. 62–73). New York, NY, USA: ACM Press.
3. Bharambe, A. R., Agrawal, S., & Seshan, S. (2004). Mercury: Supporting scalable multi-attribute range queries. In SIGCOMM ’04: Proc. of the SIGCOMM Symposium on Communications Architectures and Protocols (pp. 353–366), Portland, OR, USA.
4. Buyya, R., Giddy, J., & Abramson, D. (2000). An Evaluation of Economy-Based Resource Trading and Scheduling on Computational Power Grids for Parameter Sweep Applications. Paper presented at the Proceedings of the Second Workshop on Active Middleware Services (AMS2000), Pittsburgh, USA. Aspnes, J., & Shah, G. (2003). Skip graphs. In SODA ’03: Proc. of the fourteenth annual ACM SIAM symposium on Discrete algorithms (pp. 384–393), Philadelphia, PA, USA.
5. Indyk, P., Motwani, R., Raghavan, P., & Vempala, S. (1997). Locality-preserving hashing in multidimensional spaces. In STOC ’97: Proc. of the twenty-ninth annual ACM symposium on Theory of computing (pp. 618–625), New York, NY, USA: ACM Press.