Title :
DRESS codes for the storage cloud: Simple randomized constructions
Author :
Pawar, Sameer ; Noorshams, Nima ; El Rouayheb, Salim ; Ramchandran, Kannan
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Berkeley, CA, USA
fDate :
July 31 2011-Aug. 5 2011
Abstract :
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.
Keywords :
cloud computing; distributed memory systems; reliability; replicated databases; storage area networks; DRESS code; MDS code; availability requirement; balls-and-bins model; cloud storage; data storage; distributed replication-base exact simple storage code; large-scale distributed system; maximum distance separable code; regenerating code construction; reliability requirement; uncoded repair processes; Availability; Bandwidth; Color; Decision support systems; Maintenance engineering; Peer to peer computing; Silicon;
Conference_Titel :
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4577-0596-0
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2011.6033980