Erasure Resilient Codes in Peer-To-Peer Storage Cloud

Author

Jin Li

Author_Institution

Commun. & Collaboration Syst., Microsoft Res., Redmond, WA

Volume

4

fYear

2006

fDate

14-19 May 2006

Abstract

In this paper, we investigate the use of erasure resilient code (ERC) in a peer-to-peer storage cloud. We compare the random linear code (RLC, network coding) and the Reed-Solomon (RS) code, and study the proper ERC parameters in term of data reliability, computational efficiency and security concerns. We conclude that the use of ERC in P2P storage may greatly improve data reliability and reduce backup server cost. Because of the lack of efficient homomorphic hashing, RLC cannot be implemented efficiently and yet be effective against the malicious attack. As a result, we believe that the RS code is most suited for use in the P2P storage cloud

Keywords

Reed-Solomon codes; computer network reliability; linear codes; matrix algebra; peer-to-peer computing; random codes; Reed-Solomon code; data reliability; erasure resilient codes; network coding; peer-to-peer storage cloud; random linear code; Application software; Bandwidth; Clouds; Collaboration; Computer network reliability; Information retrieval; Motion pictures; Network servers; Peer to peer computing; Spine;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on

Conference_Location

Toulouse

ISSN

1520-6149

Print_ISBN

1-4244-0469-X

Type

conf

DOI

10.1109/ICASSP.2006.1660948

Filename

1660948