``Assessing the performance of Erasure Codes in the Wide Area''
Rebecca L. Collins and
James S. Plank.
Appearing in DSN-2005: The International Conference on
Dependable Systems and Networks, Yokohama, Japan, June, 2005.
PDF of the paper.
If the material in this paper interests you, please also read the
expanded version of the paper:
Technical Report UT-CS-04-536, University of Tennessee, November, 2004.
The problem of efficiently retrieving a file that has been broken into
blocks and distributed across the wide-area pervades applications that utilize
Grid, peer-to-peer, and distributed file systems. While the use of
erasure codes to improve the fault-tolerance and performance of wide-area
file systems has been explored, there has been little work
that assesses the performance and quantifies the impact of
modifying various parameters. This paper performs such an assessment.
We modify our previously
defined framework for studying replication in the wide-area to include
both Reed-Solomon and Low-Density Parity-Check (LDPC) erasure
codes. We then use this frameowkr to compare Reed-Solomon and LDPC erasure
codes in three wide-area, distributed settings. We conclude that although
LDPC codes have an advantage over Reed-Solomon codes in terms of decoding
cost, this advantage does not always translate to the best overall
performance in wide-area storage situations.
PDF of the paper.
- Plain Text:
author R. L. Collins and J. S. Plank
title Assessing the Performance of Erasure Codes in the Wide-Area
booktitle DSN-05: International Conference on Dependable Systems and Networks
address Yokohama, Japan
author = "R. L. Collins and J. S. Plank",
title = "Assessing the Performance of Erasure Codes in the Wide-Area",
booktitle = "DSN-05: International Conference on Dependable Systems and Networks",
address = "Yokohama, Japan",
publisher = "IEEE",
year = "2005",
where = "http://www.cs.utk.edu/~plank/plank/papers/DSN-2005-CP.html"