期刊名称：International Journal of Distributed and Parallel Systems
印刷版ISSN：2229-3957
电子版ISSN：0976-9757
出版年度：2012
卷号：3
期号：5
DOI：10.5121/ijdps.2012.3501
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：Distributed storage systems are becoming more and more popular with the rapidly increasing demand for large-scale data storage. To increase the capacity and I/O performance of a distributed storage system, scaling it up is a common method. Regenerating Codes are a class of distributed storage codes that offer good reliability through encoding and provide good bandwidth cost on failed nodes repairing. This paper studies the scaling problem of E-MSR codes based distributed storage systems with fixed number of redundancy codes. We generate the encoding matrices of an storage system carefully from the encoding matrices of an storage system to minimize the changes of encoded blocks when scaling. Therefore the system can be scaled up with relatively low bandwidth cost and computation cost.
