Skip to Main content Skip to Navigation
Master thesis

Fast Construction of Efficient Structured Peer-to-Peer Overlays

Lokman Rahmani 1
1 OASIS - Active objects, semantics, Internet and security
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
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.
Complete list of metadata

Cited literature [35 references]  Display  Hide  Download
Contributor : Fabrice Huet Connect in order to contact the contributor
Submitted on : Tuesday, November 4, 2014 - 4:50:02 PM
Last modification on : Friday, February 4, 2022 - 3:19:54 AM
Long-term archiving on: : Friday, April 14, 2017 - 12:35:33 PM


Files produced by the author(s)


  • HAL Id : hal-00932195, version 2



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



Record views


Files downloads