Self-Stabilizing Balancing Algorithm for Containment-Based Trees

Abstract : Containment-based trees are widely used to build data indexes, range-queryable overlays, publish/subscribe systems both in centralized and distributed contexts. In addition to their versatility, their balanced shape ensures an overall satisfactory performance. Recently, it has been shown that their distributed implementations can be fault-resilient. However, this robustness is achieved at the cost of unbalancing the structure. While the structure remains correct in terms of searchability, its performance can be significantly decreased. In this paper, we propose a distributed self-stabilizing algorithm to balance containment-based trees.
Type de document :
Communication dans un congrès
15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013, Nov 2013, Osaka, Japan. Springer Berlin / Heidelberg, 8255, pp.191-205, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-319-03089-0_14〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00933151
Contributeur : Franck Petit <>
Soumis le : lundi 20 janvier 2014 - 09:12:43
Dernière modification le : mardi 17 avril 2018 - 11:31:52

Lien texte intégral

Identifiants

Collections

Citation

Evangelos Bampas, Anissa Lamani, Franck Petit, Mathieu Valero. Self-Stabilizing Balancing Algorithm for Containment-Based Trees. 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2013, Nov 2013, Osaka, Japan. Springer Berlin / Heidelberg, 8255, pp.191-205, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-319-03089-0_14〉. 〈hal-00933151〉

Partager

Métriques

Consultations de la notice

343