Failure-Tolerant Overlay Trees for Large-Scale Dynamic Networks - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Failure-Tolerant Overlay Trees for Large-Scale Dynamic Networks

Résumé

Trees are fundamental structures for data dissemination in large-scale network scenarios. However, their inherent fragility has led researchers to rely on more redundant mesh topologies in the presence of churn or other highly dynamic settings. In this paper, instead, we outline a novel protocol that \emph{directly and efficiently} maintains a tree overlay in the presence of churn. It simultaneously achieves other beneficial properties such as limiting the maximum node degree, minimizing the extent of the tree topology changes resulting from failures, and limiting the number of nodes affected by each topology change. Applicability to a range of distributed applications is discussed and results are evaluated through extensive simulation and a PlanetLab deployment.
Fichier principal
Vignette du fichier
p2p08.pdf (265.32 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00337054 , version 1 (05-11-2008)

Identifiants

  • HAL Id : inria-00337054 , version 1

Citer

Davide Frey, Amy L. Murphy. Failure-Tolerant Overlay Trees for Large-Scale Dynamic Networks. 8th International Conference on Peer-to-Peer Computing 2008 (P2P'08), Sep 2008, Aachen, Germany. ⟨inria-00337054⟩
139 Consultations
235 Téléchargements

Partager

Gmail Facebook X LinkedIn More