| Paper: | SPCOM-P1.11 | ||
| Session: | Coding and Compression | ||
| Time: | Tuesday, May 16, 10:30 - 12:30 | ||
| Presentation: | Poster | ||
| Topic: | Signal Processing for Communication: Distributed channel and source coding, information-theoretic studies | ||
| Title: | ERASURE RESILIENT CODES IN PEER-TO-PEER STORAGE CLOUD | ||
| Authors: | Jin Li, Microsoft Research, United States; Qiang Huang, Princeton University, | ||
| 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 can not 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. | ||
©2018 Conference Management Services, Inc. -||- email: webmaster@icassp2006.org -||- Last updated Friday, August 17, 2012