A Practical Analysis of Low-Density Parity-Check Erasure Codes for Wide-Area Storage Applications
James S. Plank, Michael G. Thomason

The International Conference on Dependable Systems and Networks, Florence, Italy, June, 2004

Available as: .PDF

Abstract:
As peer-to-peer and widely distributed storage systems proliferate, tolerating multiple server failures effectively becomes crucial to performance and efficiency. At the heart of this sort of fault-tolerance lie erasure codes, most typically Reed-Solomon codes. However, more recently Low-Density Parity-Check (LDPC) codes have arisen as alternative codes that trade off vastly improved decoding performance for inefficiencies in the amount of data that must be acquired to perform decoding. The scores of papers written on LDPC codes typically analyze their collective and asymptotic behavior. Unfortunately, their practical application requires the generation and analysis of individual codes for finite systems.
This paper attempts to illuminate the practical considerations of LDPC codes for peer-to-peer and distributed storage systems. We employ simulation to generate a huge variety of individual codes, and then analyze their behavior in order to address several important heretofore unanswered questions about employing LDPC codes in real-world systems.

Citation Info:

Authors: James S. Plank, Michael G. Thomason
Title: A Practical Analysis of Low-Density Parity-Check Erasure Codes for Wide-Area Storage Applications
Conference: The International Conference on Dependable Systems and Networks
Year: 2004
Month: June
Address: Florence, Italy
Where: http://loci.eecs.utk.edu/publications/2004_LDPC_Erasure_Codes.php