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.
Type de document :
Rapport
[Research Report] PI 1936, 2009, pp.11
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00421686
Contributeur : Ist Rennes <>
Soumis le : vendredi 2 octobre 2009 - 15:37:59
Dernière modification le : jeudi 11 janvier 2018 - 06:20:08
Document(s) archivé(s) le : mercredi 16 juin 2010 - 00:18:49

Fichier

PI-1936.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00421686, version 1

Collections

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〉

Partager

Métriques

Consultations de la notice

247

Téléchargements de fichiers

104