DocumentCode :
2174763
Title :
DataCube: A P2P Persistent Data Storage Architecture Based on Hybrid Redundancy Schema
Author :
Ribeiro, H.B. ; Anceaume, E.
Author_Institution :
IRISA/INRIA Rennes Bretagne-Atlantique, Rennes, France
fYear :
2010
fDate :
17-19 Feb. 2010
Firstpage :
302
Lastpage :
306
Abstract :
This paper presents the design of a P2P data persistent platform. Durable access and integrity of the data are ensured despite massive attacks. This platform, named DataCube, exploits the properties of cluster-based peer-to-peer substrates to implement a compound of full replication and rateless erasure codes. DataCube guarantees durable access and integrity of data despite adversarial attacks. In particular, the recovery of damaged data is achieved through the retrieval of coded blocks whose integrity is checked on the fly.
Keywords :
data integrity; peer-to-peer computing; DataCube; P2P persistent data storage architecture; damaged data recovery; data integrity; hybrid redundancy schema; Algorithm design and analysis; Information retrieval; Logic testing; Memory; Open systems; Peer to peer computing; Redundancy; Robustness; System testing; Topology; Byzantine failure model; Peer-to-peer; availability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel, Distributed and Network-Based Processing (PDP), 2010 18th Euromicro International Conference on
Conference_Location :
Pisa
ISSN :
1066-6192
Print_ISBN :
978-1-4244-5672-7
Electronic_ISBN :
1066-6192
Type :
conf
DOI :
10.1109/PDP.2010.60
Filename :
5452454
Link To Document :
بازگشت