Evaluating the Cost and Robustness of Self-organizing Distributed Hash Tables

Abstract : Self-organizing construction principles are a natural fit for large-scale distributed system in unpredictable deployment environments. These principles allow a system to systematically converge to a global state by means of simple, uncoordinated actions by individual peers. Indexing services based on the distributed hash table (DHT) abstraction have been established as a solid foundation for large-scale distributed applications. For most DHTs, the creation and maintenance of the overlay structure relies on the exploration and update of an already stabilized structure. We evaluate in this paper the practical interest of self-organizing principles, and in particular gossip-based overlay construction protocols, to bootstrap and maintain various DHT implementations. Based on the seminal work on T-Chord, a self-organizing version of Chord using the T-Man overlay construction service, we contribute three additional self-organizing DHTs: T-Pastry, T-Kademlia and T-Kelips. We conduct an experimental evaluation of the cost and performance of each of these designs using a prototype implementation. Our conclusion is that, while providing equivalent performance in a stabilized system, self-organizing DHTs are able to sustain and recover from higher level of churn than their explicitly-created counterparts, and should therefore be considered as a method of choice for deploying robust indexing layers in adverse environments.
Type de document :
Communication dans un congrès
Márk Jelasity; Evangelia Kalyvianaki. 16th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems (DAIS), Jun 2016, Heraklion, Crete, Greece. Lecture Notes in Computer Science, LNCS-9687, pp.16-31, 2016, Distributed Applications and Interoperable Systems. 〈10.1007/978-3-319-39577-7_2〉
Liste complète des métadonnées

Littérature citée [28 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01434797
Contributeur : Hal Ifip <>
Soumis le : vendredi 13 janvier 2017 - 14:02:38
Dernière modification le : vendredi 13 janvier 2017 - 14:05:49
Document(s) archivé(s) le : vendredi 14 avril 2017 - 19:51:16

Fichier

 Accès restreint
Fichier visible le : 2019-01-01

Connectez-vous pour demander l'accès au fichier

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Sveta Krasikova, Raziel Gómez, Heverson Ribeiro, Etienne Rivière, Valerio Schiavoni. Evaluating the Cost and Robustness of Self-organizing Distributed Hash Tables. Márk Jelasity; Evangelia Kalyvianaki. 16th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems (DAIS), Jun 2016, Heraklion, Crete, Greece. Lecture Notes in Computer Science, LNCS-9687, pp.16-31, 2016, Distributed Applications and Interoperable Systems. 〈10.1007/978-3-319-39577-7_2〉. 〈hal-01434797〉

Partager

Métriques

Consultations de la notice

31