Fast Construction of Efficient Structured Peer-to-Peer Overlays - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Master Thesis Year : 2013

Fast Construction of Efficient Structured Peer-to-Peer Overlays

Abstract

This report presents algorithms for building Distributed Hash Tables (DHT) or Structured Overlays. DHTs are used as self-managing system to deal with distributed data over large networks. The provided algorithms guarantee] building Efficient DHTs by ensuring selected proper- ties, and this for the general case. Our algorithms can be mainly used in DHT-based storage systems to build efficient systems or to recover the last configuration of the systems after crash very fast.
Fichier principal
Vignette du fichier
RAHMANI-rapport-final.pdf (1.72 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00932195 , version 1 (16-01-2014)
hal-00932195 , version 2 (04-11-2014)

Identifiers

  • HAL Id : hal-00932195 , version 2

Cite

Lokman Rahmani. Fast Construction of Efficient Structured Peer-to-Peer Overlays. Distributed, Parallel, and Cluster Computing [cs.DC]. 2013. ⟨hal-00932195v2⟩
218 View
119 Download

Share

Gmail Facebook Twitter LinkedIn More