Skip to Main content Skip to Navigation
Reports

Churn-resilient replication strategy for peer-to-peer distributed hash-tables

Sergey Legtchenko 1, 2 Sébastien Monnet 1, 2, * Pierre Sens 1, 2 Gilles Muller 2
* Corresponding author
2 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : DHT-based P2P systems provide a fault-tolerant and scalable mean to store data blocks in a fully distributed way. Unfortunately, recent studies have shown that if connection/ disconnection frequency is too high, data blocks may be lost. This is true for most current DHT-based system's implementations. To avoid this problem, it is necessary to build really efficient replication and maintenance mechanisms. In this paper, we study the effect of churn on an existing DHTbased P2P system such as Chord or Pastry. We then propose solutions to enhance churn tolerance and evaluate them through discrete event simulations.
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/inria-00374095
Contributor : Sébastien Monnet Connect in order to contact the contributor
Submitted on : Wednesday, April 8, 2009 - 3:18:20 PM
Last modification on : Friday, January 8, 2021 - 5:46:03 PM
Long-term archiving on: : Friday, October 12, 2012 - 4:25:23 PM

File

RR-6897.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00374095, version 1

Citation

Sergey Legtchenko, Sébastien Monnet, Pierre Sens, Gilles Muller. Churn-resilient replication strategy for peer-to-peer distributed hash-tables. [Research Report] RR-6897, INRIA. 2009, pp.21. ⟨inria-00374095⟩

Share

Metrics

Record views

453

Files downloads

634