Dec. 5, 2007 to Dec. 7, 2007
Fabian Staber , Siemens AG, Corporate Technology, Information and Communications, Otto-Hahn-Ring 6, 81739 Munich, Germany
Gerald Kunzmann , Technische Universit?t M?nchen, Institute of Communication Networks, Arcisstr. 21, D-80333 Munich, Germany
Jorg P. Muller , Clausthal University of Technology, Institute of Computer Science, Julius-Albert-Str. 4, 38678 Clausthal-Zellerfeld, Germany
IP telephony has become one of the most successful applications of the peer-to-peer paradigm. However, providing a scalable peer-to-peer-based distributed telephone directory for searching user entries is still an unsolved challenge. In this paper we present the Extended Prefix Hash Tree algorithm that can be used to implement an indexing infrastructure supporting range queries on top of Distributed Hash Tables. The algorithm supports hierarchical keywords, and is especially designed for situations where a few keywords are very common while others are very uncommon. The design of our algorithm perfectly matches the requirements found in a distributed phone book scenario. We point out the difficulties that previous algorithms had with data that is distributed that way, and evaluate the performance of Extended Prefix Hash Trees 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.
Fabian Staber, Gerald Kunzmann, Jorg P. Muller, "Extended Prefix Hash Trees for a distributed phone book application", ICPADS, 2007, Parallel and Distributed Systems, International Conference on, Parallel and Distributed Systems, International Conference on 2007, pp. 1-8, doi:10.1109/ICPADS.2007.4447735