{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T17:48:01Z","timestamp":1759340881971,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1109\/infcom.2010.5462122","type":"proceedings-article","created":{"date-parts":[[2010,5,12]],"date-time":"2010-05-12T20:54:40Z","timestamp":1273697680000},"page":"1-9","source":"Crossref","is-referenced-by-count":70,"title":["Tree-structured Data Regeneration in Distributed Storage Systems with Regenerating Codes"],"prefix":"10.1109","author":[{"given":"Jun","family":"Li","sequence":"first","affiliation":[]},{"given":"Shuang","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Baochun","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","article-title":"Deterministic regenerating codes for distributed storage","author":"wu","year":"2007","journal-title":"Allerton Conference on Control Computing and Communication"},{"key":"ref3","article-title":"High availability in dhts: Erasure coding vs. replication","author":"rodrigues","year":"2005","journal-title":"Proc 4th Int Workshop on Peer-to-Peer Syst"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1002\/0471722162","author":"david","year":"2003","journal-title":"Order Statistics"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2009.14"},{"key":"ref11","first-page":"376","article-title":"A theorem on trees","volume":"23","author":"cayley","year":"1889","journal-title":"Quart J Math"},{"key":"ref5","article-title":"How good is random linear coding based distributed networked storage?","author":"aceda\u00e5\u201eski","year":"2005","journal-title":"Proc of 1st Workshop on Network Coding WiOpt"},{"journal-title":"Planetlab all pairs ping","year":"0","author":"stribling","key":"ref12"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2009.5191399"},{"key":"ref7","article-title":"Tree-structured data regeneration with network coding in distributed storage systems","author":"li","year":"2009","journal-title":"Proceedings of the IEEE International Workshop on Quality of Service"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.232"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/978-3-540-31966-5_23","article-title":"Measuring bandwidth between PlanetLab nodes","author":"lee","year":"2005","journal-title":"Passive and Active Network Measurement"},{"key":"ref1","article-title":"Total recall: system support for automated availability management","author":"bhagwan","year":"2004","journal-title":"Proc of the 1st Symposium on Networked Systems Design and Implementation"}],"event":{"name":"IEEE INFOCOM 2010 - IEEE Conference on Computer Communications","start":{"date-parts":[[2010,3,14]]},"location":"San Diego, CA, USA","end":{"date-parts":[[2010,3,19]]}},"container-title":["2010 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5461675\/5461899\/05462122.pdf?arnumber=5462122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T08:07:44Z","timestamp":1497859664000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5462122\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/infcom.2010.5462122","relation":{},"subject":[],"published":{"date-parts":[[2010,3]]}}}