When Expanders Help Self-Healing Distributed R-Tree Overlays

Taisuke Izumi 1 Maria Potop-Butucaru 2 Mathieu Valero 3
2 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
3 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : We present the first self-healing architecture for recovering semantic DR-tree overlays in response to physical nodes failures (crash). Our work builds on two of our recent results: the overlay virtualization and churn tolerant design of constant expanders for distributed R-trees. That is, the proposed self-healing strategy, in order to recover the searchability and the semantic organization of the original overlay, exploits both the randomly uniform distribution of the logical nodes on top of the physical network and the additional virtual links of the expander. The convergence time of our scheme is O(log(n)) and the height of the recovered tree is increased only by Ω(log f) with respect to the original overlay (n is the size of the network and f are the number of crashed nodes). We validate our scheme via simulations including measures of the recovery time, the recovery extra cost and finally the impact of the recovery scheme on the distributed R-tree connectivity and semantics.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01340283
Contributor : Maria Potop-Butucaru <>
Submitted on : Thursday, June 30, 2016 - 4:50:22 PM
Last modification on : Thursday, March 21, 2019 - 2:41:55 PM

Identifiers

  • HAL Id : hal-01340283, version 1

Citation

Taisuke Izumi, Maria Potop-Butucaru, Mathieu Valero. When Expanders Help Self-Healing Distributed R-Tree Overlays. IEEE ISPDC 2013, IEEE 12th International Symposium on Parallel and Distributed Computing, Jun 2013, Bucarest, Romania. pp.143-150. ⟨hal-01340283⟩

Share

Metrics

Record views

172