{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T19:38:49Z","timestamp":1767382729785,"version":"3.37.3"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61371125"],"award-info":[{"award-number":["61371125"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017607","name":"Shenzhen Fundamental Research Program","doi-asserted-by":"publisher","award":["JCYJ20150630153917254"],"award-info":[{"award-number":["JCYJ20150630153917254"]}],"id":[{"id":"10.13039\/501100017607","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3054954","type":"journal-article","created":{"date-parts":[[2021,1,27]],"date-time":"2021-01-27T20:48:43Z","timestamp":1611780523000},"page":"21843-21858","source":"Crossref","is-referenced-by-count":4,"title":["An Optimal Tree-Structured Repair Scheme of Multiple Failure Nodes for Distributed Storage Systems"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3800-8254","authenticated-orcid":false,"given":"Anan","family":"Zhou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2818-9357","authenticated-orcid":false,"given":"Benshun","family":"Yi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4286-4670","authenticated-orcid":false,"given":"Yusheng","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6960-5006","authenticated-orcid":false,"given":"Laigan","family":"Luo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"1","article-title":"Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices","volume":"10","author":"zhou","year":"2020","journal-title":"Phys Rev X"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/WCCCT.2016.53"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2856206"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2015.1183"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.08.027"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11194-0_25"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.05.008"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2605681"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2628024"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2898660"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929788"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/11499305_5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20050237"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1109\/JSAC.2010.100215","article-title":"Decentralized coding algorithms for distributed storage in wireless sensor networks","volume":"28","author":"kong","year":"2010","journal-title":"IEEE J Sel Areas Commun"},{"key":"ref15","first-page":"693","article-title":"LT codes-based secure and reliable cloud storage service","author":"cao","year":"2012","journal-title":"Proc IEEE InfoCom"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.phycom.2020.101172"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/IFIPNetworking.2015.7145291"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/WCSP.2015.7341095"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCChina.2019.8855975"},{"key":"ref28","first-page":"1","article-title":"Tree-structured data regeneration with network coding in distributed storage systems","author":"li","year":"2009","journal-title":"Proc IEEE 17th Int Workshop Quality Service"},{"journal-title":"Hdfs Erasure Coding in Production","year":"2019","author":"nansai","key":"ref4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2020.2976720"},{"journal-title":"Amazon Web Services","year":"2012","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2989822"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CC.2013.6506936"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2939111"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2950922"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TST.2013.6522585"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2940975"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45748-8_31"},{"key":"ref46","first-page":"1","article-title":"A comparative study of minimal spanning tree algorithms","author":"ayegba","year":"2020","journal-title":"Proc Int Conf Math Comput Eng Comput Sci (ICMCECS)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2019.2914436"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/BRACIS.2019.00058"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2900537"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029427"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2879358"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-020-04697-y"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/ett.3095"},{"key":"ref41","first-page":"222","article-title":"Tabu search algorithm (TSA): A comprehensive survey","author":"prajapati","year":"2020","journal-title":"Proc 3rd Int Conf Emerg Technol Comput Eng Mach Learn Internet Things (ICETCE)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3281276"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.11.103"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2830800"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2902126"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICECOME.2018.8644980"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09336728.pdf?arnumber=9336728","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:56:28Z","timestamp":1639770988000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9336728\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3054954","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}