{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T08:42:44Z","timestamp":1725612164813},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1109\/infcom.2012.6195704","type":"proceedings-article","created":{"date-parts":[[2012,5,24]],"date-time":"2012-05-24T18:26:40Z","timestamp":1337884000000},"page":"2806-2810","source":"Crossref","is-referenced-by-count":9,"title":["On region-based fault tolerant design of distributed file storage in networks"],"prefix":"10.1109","author":[{"given":"Sujogya","family":"Banerjee","sequence":"first","affiliation":[]},{"given":"Shahrzad","family":"Shirazipourazad","sequence":"additional","affiliation":[]},{"given":"Arunabha","family":"Sen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228470"},{"year":"0","key":"22"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792237462"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/1063786.1063788"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365060"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513356"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/icc.2011.5962427"},{"key":"14","article-title":"Fractional repetition codes for repair in distributed storage systems","author":"el rouayheb","year":"0","journal-title":"Communication Control and Computing (Allerton) 2010 48th Annual Allerton Conference on"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934942"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2011.5986022"},{"journal-title":"Approximation Algorithms","year":"2001","author":"vazirani","key":"21"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874535"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"20"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/71.737699"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/50202.50214"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461984"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.270"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513795"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"journal-title":"Diversity Coloring for Distributed Storage in Mobile Networks","year":"2001","author":"jiang","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2009.5307417"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062074"}],"event":{"name":"IEEE INFOCOM 2012 - IEEE Conference on Computer Communications","start":{"date-parts":[[2012,3,25]]},"location":"Orlando, FL, USA","end":{"date-parts":[[2012,3,30]]}},"container-title":["2012 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6189419\/6195452\/06195704.pdf?arnumber=6195704","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T12:12:42Z","timestamp":1490098362000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6195704\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/infcom.2012.6195704","relation":{},"subject":[],"published":{"date-parts":[[2012,3]]}}}