DRing: A Layered Scheme for Range Queries over DHTs

Abstract : Traditional DHT structures optimize data searches over large-scale networks, but provide very poor support for range queries. Several schemes in the literature attempt to overcome this issue, but they fail to combine load balancing, low message overhead, and low latency search operations. In this article we present DRing, an efficient layered solution that directly supports range queries over a ring-like DHT structure. We improve load balancing by focusing queries on the nodes that store data, and by updating neighbour information through an optimistic approach. DRing reduces overhead and latency in environments where queries significantly outnumber data insertion operations. We analyse DRing through simulation and show that our solution does not rely on data distribution.
Type de document :
Communication dans un congrès
IEEE International Conference on Computer and Information Technology, Aug 2011, Paphos, Cyprus. IEEE, pp.29-34, 2011, 〈10.1109/CIT.2011.100〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00627476
Contributeur : Nicolas Hidalgo <>
Soumis le : mercredi 28 septembre 2011 - 17:05:21
Dernière modification le : mardi 17 avril 2018 - 11:26:26

Identifiants

Collections

Citation

Nicolas Hidalgo, Erika Rosas, Luciana Arantes, Olivier Marin, Pierre Sens, et al.. DRing: A Layered Scheme for Range Queries over DHTs. IEEE International Conference on Computer and Information Technology, Aug 2011, Paphos, Cyprus. IEEE, pp.29-34, 2011, 〈10.1109/CIT.2011.100〉. 〈inria-00627476〉

Partager

Métriques

Consultations de la notice

268