A Tabu Based Cache to Improve Latency and Load Balancing on Prefix Trees

Abstract : 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.
Type de document :
Communication dans un congrès
ICPADS 2011 - IEEE International Conference on Parallel and Distributed Systems, Dec 2011, Tainan, Taiwan. IEEE, pp.557-564, 2011, 〈10.1109/ICPADS.2011.18〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00627479
Contributeur : Nicolas Hidalgo <>
Soumis le : mercredi 28 septembre 2011 - 17:09:26
Dernière modification le : vendredi 25 mai 2018 - 12:02:03

Identifiants

Collections

Citation

Nicolas Hidalgo, Luciana Arantes, Pierre Sens, Xavier Bonnaire. A Tabu Based Cache to Improve Latency and Load Balancing on Prefix Trees. ICPADS 2011 - IEEE International Conference on Parallel and Distributed Systems, Dec 2011, Tainan, Taiwan. IEEE, pp.557-564, 2011, 〈10.1109/ICPADS.2011.18〉. 〈inria-00627479〉

Partager

Métriques

Consultations de la notice

319