Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

https://hal.inria.fr/hal-00933151
Contributor : Franck Petit <>
Submitted on : Monday, January 20, 2014 - 9:12:43 AM
Last modification on : Thursday, September 9, 2021 - 4:52:02 PM

Links full text

Identifiers

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. pp.191-205, ⟨10.1007/978-3-319-03089-0_14⟩. ⟨hal-00933151⟩

Share

Metrics

Record views

443