Symposium on Self-Stabilizing Systems

SSS 2013: Stabilization, Safety, and Security of Distributed Systems pp 191-205

Self-stabilizing Balancing Algorithm for Containment-Based Trees

  • Evangelos Bampas
  • Anissa Lamani
  • Franck Petit
  • Mathieu Valero
Conference paper

DOI: 10.1007/978-3-319-03089-0_14

Volume 8255 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Bampas E., Lamani A., Petit F., Valero M. (2013) Self-stabilizing Balancing Algorithm for Containment-Based Trees. In: Higashino T., Katayama Y., Masuzawa T., Potop-Butucaru M., Yamashita M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2013. Lecture Notes in Computer Science, vol 8255. Springer, Cham

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.

Keywords

self-stabilization balancing algorithms containment-based trees 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Evangelos Bampas
    • 1
  • Anissa Lamani
    • 2
  • Franck Petit
    • 3
  • Mathieu Valero
    • 4
  1. 1.School of Elec. & Comp. Eng.National Technical University of AthensGreece
  2. 2.Graduate School of Information Science and Electrical EngineeringKyushu UniversityJapan
  3. 3.LIP6ParisFrance
  4. 4.Orange LabsIssy-les-MoulineauxFrance