Paper Info
Title
Have a Seat on the ErasureBench: Easy Evaluation of Erasure Coding Libraries for Distributed Storage Systems
Abstract
We present ErasureBench, an open-source framework to test and benchmark erasure coding implementations for distributed storage systems under realistic conditions. ErasureBench automatically instantiates and scales a cluster of storage nodes, and can seamlessly leverage existing failure traces. As a first example, we use ErasureBench to compare three coding implementations: a (10,4) Reed-Solomon (RS) code, a (10,6,5) locally repairable code (LRC), and a partition of the data source in ten pieces without error-correction. Our experiments show that LRC and RS codes require the same repair throughput when used with small storage nodes, since cluster and network management traffic dominate at this regime. With large storage nodes, read and write traffic increases and our experiments confirm the theoretical and practical tradeoffs between the storage overhead and repair bandwidth of RS and LRC codes.
Year
DOI
Venue
2016
10.1109/SRDSW.2016.20
2016 IEEE 35th Symposium on Reliable Distributed Systems Workshops (SRDSW)
Keywords
Field
DocType
erasure coding,erasurebench,distributed storage,locally-repairalable codes
Computer science,Distributed data store,Computer network,Real-time computing,Coding (social sciences),Redundancy (engineering),Bandwidth (signal processing),Throughput,Network management,Erasure code,Benchmark (computing),Distributed computing
Conference
ISBN
Citations 
PageRank 
978-1-5090-5260-8
0
0.34
References 
Authors
6
3
Name
Order
Citations
PageRank
Sebastien Vaucher161.85
Hugues Mercier2344.35
Valerio Schiavoni323528.37