A Practical Study of Self-Stabilization for Prefix-Tree Based Overlay Networks

Vlad Acretoaie 1 Eddy Caron 1, 2 Cédric Tedeschi 3
1 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
3 MYRIADS - Design and Implementation of Autonomous Distributed Systems
IRISA-D1 - SYSTÈMES LARGE ÉCHELLE, Inria Rennes – Bretagne Atlantique
Abstract : Service discovery is crucial in the development of fully decentralized computational grids. Among the significant amount of work produced by the convergence of peer-to-peer (P2P) systems and grids, a new kind of overlay networks, based on prefix trees, has emerged. In particular, the Distributed Lexicographic Placement Table (DLPT) approach is a decentralized and dynamic service discovery service. Fault-tolerance within the DLPT approach is achieved through best-effort policies relying on formal self-stabilization results. Self-stabilization means that the tree can become transiently inconsistent, but is guaranteed to autonomously converge to a correct topology after arbitrary crashes, in a finite time. However, during convergence, the tree may not be able to process queries correctly. In this paper, we present some simulation results having several objectives. First, we investigate the interest of self-stabilization for such architectures. Second, we explore, still based on simulation, a simple Time-To-Live policy to avoid useless processing during convergence time.
Type de document :
[Research Report] RR-7252, INRIA. 2010, pp.15
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

Contributeur : Cédric Tedeschi <>
Soumis le : lundi 19 avril 2010 - 18:40:07
Dernière modification le : mardi 16 janvier 2018 - 15:54:19
Document(s) archivé(s) le : mardi 28 septembre 2010 - 12:05:25


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00474376, version 1


Vlad Acretoaie, Eddy Caron, Cédric Tedeschi. A Practical Study of Self-Stabilization for Prefix-Tree Based Overlay Networks. [Research Report] RR-7252, INRIA. 2010, pp.15. 〈inria-00474376〉



Consultations de la notice


Téléchargements de fichiers