{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T23:25:16Z","timestamp":1705188316872},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Veh. Technol."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tvt.2020.2990934","type":"journal-article","created":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T20:02:12Z","timestamp":1588017732000},"page":"1-1","source":"Crossref","is-referenced-by-count":1,"title":["Performance Analysis on Distributed Storage Systems in Ring Networks"],"prefix":"10.1109","author":[{"given":"Shan","family":"Qu","sequence":"first","affiliation":[]},{"given":"Qin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jinbei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yuan","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Xinbing","family":"Wang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"81","article-title":"Having your cake and eating it too: Jointly optimal erasure codes for I\/O, storage, and network-bandwidth","author":"rashmi","year":"0","journal-title":"Proc USENIX FAST"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541298"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2902835"},{"key":"ref13","first-page":"1837--1852","article-title":"Distributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff","volume":"58","author":"shah","year":"2011","journal-title":"IEEE Trans Inform Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283043"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033778"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283044"},{"key":"ref17","first-page":"407--416","article-title":"Enabling data integrity protection in regenerating-coding-based cloud storage: Theory and implementation","volume":"25","author":"chen","year":"2013","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2898660"},{"key":"ref19","first-page":"176--201","article-title":"On secure exact-repair regenerating codes with a single pareto optimal point","volume":"66","author":"ye","year":"2019","journal-title":"IEEE Trans Inform Theory"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/945449.945450"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref6","first-page":"15","article-title":"Erasure coding in Windows azure storage","author":"huang","year":"0","journal-title":"Proc USENIX ATC"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/4236.957894"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2878223"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2690662"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(01)00302-4"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCChina.2017.8330424"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178588"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref24","first-page":"1","article-title":"Deterministic regenerating codes for distributed storage","author":"wu","year":"0","journal-title":"Proc Allerton Conf Control Comput Commun"},{"key":"ref23","first-page":"1","article-title":"High-performance general functinoal regenerating codes with near-optimal repair bandwidth","volume":"13","author":"lui","year":"2017","journal-title":"ACM Trans Storage"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503165"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849496"}],"container-title":["IEEE Transactions on Vehicular Technology"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/25\/4356907\/09079638.pdf?arnumber=9079638","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T13:44:54Z","timestamp":1651067094000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9079638\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/tvt.2020.2990934","relation":{},"ISSN":["0018-9545","1939-9359"],"issn-type":[{"value":"0018-9545","type":"print"},{"value":"1939-9359","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}