{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T23:15:07Z","timestamp":1763507707294},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T00:00:00Z","timestamp":1428451200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s11432-014-5276-4","type":"journal-article","created":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T07:13:52Z","timestamp":1428477232000},"page":"1-11","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["HeMatch: A redundancy layout placement scheme for erasure-coded storages in practical heterogeneous failure patterns"],"prefix":"10.1007","volume":"58","author":[{"given":"Jing","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ShanShan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"XiangKe","family":"Liao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ShaoLiang","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"XiaoDong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ZhouYang","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,8]]},"reference":[{"key":"5276_CR1","first-page":"21","volume":"11","author":"D Borthakur","year":"2007","unstructured":"Borthakur D. The hadoop distributed file system: Architecture and design. Hadoop Project Website, 11, 21. 2007","journal-title":"Hadoop Project Website"},{"key":"5276_CR2","first-page":"15","volume-title":"Proceedings of the 2012 USENIX Annual Technical Conference, Boston","author":"C Huang","year":"2012","unstructured":"Huang C, Simitci H, Xu, Y, et al. Erasure coding in Windows Azure Storage. In: Proceedings of the 2012 USENIX Annual Technical Conference, Boston, 2012. 15\u201326"},{"key":"5276_CR3","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1109\/JPROC.2010.2096170","volume":"99","author":"A G Dimakis","year":"2011","unstructured":"Dimakis A G, Ramchandran K, Wu Y, et al. A survey on network codes for distributed storage. Proc IEEE, 2011, 99: 476\u2013489","journal-title":"Proc IEEE"},{"key":"5276_CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/NCA.2006.43","volume-title":"Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications, Cambridge","author":"J S Plank","year":"2006","unstructured":"Plank J S, Xu L. Optimizing Cauchy Reed-Solomon codes for fault-tolerant network storage applications. In: Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications, Cambridge, 2006. 173\u2013180"},{"key":"5276_CR5","first-page":"89","volume-title":"Proceedings of the Eighth International Conference on Peer-to-Peer Computing, Aachen","author":"A Duminuco","year":"2008","unstructured":"Duminuco A, Biersack E. Hierarchical codes: How to make erasure codes attractive for peer-to-peer storage systems. In: Proceedings of the Eighth International Conference on Peer-to-Peer Computing, Aachen, 2008. 89\u201398"},{"key":"5276_CR6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/NCA.2007.37","volume-title":"Proceedings of the Sixth IEEE International Symposium on Network Computing and Applications, Cambridge","author":"C Huang","year":"2007","unstructured":"Huang C, Chen M, Li J. Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems. In: Proceedings of the Sixth IEEE International Symposium on Network Computing and Applications, Cambridge, 2007. 79\u201386"},{"key":"5276_CR7","first-page":"3","volume":"9","author":"C Huang","year":"2013","unstructured":"Huang C, Chen M, Li J. Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems. ACM Trans Stor, 2013, 9: 3","journal-title":"ACM Trans Stor"},{"key":"5276_CR8","volume-title":"MIT Technical Report","author":"D Talbot","year":"2013","unstructured":"Talbot D. A smarter algorithm could cut energy use in data centers by 35 percent. MIT Technical Report, 2013"},{"key":"5276_CR9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1145\/1879141.1879175","volume-title":"Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement, Melbourne","author":"T Benson","year":"2010","unstructured":"Benson T, Akella A, Maltz A. Network traffic characteristics of data centers in the wild. In: Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement, Melbourne, 2010. 267\u2013280"},{"key":"5276_CR10","volume-title":"Pearson Higher Education","author":"D Costello","year":"2004","unstructured":"Costello D, Lin S. Error Control Coding. Pearson Higher Education. 2004"},{"key":"5276_CR11","doi-asserted-by":"crossref","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","volume":"56","author":"A G Dimakis","year":"2010","unstructured":"Dimakis A G, Godfrey P B, Wu Y, et al. Network coding for distributed storage systems. IEEE Trans Inf Theor, 2010, 56: 4539\u20134551","journal-title":"IEEE Trans Inf Theor"},{"key":"5276_CR12","first-page":"1243","volume-title":"Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing, Chicago","author":"K V Rashmi","year":"2009","unstructured":"Rashmi K V, Shah N B, Kumar P V, et al. Explicit construction of optimal exact regenerating codes for distributed storage. In: Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing, Chicago, 2009. 1243\u20131249"},{"key":"5276_CR13","doi-asserted-by":"crossref","first-page":"2276","DOI":"10.1109\/ISIT.2009.5205898","volume-title":"Proceedings of the 2009 IEEE International Symposium on Information Theory, Seoul","author":"Y Wu","year":"2009","unstructured":"Wu Y, Dimakis A G. Reducing repair traffic for erasure coding-based storage via interference alignment. In: Proceedings of the 2009 IEEE International Symposium on Information Theory, Seoul, 2009. 2276\u20132280"},{"key":"5276_CR14","first-page":"21","volume-title":"Proceedings of the 10th USENIX Conference on File and Storage Technologies, San Jose","author":"Y Hu","year":"2012","unstructured":"Hu Y, Chen H C, Lee P P, et al. NCCloud: Applying network coding for the storage repair in a cloud-of-clouds. In: Proceedings of the 10th USENIX Conference on File and Storage Technologies, San Jose, 2012. 21"},{"key":"5276_CR15","first-page":"20","volume-title":"Proceedings of the 10th USENIX Conference on File and Storage Technologies, San Jose","author":"O Khan","year":"2012","unstructured":"Khan O, Burns R C, Plank J S, et al. Rethinking erasure codes for cloud file systems: minimizing I\/O for recovery and degraded reads. In: Proceedings of the 10th USENIX Conference on File and Storage Technologies, San Jose, 2012. 20"},{"key":"5276_CR16","first-page":"2346","volume-title":"Proceedings of the 2013 IEEE International Conference on Computer Communications, Turin","author":"J Li","year":"2013","unstructured":"Li J, Wang X, Li B. Cooperative pipelined regeneration in distributed storage systems. In: Proceedings of the 2013 IEEE International Conference on Computer Communications, Turin, 2013. 2346\u20132354"},{"key":"5276_CR17","first-page":"1","volume-title":"Proceedings of the 2011 International Symposium on Network Coding, Beijing","author":"J Li","year":"2011","unstructured":"Li J, Wang X, Li B. Pipelined regeneration with regenerating codes for distributed storage systems. In: Proceedings of the 2011 International Symposium on Network Coding, Beijing, 2011. 1\u20136"},{"key":"5276_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1353452.1353453","volume":"4","author":"A Dholakia","year":"2008","unstructured":"Dholakia A, Eleftheriou E, Hu X Y, et al. A new intra-disk redundancy scheme for high-reliability RAID storage systems in the presence of unrecoverable errors. ACM Trans Stor, 2008, 4: 1","journal-title":"ACM Trans Stor"},{"key":"5276_CR19","first-page":"95","volume-title":"Proceedings of the 11th USENIX Conference on File and Storage Technologies, San Jose","author":"J S Plank","year":"2013","unstructured":"Plank J S, Blaum M, Hafner J L. SD codes: Erasure codes designed for how storage systems really fail. In: Proceedings of the 11th USENIX Conference on File and Storage Technologies, San Jose, 2013. 95\u2013104"},{"key":"5276_CR20","first-page":"147","volume-title":"Proceedings of the 12th USENIX Conference on File and Storage Technologies, Santa Clara","author":"M Li","year":"2014","unstructured":"Li M, Lee P P. STAIR codes: A general family of erasure codes for tolerating device and sector failures in practical storage systems. In: Proceedings of the 12th USENIX Conference on File and Storage Technologies, Santa Clara, 2014. 147\u2013162"},{"key":"5276_CR21","volume-title":"Proceedings of the 2014 IEEE International Conference on Computer Communications, Toronto","author":"J Zhang","year":"2014","unstructured":"Zhang J, Liao X K, Li S S, et al. Aggrecode: Constructing route intersection for data reconstruction in erasure coded storage. In: Proceedings of the 2014 IEEE International Conference on Computer Communications, Toronto, 2014"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-014-5276-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-014-5276-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-014-5276-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T15:30:52Z","timestamp":1651678252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-014-5276-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,8]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["5276"],"URL":"https:\/\/doi.org\/10.1007\/s11432-014-5276-4","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,8]]}}}