This file was created by the TYPO3 extension bib --- Timezone: CEST Creation date: 2024-09-15 Creation time: 10-08-59 --- Number of references 1 conference 200810riechelcncerco 2008 10 14 28-35 Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, are used more and more for file-sharing and content distribution applications. However, a major weakness of traditional DHTs is the search for stored content, as data is assigned to nodes based on hash functions, and the very nature of hash tables allows only exact pattern matches. We present Cerco, a solution for the problem of range queries by using the principles of order-preserving DHTs and a hierarchically structured P2P approach. To guarantee an efficient routing and load balancing, Cerco uses a dynamic hierarchy of DHTs by creating subrings on demand and two explicit load balancing strategies. Our evaluation shows that Cerco is able to achieve the goals of supporting range queries, logarithmic-hop routing, and efficient load balancing. RWTH Aachen University - Distributed Systems Group http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?isnumber=4664131&arnumber=4664148&count=180&index=16 http://web.informatik.uni-bonn.de/IV/Mitarbeiter/matthew/Mirror_LCN2008_Website/www.ieeelcn.org/ Print IEEE Press Proceedings of 33rd Annual IEEE Conference on Local Computer Networks (LCN 2008) IEEE Montreal, Canada 33rd Annual IEEE Conference on Local Computer Networks (LCN 2008) 14-17 Oct. 2008 en 978-1-4244-2412-2 10.1109/LCN.2008.4664148 1 SimonRieche Bui TheVinh KlausWehrle