{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:10:47Z","timestamp":1748751047618,"version":"3.41.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319271217"},{"type":"electronic","value":"9783319271224"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27122-4_42","type":"book-chapter","created":{"date-parts":[[2015,11,16]],"date-time":"2015-11-16T11:27:27Z","timestamp":1447673247000},"page":"606-620","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Data Regeneration Based on Multiple Trees with Network Coding in Distributed Storage System"],"prefix":"10.1007","author":[{"given":"Pengfei","family":"You","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changjian","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghao","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxing","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,16]]},"reference":[{"unstructured":"Rhea, S., Eaton, P., Geels, D., Weatherspoon, H., Zhao, B., Kubia towicz, J.: Pond: the OceanStore Prototype. In: FAST, pp. 1\u201314 (2003)","key":"42_CR1"},{"unstructured":"Huang, C., Simitci, H., Xu, Y., et al.: Erasure coding in windows azure storage. In: Proceedings of the 2012 USENIX Conference on Annual Technical Conference, pp. 2\u20132. USENIX Association, Boston, MA, USA (2012)","key":"42_CR2"},{"doi-asserted-by":"crossref","unstructured":"Sathiamoorthy, M., Asteris, M., Papailiopoulos, D., et al.: XORing elephants: novel erasure codes for big data. In: Proceedings of the 39th International Conference on Very Large Data Bases, pp. 325\u2013336. VLDB Endowment (2013)","key":"42_CR3","DOI":"10.14778\/2535573.2488339"},{"doi-asserted-by":"crossref","unstructured":"Ghemawat, S., Gobioff, H., Leung, S.-T.: The Google file system. In: SOSP, pp. 29\u201343 (2003)","key":"42_CR4","DOI":"10.1145\/1165389.945450"},{"doi-asserted-by":"crossref","unstructured":"Guo, C., Lu, G., Li, D., Wu, H., Zhang, X., Shi, Y., Tian, C., Zhang, Y., Lu, S.: BCube: a high performance, server-centric network architecture for modular data centers. In: Proceedings of ACM SIGCOMM 2009 conference on Data communication, pp. 63\u201374 (2009)","key":"42_CR5","DOI":"10.1145\/1592568.1592577"},{"key":"42_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-45748-8_31","volume-title":"Peer-to-Peer Systems","author":"H Weatherspoon","year":"2002","unstructured":"Weatherspoon, H., Kubiatowicz, J.D.: Erasure coding vs. replication: a quantitative comparison. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 328. Springer, Heidelberg (2002)"},{"key":"42_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11558989_21","volume-title":"Peer-to-Peer Systems IV","author":"R Rodrigues","year":"2005","unstructured":"Rodrigues, R., Zhou, T.H.: High availability in DHTs: erasure coding vs. replication. In: van Renesse, R. (ed.) IPTPS 2005. LNCS, vol. 3640, pp. 226\u2013239. Springer, Heidelberg (2005)"},{"unstructured":"Acedanski, S., Deb, S., Medard, M., Koetter, R.: How good is random linear coding based distributed networked storage?. In: Proceedings of 1st Workshop on Network Coding, pp. 1\u20136, Riva del Garda, Italy (2005)","key":"42_CR8"},{"doi-asserted-by":"crossref","unstructured":"Dimakis, A., Godfrey, P., Wainwright, M., Ramchandran, K.: Network coding for distributed storage systems. In: Proceedings of 26th INFOCOM, pp. 2000\u20132008 (2007)","key":"42_CR9","DOI":"10.1109\/INFCOM.2007.232"},{"unstructured":"Wu, Y., Dimakis, R., Ramch, K.: Deterministic regenerating codes for distributed storage. In: Allerton Conference on Control, Computing, and Communication, pp. 1\u20135, Urbana-Champaign, IL (2007)","key":"42_CR10"},{"doi-asserted-by":"crossref","unstructured":"Li, J., Yang, S., Wang, X., Xue, X., Li, B.: Tree-structured data regeneration with network coding in distributed storage systems. In: Proceedings of 17th IEEE International Workshop on Quality of Service (IWQoS), pp. 1\u20139 (2009)","key":"42_CR11","DOI":"10.1109\/IWQoS.2009.5201391"},{"doi-asserted-by":"crossref","unstructured":"Li, J., Yang, S., Wang, X., Li, B.: Tree-structured data regeneration in distributed storage systems with regenerating codes. In: Proceedings INFOCOM, pp. 1\u20139 (2010)","key":"42_CR12","DOI":"10.1109\/INFCOM.2010.5462122"},{"issue":"4","key":"42_CR13","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.-Y., Yeung, R.: Network information flow. IEEE Trans. Inf. Theory 46(4), 1204\u20131216 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Duminuco, A., Biersack, E.: Hierarchical codes: how to make erasure codes attractive for peer-to-peer storage systems. In: Eighth International Conference on Peer-to-Peer Computing, pp. 89\u201398 (2008)","key":"42_CR14","DOI":"10.1109\/P2P.2008.9"},{"unstructured":"Bhagwan, R., Tati, K., Cheng, Y., Savage, S., Voelker, G.: Total recall: system support for automated availability management. In: Proceedings of NSDI 2001, pp. 25\u201325 (2004)","key":"42_CR15"},{"doi-asserted-by":"crossref","unstructured":"Ho, T., Koetter, R., Medard, M., Karger, D., Effros, M.: The benefits of coding over routing in a randomized setting. In: Proceedings of IEEE International Symposium on Information Theory, pp. 442\u2013447 (2003)","key":"42_CR16","DOI":"10.1109\/ISIT.2003.1228459"},{"unstructured":"Planetlab. http:\/\/www.planet-lab.org\/","key":"42_CR17"},{"unstructured":"Banerjee, S., Lee, S.-J., Sharma, P., Yalagandula., P.: S3 (Scalable Sensing Service). http:\/\/networking.hpl.hp.com\/scube\/PLI","key":"42_CR18"},{"unstructured":"Stribling., J.: Planetlab All Pairs Ping. http:\/\/infospect.planet-lab.org\/pings","key":"42_CR19"},{"doi-asserted-by":"crossref","unstructured":"Tarjan, R.E.: A good algorithm for edge-disjoint branching. Inf. Process. Lett. 51\u201353 (1974)","key":"42_CR20","DOI":"10.1016\/0020-0190(74)90024-6"},{"doi-asserted-by":"crossref","unstructured":"Roskind, J., Tarjan, R.E.: A note on finding minimum-cost edge-disjoint spanning trees. Math. Oper. Res. 701\u2013708 (1985)","key":"42_CR21","DOI":"10.1287\/moor.10.4.701"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27122-4_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T12:04:58Z","timestamp":1748693098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27122-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319271217","9783319271224"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27122-4_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}