{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:25:04Z","timestamp":1783610704804,"version":"3.55.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T00:00:00Z","timestamp":1579046400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T00:00:00Z","timestamp":1579046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s11432-019-9937-7","type":"journal-article","created":{"date-parts":[[2020,1,20]],"date-time":"2020-01-20T12:02:45Z","timestamp":1579521765000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Storage and repair bandwidth tradeoff for heterogeneous cluster distributed storage systems"],"prefix":"10.1007","volume":"63","author":[{"given":"Jingzhao","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kenneth W.","family":"Shum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,1,15]]},"reference":[{"key":"9937_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3149349","volume":"13","author":"Y C Hu","year":"2017","unstructured":"Hu Y C, Li X L, Zhang M, et al. Optimal repair layering for erasure-coded data centers. ACM Trans Storage, 2017, 13: 1\u201324","journal-title":"ACM Trans Storage"},{"key":"9937_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/2435204.2435207","volume":"9","author":"C Huang","year":"2013","unstructured":"Huang C, Chen M H, Li J. Pyramid codes: flexible schemes to trade space for access efficiency in reliable data storage systems. ACM Trans Storage, 2013, 9: 3","journal-title":"ACM Trans Storage"},{"key":"9937_CR3","doi-asserted-by":"publisher","first-page":"1728","DOI":"10.1109\/TPDS.2016.2628024","volume":"28","author":"H Y Zhang","year":"2017","unstructured":"Zhang H Y, Li H, Li S Y R. Repair tree: fast repair for single failure in erasure-coded distributed storage systems. IEEE Trans Parallel Distrib Syst, 2017, 28: 1728\u20131739","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"9937_CR4","doi-asserted-by":"publisher","first-page":"100301","DOI":"10.1007\/s11432-018-9482-6","volume":"61","author":"S B Balaji","year":"2018","unstructured":"Balaji S B, Krishnan M N, Vajha M, et al. Erasure coding for distributed storage: an overview. Sci China Inf Sci, 2018, 61: 100301","journal-title":"Sci China Inf Sci"},{"key":"9937_CR5","doi-asserted-by":"publisher","first-page":"100302","DOI":"10.1007\/s11432-018-9485-7","volume":"61","author":"H X Hou","year":"2018","unstructured":"Hou H X, Han Y S. A class of binary MDS array codes with asymptotically weak-optimal repair. Sci China Inf Sci, 2018, 61: 100302","journal-title":"Sci China Inf Sci"},{"key":"9937_CR6","doi-asserted-by":"publisher","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 N, et al. Network coding for distributed storage systems. IEEE Trans Inform Theor, 2010, 56: 4539\u20134551","journal-title":"IEEE Trans Inform Theor"},{"key":"9937_CR7","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"S Y R Li","year":"2003","unstructured":"Li S Y R, Yeung R W, Cai N. Linear network coding. IEEE Trans Inform Theor, 2003, 49: 371\u2013381","journal-title":"IEEE Trans Inform Theor"},{"key":"9937_CR8","doi-asserted-by":"publisher","first-page":"5779","DOI":"10.1109\/TIT.2015.2472524","volume":"61","author":"B Yang","year":"2015","unstructured":"Yang B, Tang X, Li J. A systematic piggybacking design for minimum storage regenerating codes. IEEE Trans Inform Theor, 2015, 61: 5779\u20135786","journal-title":"IEEE Trans Inform Theor"},{"key":"9937_CR9","doi-asserted-by":"publisher","first-page":"6318","DOI":"10.1109\/TIT.2017.2690662","volume":"63","author":"S Goparaju","year":"2017","unstructured":"Goparaju S, Fazeli A, Vardy A. Minimum storage regenerating codes for all parameters. IEEE Trans Inform Theor, 2017, 63: 6318\u20136328","journal-title":"IEEE Trans Inform Theor"},{"key":"9937_CR10","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","volume":"57","author":"K V Rashmi","year":"2011","unstructured":"Rashmi K V, Shah N B, Kumar P V. Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction. IEEE Trans Inform Theor, 2011, 57: 5227\u20135239","journal-title":"IEEE Trans Inform Theor"},{"key":"9937_CR11","first-page":"5802","volume":"63","author":"K V Rashmi","year":"2017","unstructured":"Rashmi K V, Shah N B, Ramchandran K. A piggybacking design framework for read-and download-efficient distributed storage codes. IEEE Trans Inform Theor, 2017, 63: 5802\u20135820","journal-title":"IEEE Trans Inform Theor"},{"key":"9937_CR12","doi-asserted-by":"publisher","first-page":"5271","DOI":"10.1109\/TIT.2015.2461623","volume":"61","author":"X Tang","year":"2015","unstructured":"Tang X, Yang B, Li J, et al. A new repair strategy for the hadamard minimum storage regenerating codes for distributed storage systems. IEEE Trans Inform Theor, 2015, 61: 5271\u20135279","journal-title":"IEEE Trans Inform Theor"},{"key":"9937_CR13","unstructured":"Ford D, Labelle F, Popovici F I, et al. Availability in globally distributed storage systems. In: Proceedings of the 9th USENIX Conference on Operating Systems Design and Implementation, Vancouver, 2010. 61\u201374"},{"key":"9937_CR14","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/384264.379239","volume":"34","author":"J Kubiatowicz","year":"2000","unstructured":"Kubiatowicz J, Bindel D, Chen Y, et al. OceanStore: an architecture for global-scale persistent storage. ACM SIGOPS Oper Syst Rev, 2000, 34: 190\u2013201","journal-title":"ACM SIGOPS Oper Syst Rev"},{"key":"9937_CR15","unstructured":"Ahmad F, Chakradhar S T, Raghunathan A, et al. Shufflewatcher: shuffle-aware scheduling in multi-tenant mapreduce clusters. In: Proceedings of 2014 USENIX Annual Technical Conference, Philadelphia, 2014. 1\u201313"},{"key":"9937_CR16","doi-asserted-by":"publisher","first-page":"5783","DOI":"10.1109\/TIT.2018.2806342","volume":"64","author":"N Prakash","year":"2018","unstructured":"Prakash N, Abdrashitov V, Medard M. The storage versus repair-bandwidth trade-off for clustered storage systems. IEEE Trans Inform Theor, 2018, 64: 5783\u20135805","journal-title":"IEEE Trans Inform Theor"},{"key":"9937_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/TIT.2018.2837860","volume":"65","author":"J Y Sohn","year":"2019","unstructured":"Sohn J Y, Choi B, Yoon S W, et al. Capacity of clustered distributed storage. IEEE Trans Inform Theor, 2019, 65: 81\u2013107","journal-title":"IEEE Trans Inform Theor"},{"key":"9937_CR18","doi-asserted-by":"publisher","first-page":"4730","DOI":"10.1109\/TIT.2019.2902835","volume":"65","author":"H X Hou","year":"2019","unstructured":"Hou H X, Lee P P C, Shum K W, et al. Rack-aware regenerating codes for data centers. IEEE Trans Inform Theor, 2019, 65: 4730\u20134745","journal-title":"IEEE Trans Inform Theor"},{"key":"9937_CR19","doi-asserted-by":"crossref","unstructured":"Hu Y C, Lee P P C, Zhang X. Double regenerating codes for hierarchical data centers. In: Proceedings of 2016 IEEE International Symposium on Information Theory (ISIT), 2016. 245\u2013249","DOI":"10.1109\/ISIT.2016.7541298"},{"key":"9937_CR20","doi-asserted-by":"crossref","unstructured":"Abdrashitov V, Prakash N, Medard M. The storage vs repair bandwidth trade-off for multiple failures in clustered storage networks. In: Proceedings of 2017 IEEE Information Theory Workshop (ITW), 2017. 46\u201350","DOI":"10.1109\/ITW.2017.8277979"},{"key":"9937_CR21","doi-asserted-by":"publisher","first-page":"2105","DOI":"10.1016\/j.comcom.2010.07.022","volume":"33","author":"S Akhlaghi","year":"2010","unstructured":"Akhlaghi S, Kiani A, Ghanavati M R. Cost-bandwidth tradeoff in distributed storage systems. Comput Commun, 2010, 33: 2105\u20132115","journal-title":"Comput Commun"},{"key":"9937_CR22","doi-asserted-by":"publisher","first-page":"100303","DOI":"10.1007\/s11432-018-9499-0","volume":"61","author":"J Z Wang","year":"2018","unstructured":"Wang J Z, Wang T H, Luo Y. Storage and repair bandwidth tradeoff for distributed storage systems with clusters and separate nodes. Sci China Inf Sci, 2018, 61: 100303","journal-title":"Sci China Inf Sci"},{"key":"9937_CR23","doi-asserted-by":"crossref","unstructured":"Pernas J, Yuen C, Gast\u00f3n B, et al. Non-homogeneous two-rack model for distributed storage systems. In: Proceedings of 2013 IEEE International Symposium on Information Theory (ISIT), 2013. 1237\u20131241","DOI":"10.1109\/ISIT.2013.6620424"},{"key":"9937_CR24","doi-asserted-by":"crossref","unstructured":"Sohn J Y, Choi B, Yoon S W, et al. Capacity of clustered distributed storage. In: Proceedings of 2017 IEEE International Conference on Communications (ICC), Paris, 2017","DOI":"10.1109\/ICC.2017.7997392"},{"key":"9937_CR25","doi-asserted-by":"publisher","first-page":"2701","DOI":"10.1109\/JSAC.2013.131210","volume":"31","author":"T Ernvall","year":"2013","unstructured":"Ernvall T, El Rouayheb S, Hollanti C, et al. Capacity and security of heterogeneous distributed storage systems. IEEE J Sel Areas Commun, 2013, 31: 2701\u20132709","journal-title":"IEEE J Sel Areas Commun"},{"key":"9937_CR26","doi-asserted-by":"crossref","unstructured":"Golrezaei N, Dimakis A G, Molisch A F. Wireless device-to-device communications with distributed caching. In: Proceedings of IEEE International Symposium on Information Theory, Cambridge, 2012","DOI":"10.1109\/ISIT.2012.6284029"},{"key":"9937_CR27","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1002\/ett.2887","volume":"26","author":"Q Yu","year":"2015","unstructured":"Yu Q, Shum K W, Sung C W. Tradeoff between storage cost and repair cost in heterogeneous distributed storage systems. Trans Emerging Tel Tech, 2015, 26: 1201\u20131211","journal-title":"Trans Emerging Tel Tech"},{"key":"9937_CR28","unstructured":"Wang J Z, Wang T H, Luo Y, et al. Capacity of distributed storage systems with clusters and separate nodes. 2019. ArXiv: 1901.03000"},{"key":"9937_CR29","doi-asserted-by":"publisher","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 N, et al. A survey on network codes for distributed storage. Proc IEEE, 2011, 99: 476\u2013489","journal-title":"Proc IEEE"},{"key":"9937_CR30","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede R, Cai N, Li S Y R, et al. Network information flow. IEEE Trans Inform Theor, 2000, 46: 1204\u20131216","journal-title":"IEEE Trans Inform Theor"},{"key":"9937_CR31","first-page":"77","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R K Ahuja","year":"1993","unstructured":"Ahuja R K, Magnanti T L, Orlin J B. Network Flows: Theory, Algorithms, and Applications. Upper Saddle River: Prentice Hall, 1993. 77\u201378"},{"key":"9937_CR32","doi-asserted-by":"publisher","first-page":"100304","DOI":"10.1007\/s11432-018-9516-6","volume":"61","author":"M Zorgui","year":"2018","unstructured":"Zorgui M, Wang Z Y. Code constructions for multi-node exact repair in distributed storage. Sci China Inf Sci, 2018, 61: 100304","journal-title":"Sci China Inf Sci"},{"key":"9937_CR33","doi-asserted-by":"crossref","unstructured":"Wu Y N, Dimakis A G. Reducing repair traffic for erasure coding-based storage via interference alignment. In: Proceedings of 2009 IEEE International Symposium on Information Theory (ISIT), 2009. 2276\u20132280","DOI":"10.1109\/ISIT.2009.5205898"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-019-9937-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-019-9937-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-019-9937-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T11:29:31Z","timestamp":1683890971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-019-9937-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,15]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["9937"],"URL":"https:\/\/doi.org\/10.1007\/s11432-019-9937-7","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,15]]},"assertion":[{"value":"22 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"122301"}}