HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Failure-Tolerant Overlay Trees for Large-Scale Dynamic Networks

Davide Frey 1, * Amy Murphy 2
* Corresponding author
1 ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems
IRISA-D1 - SYSTÈMES LARGE ÉCHELLE, Inria Rennes – Bretagne Atlantique
Abstract : 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.
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download

Contributor : Davide Frey Connect in order to contact the contributor
Submitted on : Wednesday, November 5, 2008 - 7:35:52 PM
Last modification on : Thursday, January 20, 2022 - 4:19:54 PM
Long-term archiving on: : Tuesday, October 9, 2012 - 3:02:06 PM


Files produced by the author(s)


  • HAL Id : inria-00337054, version 1


Davide Frey, Amy 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⟩



Record views


Files downloads