{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T19:37:34Z","timestamp":1767382654033},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319111933"},{"type":"electronic","value":"9783319111940"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11194-0_25","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T14:25:55Z","timestamp":1407853555000},"page":"325-338","source":"Crossref","is-referenced-by-count":3,"title":["Repairing Multiple Data Losses by Parallel Max-min Trees Based on Regenerating Codes in Distributed Storage Systems"],"prefix":"10.1007","author":[{"given":"Pengfei","family":"You","sequence":"first","affiliation":[]},{"given":"Yuxing","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Zhen","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Changjian","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Rhea, S., Eaton, P., Geels, D., Weatherspoon, H., Zhao, B., Kubiatowicz, J.: Pond: the OceanStore Prototype. In: FAST (2003)","key":"25_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. USENIX Association, Boston (2012)","key":"25_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, VLDB Endowment, pp. 325\u2013336 (2013)","key":"25_CR3","DOI":"10.14778\/2535573.2488339"},{"doi-asserted-by":"crossref","unstructured":"Ghemawat, S., Gobioff, H., Leung, S.-T.: The Google File System. In: SOSP (2003)","key":"25_CR4","DOI":"10.1145\/945449.945450"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-31966-5_23","volume-title":"Passive and Active Network Measurement","author":"S.-J. Lee","year":"2005","unstructured":"Lee, S.-J., Sharma, P., Banerjee, S., Basu, S., Fonseca, R.: Measuring bandwidth between planetLab nodes. In: Dovrolis, C. (ed.) PAM 2005. LNCS, vol.\u00a03431, pp. 292\u2013305. Springer, Heidelberg (2005)"},{"key":"25_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.\u00a02429, pp. 328\u2013337. Springer, Heidelberg (2002)"},{"key":"25_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.\u00a03640, 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: Proc. 1st Workshop on Network Coding, Riva del Garda, Italy (April 2005)","key":"25_CR8"},{"doi-asserted-by":"crossref","unstructured":"Dimakis, A., Godfrey, P., Wainwright, M., Ramchandran, K.: Network coding for distributed storage systems. In: Proc. of INFOCOM, pp. 2000\u20132008 (May 2007)","key":"25_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. Urbana-Champaign, IL (2007)","key":"25_CR10"},{"unstructured":"Li, J., Yang, S., Wang, X., Xue, X., Li, B.: Tree-structured Data Regeneration with Network Coding in Distributed Storage Systems. In: Proc. 17th IEEE International Workshop on Quality of Service, IWQoS (2009)","key":"25_CR11"},{"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: Proc. INFOCOM (2010)","key":"25_CR12","DOI":"10.1109\/INFCOM.2010.5462122"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1109\/JSAC.2010.100216","volume":"28","author":"Y. Hu","year":"2010","unstructured":"Hu, Y., Xu, Y., Wang, X., Zhan, C., Li, P.: Cooperative Recovery of Distributed Storage Systems from Multiple Losses with Network Coding. IEEE Journal on Selected Areas in Communications\u00a028, 268\u2013276 (2010)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"25_CR14","first-page":"113","volume":"4","author":"W. Sun","year":"2013","unstructured":"Sun, W., Wang, Y., Pei, X.: Tree-structured parallel regeneration for multiple data losses in distributed storage systems based on erasure codes. Journal on China Communications\u00a04, 113\u2013125 (2013)","journal-title":"Journal on China Communications"},{"unstructured":"Bhagwan, R., Tati, K., Cheng, Y., Savage, S., Voelker, G.: Total recall: System support for automated availability management. In: Proc. NSDI 2001 (March 2004)","key":"25_CR15"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/0020-0190(78)90030-3","volume":"7","author":"P.R. Camerini","year":"1978","unstructured":"Camerini, P.R.: The min-max spanning tree problem and some extensions. Information Processing Letters\u00a07, 10\u201314 (1978)","journal-title":"Information Processing Letters"},{"unstructured":"Planetlab, \n                  \n                    http:\/\/www.planet-lab.org\/","key":"25_CR17"}],"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-11194-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T15:07:51Z","timestamp":1558969671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11194-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319111933","9783319111940"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11194-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}