{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T16:10:16Z","timestamp":1780416616747,"version":"3.54.1"},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100015401","name":"Key Research and Development Projects of Shaanxi Province","doi-asserted-by":"publisher","award":["2025CY-YBXM-062"],"award-info":[{"award-number":["2025CY-YBXM-062"]}],"id":[{"id":"10.13039\/501100015401","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015401","name":"Key Research and Development Projects of Shaanxi Province","doi-asserted-by":"publisher","award":["2023-ZDLGY-34"],"award-info":[{"award-number":["2023-ZDLGY-34"]}],"id":[{"id":"10.13039\/501100015401","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015401","name":"Key Research and Development Projects of Shaanxi Province","doi-asserted-by":"publisher","award":["62171356"],"award-info":[{"award-number":["62171356"]}],"id":[{"id":"10.13039\/501100015401","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015401","name":"Key Research and Development Projects of Shaanxi Province","doi-asserted-by":"publisher","award":["61671340"],"award-info":[{"award-number":["61671340"]}],"id":[{"id":"10.13039\/501100015401","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018596","name":"Collaborative Innovation Center of Information Sensing and Understanding, Xidian University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100018596","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013314","name":"Higher Education Discipline Innovation Project","doi-asserted-by":"publisher","award":["B08038"],"award-info":[{"award-number":["B08038"]}],"id":[{"id":"10.13039\/501100013314","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U24A20241"],"award-info":[{"award-number":["U24A20241"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.comnet.2026.112256","type":"journal-article","created":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:58:01Z","timestamp":1774630681000},"page":"112256","update-policy":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Placement strategy for rack-aware partially cooperative regenerating codes"],"prefix":"10.1016","volume":"282","author":[{"ORCID":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/orcid.org\/0000-0002-7627-7968","authenticated-orcid":false,"given":"Rong","family":"Sun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yubo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/orcid.org\/0000-0003-1981-0436","authenticated-orcid":false,"given":"Jingwei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.comnet.2026.112256_bib0001","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1109\/TMM.2017.2760627","article-title":"Traffic-optimized data placement for social media","volume":"20","author":"Tang","year":"2018","journal-title":"IEEE Trans. Multimed."},{"issue":"1","key":"10.1016\/j.comnet.2026.112256_bib0002","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TCC.2016.2603474","article-title":"Hadoop MapReduce for mobile clouds","volume":"7","author":"George","year":"2019","journal-title":"IEEE Trans. Cloud Comput."},{"key":"10.1016\/j.comnet.2026.112256_bib0003","series-title":"Proceeding of 5th USENIX Conference on File Storage Technology","first-page":"1","article-title":"Disk failures in the real world: what does an MTTF of 1000000 hours mean to you?","author":"Schroeder","year":"2007"},{"key":"10.1016\/j.comnet.2026.112256_bib0004","series-title":"ACM Sigmetrics International Conference on Measurement & Modeling of Computer Systems","first-page":"335","article-title":"An empirical analysis of intra- and inter-datacenter network failures for geo-distributed services","author":"Potharaju","year":"2013"},{"key":"10.1016\/j.comnet.2026.112256_bib0005","series-title":"2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS)","first-page":"255","article-title":"EC-Store: bridging the gap between storage and latency in distributed erasure coded systems","author":"Abebe","year":"2018"},{"issue":"5","key":"10.1016\/j.comnet.2026.112256_bib0006","doi-asserted-by":"crossref","first-page":"325","DOI":"10.14778\/2535573.2488339","article-title":"XORing elephants: novel erasure codes for big data","volume":"6","author":"Sathiamoorthy","year":"2013","journal-title":"VLDB Endowment"},{"issue":"9","key":"10.1016\/j.comnet.2026.112256_bib0007","doi-asserted-by":"crossref","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","article-title":"Network coding for distributed storage systems","volume":"56","author":"Dimakis","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"10.1016\/j.comnet.2026.112256_bib0008","doi-asserted-by":"crossref","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","article-title":"Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction","volume":"57","author":"Rashmi","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"10.1016\/j.comnet.2026.112256_bib0009","doi-asserted-by":"crossref","first-page":"2134","DOI":"10.1109\/TIT.2011.2178588","article-title":"Interference alignment in regenerating codes for distributed storage: necessity and code constructions","volume":"58","author":"Shah","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"10.1016\/j.comnet.2026.112256_bib0010","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1109\/JSAC.2010.100216","article-title":"Cooperative recovery of distributed storage systems from multiple losses with network coding","volume":"28","author":"Hu","year":"2010","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"10.1016\/j.comnet.2026.112256_bib0011","series-title":"2011 International Symposium on Networking Coding","first-page":"1","article-title":"Repairing multiple failures with coordinated and adaptive regenerating codes","author":"Kermarrec","year":"2011"},{"issue":"11","key":"10.1016\/j.comnet.2026.112256_bib0012","doi-asserted-by":"crossref","first-page":"7229","DOI":"10.1109\/TIT.2013.2274265","article-title":"Cooperative regenerating codes","volume":"59","author":"Shum","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.comnet.2026.112256_bib0013","series-title":"2014 IEEE International Symposium on Information Theory","first-page":"2440","article-title":"On storage codes allowing partially collaborative repairs","author":"Liu","year":"2014"},{"key":"10.1016\/j.comnet.2026.112256_bib0014","series-title":"2014 International Symposium on Information Theory and Its Applications","first-page":"378","article-title":"Two storage code constructions allowing partially collaborative repairs","author":"Liu","year":"2014"},{"issue":"7","key":"10.1016\/j.comnet.2026.112256_bib0015","doi-asserted-by":"crossref","first-page":"4012","DOI":"10.1109\/TCOMM.2020.2988924","article-title":"Exact-repair codes with partial collaboration in distributed storage systems","volume":"68","author":"Liu","year":"2020","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"10.1016\/j.comnet.2026.112256_bib0016","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/TIT.2018.2837860","article-title":"Capacity of clustered distributed storage","volume":"65","author":"Sohn","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"10.1016\/j.comnet.2026.112256_bib0017","doi-asserted-by":"crossref","first-page":"5783","DOI":"10.1109\/TIT.2018.2806342","article-title":"The storage versus repair-bandwidth trade-off for clustered storage systems","volume":"64","author":"Prakash","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"10.1016\/j.comnet.2026.112256_bib0018","doi-asserted-by":"crossref","first-page":"4730","DOI":"10.1109\/TIT.2019.2902835","article-title":"Rack-aware regenerating codes for data centers","volume":"65","author":"Hou","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"10.1016\/j.comnet.2026.112256_bib0019","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1109\/TDSC.2017.2774299","article-title":"Cross-rack-aware single failure recovery for clustered file systems","volume":"17","author":"Shen","year":"2020","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"10.1016\/j.comnet.2026.112256_bib0020","series-title":"2017 IEEE Information Theory Workshop (ITW)","first-page":"46","article-title":"The storage vs repair bandwidth trade-off for multiple failures in clustered storage networks","author":"Abdrashitov","year":"2017"},{"key":"10.1016\/j.comnet.2026.112256_bib0021","series-title":"2021 IEEE International Symposium on Information Theory (ISIT)","first-page":"2191","article-title":"Generalized rack-aware regenerating codes for jointly optimal node and rack repairs","author":"Hou","year":"2021"},{"issue":"7","key":"10.1016\/j.comnet.2026.112256_bib0022","doi-asserted-by":"crossref","first-page":"4316","DOI":"10.1109\/TCOMM.2022.3175826","article-title":"Rack-aware regenerating codes with multiple erasure tolerance","volume":"70","author":"Zhou","year":"2022","journal-title":"IEEE Trans. Commun."},{"issue":"10","key":"10.1016\/j.comnet.2026.112256_bib0023","doi-asserted-by":"crossref","first-page":"6428","DOI":"10.1109\/TIT.2023.3289187","article-title":"Rack-aware MSR codes with error correction capability for multiple erasure tolerance","volume":"69","author":"Wang","year":"2023","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"10.1016\/j.comnet.2026.112256_bib0024","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1109\/JSAIT.2022.3182365","article-title":"On rack-aware cooperative regenerating codes and epsilon-MSCR codes","volume":"3","author":"Gupta","year":"2022","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"10.1016\/j.comnet.2026.112256_bib0025","series-title":"2022 IEEE International Symposium on Information Theory (ISIT)","first-page":"2815","article-title":"Base station-assisted cooperative network coding for cellular systems with link constraints","author":"Arslan","year":"2022"},{"issue":"10","key":"10.1016\/j.comnet.2026.112256_bib0026","doi-asserted-by":"crossref","first-page":"6757","DOI":"10.1109\/TIT.2023.3339066","article-title":"Guessing cost: bounds and applications to data repair in distributed storage","volume":"70","author":"Arslan","year":"2024","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1389128626002689?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1389128626002689?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T15:49:20Z","timestamp":1780415360000},"score":1,"resource":{"primary":{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128626002689"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":26,"alternative-id":["S1389128626002689"],"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1016\/j.comnet.2026.112256","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Placement strategy for rack-aware partially cooperative regenerating codes","name":"articletitle","label":"Article Title"},{"value":"Computer Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1016\/j.comnet.2026.112256","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"112256"}}