RelaxDHT: A churn-resilient replication strategy for peer-to-peer distributed hash-tables

  • Authors:
  • Sergey Legtchenko;Sébastien Monnet;Pierre Sens;Gilles Muller

  • Affiliations:
  • LIP6/UPMC/CNRS/INRIA;LIP6/UPMC/CNRS/INRIA;LIP6/UPMC/CNRS/INRIA;LIP6/UPMC/CNRS/INRIA

  • Venue:
  • ACM Transactions on Autonomous and Adaptive Systems (TAAS)
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

DHT-based P2P systems provide a fault-tolerant and scalable means 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 of the current DHT-based systems' implementations. To deal with this problem, it is necessary to build more efficient replication and maintenance mechanisms. In this article, we study the effect of churn on PAST, an existing DHT-based P2P system. We then propose solutions to enhance churn tolerance and evaluate them through discrete event simulation.