Distributed Hash Tables (DHTs) provide the substrate to build large scale distributed applications over peer-to-peer networks. A major limitation of DHTs is that they only support exact-match queries. In order to offer range queries over a DHT it is necessary to build additional indexing structures. Prefix-based indexes, such as Prefix Hash Tree (PHT), are interesting approaches for building distributed indexes on top of DHTs. Nevertheless, the lookup operation of these indexes usually generates a high amount of unnecessary traffic overhead which degrades system performance by increasing response time. In this paper, we propose a novel distributed cache system called Tabu Prefix Table Cache (TPT-C), aiming at improving the performance of the Prefix-trees. We have implemented our solution over PHT, and the results confirm that our searching approach reduces up to a 70% the search latency and traffic overhead. © 2011 IEEE.
Hidalgo, N., Arantes, L., Sens, P., & Bonnaire, X. (2011). Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS. 557-564. Paper presented at conference, . https://doi.org/10.1109/ICPADS.2011.18