Self-Stabilizing Balancing Algorithm for Containment-Based Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

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.

Dates and versions

hal-00933151 , version 1 (20-01-2014)

Identifiers

Cite

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⟩
212 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More