TY - GEN
T1 - DRESS codes for the storage cloud
T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
AU - Pawar, Sameer
AU - Noorshams, Nima
AU - El Rouayheb, Salim
AU - Ramchandran, Kannan
PY - 2011
Y1 - 2011
N2 - We introduce an efficient family of exact regenerating codes for data storage in large-scale distributed systems. We refer to these new codes as Distributed Replication-based Exact Simple Storage (DRESS) codes. A key property of DRESS codes is their very efficient distributed and uncoded repair and growth processes that have minimum bandwidth, reads and computational overheads. This property is essential for large-scale systems with high reliability and availability requirements. DRESS codes will first encode the file using a Maximum Distance Separable (MDS) code, then place multiple replicas of the coded packets on different nodes in the system. We propose a simple and flexible randomized scheme for placing those replicas based on the balls-and-bins model. Our construction showcases the power of the probabilistic approach in constructing regenerating codes that can be efficiently repaired and grown.
AB - We introduce an efficient family of exact regenerating codes for data storage in large-scale distributed systems. We refer to these new codes as Distributed Replication-based Exact Simple Storage (DRESS) codes. A key property of DRESS codes is their very efficient distributed and uncoded repair and growth processes that have minimum bandwidth, reads and computational overheads. This property is essential for large-scale systems with high reliability and availability requirements. DRESS codes will first encode the file using a Maximum Distance Separable (MDS) code, then place multiple replicas of the coded packets on different nodes in the system. We propose a simple and flexible randomized scheme for placing those replicas based on the balls-and-bins model. Our construction showcases the power of the probabilistic approach in constructing regenerating codes that can be efficiently repaired and grown.
UR - http://www.scopus.com/inward/record.url?scp=80054814764&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80054814764&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2011.6033980
DO - 10.1109/ISIT.2011.6033980
M3 - Conference contribution
AN - SCOPUS:80054814764
SN - 9781457705953
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2338
EP - 2342
BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Y2 - 31 July 2011 through 5 August 2011
ER -