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. © Springer International Publishing 2013.
CITATION STYLE
Bampas, E., Lamani, A., Petit, F., & Valero, M. (2013). Self-stabilizing balancing algorithm for containment-based trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8255 LNCS, pp. 191–205). https://doi.org/10.1007/978-3-319-03089-0_14
Mendeley helps you to discover research relevant for your work.