DataCube: a P2P persistent Storage Architecture based on Hybrid Redundancy Schema - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

DataCube: a P2P persistent Storage Architecture based on Hybrid Redundancy Schema

Abstract

This paper presents the design of DataCube, a P2P data persistent platform. This platform exploits the properties of cluster-based peer-to-peer structured overlays altogether with a hybrid redundancy schema (a compound of light replication and rateless erasure coding) to guarantee durable access and integrity of data despite adversarial attacks. In particular, the recovery of damaged data is achieved through the retrieval of the minimum number of coded blocks: coded blocks are selectively retrieved and their integrity is checked on the y. An analysis validates DataCube principles design. Specically, the triptych "availability - storage overhead - bandwidth usage" is evaluated, and results show that despite massive attacks and high churn, DataCube performs remarkably well.
Fichier principal
Vignette du fichier
PI-1936.pdf (545.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00421686 , version 1 (02-10-2009)

Identifiers

  • HAL Id : inria-00421686 , version 1

Cite

H.B. Ribeiro, Emmanuelle Anceaume. DataCube: a P2P persistent Storage Architecture based on Hybrid Redundancy Schema. [Research Report] PI 1936, 2009, pp.11. ⟨inria-00421686⟩
104 View
58 Download

Share

Gmail Facebook Twitter LinkedIn More