IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Decentralized erasure codes for distributed networked storage
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
A hybrid routing approach for opportunistic networks
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
Exploring high performance distributed file storage using LDPC codes
Parallel Computing
WEAVER codes: highly fault tolerant erasure codes for storage systems
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
ACM Transactions on Sensor Networks (TOSN)
GRID codes: Strip-based erasure codes with high fault tolerance for storage systems
ACM Transactions on Storage (TOS)
Content-access QoS in peer-to-peer networks using a fast MDS erasure code
Computer Communications
Rateless erasure resilient codes for content storage and distribution in P2P networks
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
HotDep'08 Proceedings of the Fourth conference on Hot topics in system dependability
Towards efficient execution of erasure codes on multicore architectures
PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 2
| Hi-index | 0.00 |
As peer-to-peer and widely distributed storage systemsproliferate, the need to perform efficient erasure coding,instead of replication, is crucial to performance and efficiency.Low-Density Parity-Check (LDPC) codes havearisen as alternatives to standard erasure codes, such asReed-Solomon codes, trading off vastly improved decodingperformance for inefficiencies in the amount of datathat must be acquired to perform decoding. The scoresof papers written on LDPC codes typically analyze theircollective and asymptotic behavior. Unfortunately, theirpractical application requires the generation and analysisof individual codes for finite systems.This paper attempts to illuminate the practical considerationsof LDPC codes for peer-to-peer and distributedstorage systems. The three main types of LDPC codesare detailed, and a huge variety of codes are generated,then analyzed using simulation. This analysis focuses onthe performance of individual codes for finite systems,and addresses several important heretofore unansweredquestions about employing LDPC codes in real-world systems.