{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:35:59Z","timestamp":1725701759001},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1109\/pccc.2012.6407765","type":"proceedings-article","created":{"date-parts":[[2013,1,17]],"date-time":"2013-01-17T15:29:22Z","timestamp":1358436562000},"page":"246-255","source":"Crossref","is-referenced-by-count":4,"title":["HERO: Heterogeneity-aware erasure coded redundancy optimal allocation for reliable storage in distributed networks"],"prefix":"10.1109","author":[{"given":"Guangping","family":"Xu","sequence":"first","affiliation":[]},{"given":"Sheng","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Gang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xiaoguang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Hua","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807165"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513356"},{"journal-title":"Jerasure A Library in C\/C++ Facilitating Erasure Coding for Storage Applications","year":"0","author":"plank","key":"18"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2009.63"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2010.5502492"},{"key":"13","article-title":"Using redundancy to cope with failures in a delay tolerant network","author":"jain","year":"0","journal-title":"Proc ACM SIGCOMM Aug 2005"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2009.5191399"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2010.205"},{"key":"12","article-title":"Towards Automatically Checking Thousands of Failures with Micro-specifications","author":"gunawi","year":"0","journal-title":"Proc HotDep Oct 2010"},{"journal-title":"Distributed Storage Systems","year":"2011","author":"dimakis","key":"21"},{"journal-title":"Erasure-coding Based Redundancy Optimal Placement in Heterogeneous Distributed Networks","year":"2011","author":"xu","key":"20"},{"journal-title":"Planetlab all pairs ping","year":"2010","author":"stribling","key":"22"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.100216"},{"key":"24","article-title":"Efficient eventual consistency in Pahoehoe, an erasure-coded key-blob archive","author":"anderson","year":"0","journal-title":"Proc DSN June 2010"},{"key":"25","article-title":"AmazingStore: Available, Low-cost Online Storage Service Using Cloudlets","author":"yang","year":"0","journal-title":"Proceedings of the 9th International Workshop on Peer-to-Peer Systems (IPTPS 2010) San Jose CA April 2010"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2011.6038657"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2009.15"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2010.11.004"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336679"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792237462"},{"journal-title":"A Course in Combinatorics","year":"2002","author":"van lint","key":"2"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2009053"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/24.295016"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284025"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"6","article-title":"Optimizing Cauchy Reed Solomon Codes for Fault-Tolerant Network Storage Applications","author":"plank","year":"0","journal-title":"Proc the 5th IEEE International Symposium on Network Computing and Applications (NCA) 2006"},{"key":"32","article-title":"Erasure Coding in Windows Azure Storage","author":"huang","year":"0","journal-title":"Proc USENIX ATC'12 Jun 2012"},{"key":"5","article-title":"High availability in DHTs: Erasure coding vs. replication","author":"rodrigues","year":"0","journal-title":"Proc IPTPS 2005"},{"key":"31","article-title":"Rethinking erasure codes for cloud file systems: Miniminzing I\/O for recovery and degraded reads","author":"khan","year":"0","journal-title":"Proc FAST Feb 2012"},{"key":"4","first-page":"328","article-title":"Erasure coding vs. replication: A quantitative comparison","author":"weatherspoon","year":"0","journal-title":"Proc IPTPS 2002"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/PCCC.2009.5403859"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/1177080.1177105"}],"event":{"name":"2012 IEEE 31st International Performance Computing and Communications Conference (IPCCC)","start":{"date-parts":[[2012,12,1]]},"location":"Austin, TX, USA","end":{"date-parts":[[2012,12,3]]}},"container-title":["2012 IEEE 31st International Performance Computing and Communications Conference (IPCCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6389872\/6407649\/06407765.pdf?arnumber=6407765","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T14:38:05Z","timestamp":1490193485000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6407765\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/pccc.2012.6407765","relation":{},"subject":[],"published":{"date-parts":[[2012,12]]}}}