Self-Stabilizing Prefix Tree Based Overlay Networks

Eddy Caron; Ajoy K. Datta; Cédric Tedeschi; Franck Petit

Self-Stabilizing Prefix Tree Based Overlay Networks

Eddy Caron ¹ Ajoy K. Datta ² Cédric Tedeschi ³ Franck Petit ⁴

1 AVALON - Algorithms and Software Architectures for Distributed and HPC Platforms

Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme

2 Department of Computer Science [Las Vegas]

3 MYRIADS - Design and Implementation of Autonomous Distributed Systems

IRISA-D1 - SYSTÈMES LARGE ÉCHELLE, Inria Rennes – Bretagne Atlantique

4 Regal - Large-Scale Distributed Systems and Applications

LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt

Abstract : In this paper, we focus on making tries self-stabilizing over such platforms, and propose a self-stabilizing maintenance algorithm for a prefix tree using a message passing model. The proof of self-stabilization is provided, and simulation results are given, to better capture its performances. Still based on simulations, we provide evidences that the protocol, beyond its capacity to repair the structure, can significantly improve the system’s availability, even when the system is not yet stabilized.

Document type :

Journal articles

Domain :

Computer Science [cs] / Distributed, Parallel, and Cluster Computing [cs.DC]

Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-01347457
Contributor : Franck Petit <>
Submitted on : Thursday, July 21, 2016 - 9:50:52 AM
Last modification on : Monday, August 12, 2019 - 12:16:02 PM

Self-Stabilizing Prefix Tree Based Overlay Networks

Identifiers

Collections

Citation

Export

Metrics

1338

Contact

Self-Stabilizing Prefix Tree Based Overlay Networks

Identifiers

Collections

Citation

Export

Share

Metrics

1338

Contact