{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:40Z","timestamp":1773377560672,"version":"3.50.1"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100018976","name":"Department of Telecommunications, Government of India","doi-asserted-by":"publisher","award":["DOTC-0001"],"award-info":[{"award-number":["DOTC-0001"]}],"id":[{"id":"10.13039\/501100018976","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016918","name":"RBCCPS","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100016918","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517901","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2340-2345","source":"Crossref","is-referenced-by-count":1,"title":["Low latency replication coded storage over memory -constrained servers"],"prefix":"10.1109","author":[{"given":"Rooji","family":"Jinan","sequence":"first","affiliation":[{"name":"Indian Institute of Science,Bangalore,Karnataka,India,560012"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajay","family":"Badita","sequence":"additional","affiliation":[{"name":"Indian Institute of Science,Bangalore,Karnataka,India,560012"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pradeep","family":"Sarvepalli","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Madras,Chennai,Tamil Nadu,India,600036"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Parimal","family":"Parag","sequence":"additional","affiliation":[{"name":"Indian Institute of Science,Bangalore,Karnataka,India,560012"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513263"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524510"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140518"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2825236.2825258"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2466453"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8056996"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155358"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2973224"},{"key":"ref28","author":"jinan","year":"2020","journal-title":"Latency optimal storage and scheduling of replicated fragments for memory-constrained servers"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2723019"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2018.00069"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2909868"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2988506"},{"key":"ref29","first-page":"2092","article-title":"Maximally recoverable codes for grid-like topologies","author":"gopalan","year":"2016","journal-title":"ACM-SIAM Symp Disc Alg (SODA)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007060"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14778\/2536206.2536213"},{"key":"ref7","volume":"2","author":"lin","year":"2001","journal-title":"Error Control Coding"},{"key":"ref2","first-page":"1","article-title":"Deterministic regenerating codes for distributed storage","author":"wu","year":"2007","journal-title":"Allerton Conf on Comm Ctrl and Comp"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173947"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3075377"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524626"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2847220.2847223"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2663165.2666089"},{"key":"ref23","article-title":"Diversity\/parallelism trade-off in distributed systems with redundancy","author":"peng","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2637364.2592042"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2506161"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517901.pdf?arnumber=9517901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:23Z","timestamp":1773347663000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517901\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517901","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}