Skip to Main content Skip to Navigation
Reports

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

H.B. Ribeiro 1 Emmanuelle Anceaume 1
1 ADEPT - Algorithms for Dynamic Dependable Systems
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
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.
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/inria-00421686
Contributor : Ist Rennes <>
Submitted on : Friday, October 2, 2009 - 3:37:59 PM
Last modification on : Tuesday, June 15, 2021 - 4:08:13 PM
Long-term archiving on: : Wednesday, June 16, 2010 - 12:18:49 AM

File

PI-1936.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00421686, version 1

Citation

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⟩

Share

Metrics

Record views

349

Files downloads

156