A practical study of self-stabilization for prefix-tree based overlay networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

A practical study of self-stabilization for prefix-tree based overlay networks

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 (a.k.a., tries), 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.
Fichier principal
Vignette du fichier
DLPT_TTL.pdf (315.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01427728 , version 1 (06-01-2017)

Licence

Attribution - NonCommercial - NoDerivatives

Identifiers

Cite

Vlad Acretoaie, Eddy Caron, Cédric Tedeschi. A practical study of self-stabilization for prefix-tree based overlay networks. MOSPAS 2010 - Workshop on MOdeling and Simulation of Peer-to-Peer Architectures and Systems., IEEE, Jun 2010, Caen, France. pp.341 - 347, ⟨10.1109/HPCS.2010.5547117⟩. ⟨hal-01427728⟩
1895 View
101 Download

Altmetric

Share

Gmail Facebook X LinkedIn More