{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:16:39Z","timestamp":1761401799526},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,12,10]],"date-time":"2015-12-10T00:00:00Z","timestamp":1449705600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"crossref","award":["2014CB340303"],"award-info":[{"award-number":["2014CB340303"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"The Program of National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61402514","61402490"],"award-info":[{"award-number":["61402514","61402490"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Scientific Research Program of Hunan Provincial Education Department","award":["12b012"],"award-info":[{"award-number":["12b012"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s11227-015-1586-6","type":"journal-article","created":{"date-parts":[[2015,12,10]],"date-time":"2015-12-10T18:20:18Z","timestamp":1449771618000},"page":"50-64","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Towards a delivery scheme for speedup of data backup in distributed storage systems using erasure codes"],"prefix":"10.1007","volume":"75","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":"Yuxing","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changjian","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guofeng","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,10]]},"reference":[{"key":"1586_CR1","unstructured":"Beaver D, Kumar S, Li HC, Sobel J, Vajgel P (2010) Finding a needle in Haystack: Facebooks photo storage. In: Proceedings of the 9th USENIX conference on operating systems design and implementation (OSDI), vol 10, pp 1\u20138"},{"key":"1586_CR2","unstructured":"EMC (2013) World\u2019s data more than doubling every two years\u2014driving big data opportunity, new IT roles. \n                              http:\/\/www.emc.com\/about\/news\/press\/2011\/20110628-01.htm\n                              \n                           . Accessed 7 Aug 2013"},{"key":"1586_CR3","unstructured":"Seagate (2012) IDC says worlds storage is breaking Moores law, more than doubling every two years. \n                              http:\/\/enterprise.media.seagate.com\/2011\/06\/inside-it-storage\/idc-says-worlds-storage-is-breaking-moores-law-more-than-doubling-every-two-years\/\n                              \n                           . Accessed 24 Sept 2012"},{"key":"1586_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/1165389.945450","volume":"37","author":"S Ghemawat","year":"2003","unstructured":"Ghemawat S, Gobio H, Leung S (2003) The google file system. ACM Sympos Oper Syst Princ 37:29\u201343","journal-title":"ACM Sympos Oper Syst Princ"},{"key":"1586_CR5","unstructured":"Borthakur D (2015) The Apache Hadoop distributed file system. \n                              http:\/\/hadoop.apache.org\/hdfs\/\n                              \n                           . Accessed 17 Nov 2013"},{"key":"1586_CR6","unstructured":"Hastorun D, Jampani M, Kakulapati G et al (2007) Dynamo: Amazons highly available key-value store. In: ACM SIGOPS operating systems review, vol 41, pp 205\u2013220"},{"key":"1586_CR7","unstructured":"Lakshman A, Malik P (2011) The Apache Cassandra project. \n                              http:\/\/cassandra.apache.org\/\n                              \n                           . Accessed 21 May 2013"},{"issue":"7","key":"1586_CR8","doi-asserted-by":"publisher","first-page":"966","DOI":"10.1016\/j.future.2010.11.017","volume":"27","author":"S Liu","year":"2011","unstructured":"Liu S, Schulze JP, Herr L, Weekley JD, Zhu B, van Osdol N, Plepys D, Wan M (2011) CineGrid exchange: a workow-based peta-scale distributed storage platform on a high-speed network. Future Gener Comput Syst 27(7):966\u2013976","journal-title":"Future Gener Comput Syst"},{"key":"1586_CR9","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/356989.357007","volume":"35","author":"J Kubiatowicz","year":"2000","unstructured":"Kubiatowicz J, Bindel D, Chen Y, Czerwinski S, Eaton P, Geels D, Gummadi R, Rhea S, Weatherspoon H, Weimer W, Wells C, Zhao B (2000) Oceanstore: an architecture for global-scale persistent storage. SIGPLAN Not 35:190\u2013201","journal-title":"SIGPLAN Not"},{"key":"1586_CR10","doi-asserted-by":"crossref","unstructured":"Duminuco A, Biersack E (2009) A practical study of regenerating codes for peer-to-peer backup systems. In: Proceedings of the IEEE international conference on distributed computing systems (ICDCS), pp 376\u2013384","DOI":"10.1109\/ICDCS.2009.14"},{"issue":"6","key":"1586_CR11","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.1016\/j.future.2013.02.009","volume":"29","author":"L Pamies-Juarez","year":"2013","unstructured":"Pamies-Juarez L, Datta A, Oggier FE (2013) In-network redundancy generation for opportunistic speedup of data backup. Future Gener Comput Syst 29(6):1353\u20131362","journal-title":"Future Gener Comput Syst"},{"key":"1586_CR12","doi-asserted-by":"crossref","unstructured":"Pamies-Juarez L, Datta A, Oggier FE (2013) Data insertion and archiving in erasure-coding based large-scale storage systems. In: Proceedings of the international conference on distributed computing and internet technology (ICDCIT), pp 47\u201368","DOI":"10.1007\/978-3-642-36071-8_4"},{"issue":"3","key":"1586_CR13","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/TST.2013.6522585","volume":"18","author":"J Li","year":"2013","unstructured":"Li J, Li B (2013) Erasure coding for cloud storage systems: a survey. Tsinghua Sci Technol 18(3):259\u2013272","journal-title":"Tsinghua Sci Technol"},{"key":"1586_CR14","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"I Reed","year":"1960","unstructured":"Reed I, Solomon G (1960) Polynomial codes over certain nite elds. J Soc Ind Appl Math 8:300\u2013304","journal-title":"J Soc Ind Appl Math"},{"key":"1586_CR15","unstructured":"Acedanski S, Deb S, Medard M, Koetter R (2005) How good is random linear coding based distributed networked storage? In: Proceedings of the 1st workshop on network coding, theory and applications, pp 1\u20136"},{"key":"1586_CR16","doi-asserted-by":"crossref","unstructured":"Dimakis A, Godfrey P, Wainwright M, Ramchandran K (2007) Network coding for distributed storage systems. In: Proceedings of the INFOCOM, pp 2000\u20132008","DOI":"10.1109\/INFCOM.2007.232"},{"key":"1586_CR17","doi-asserted-by":"crossref","unstructured":"Oggier F, Datta A (2011) Self-repairing homomorphic codes for distributed storage systems. In: Proceedings of the international conference on computer communications (INFOCOM), pp 1215\u20131223","DOI":"10.1109\/INFCOM.2011.5934901"},{"key":"1586_CR18","doi-asserted-by":"crossref","unstructured":"Lee S-J, Banerjee S, Sharma P, Yalagandula P, Basu S (2008) Bandwidth-aware routing in overlay networks. In: Proceedings of the 27th conference on computer communications, pp 1732\u20131740","DOI":"10.1109\/INFOCOM.2008.235"},{"key":"1586_CR19","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1137\/S1056263493260386","volume":"8","author":"B Rustem","year":"1998","unstructured":"Rustem B, Nguyen Q (1998) An algorithm for the inequality-constrained discrete minimax problem. SIAM J Optim 8:265\u2013283","journal-title":"SIAM J Optim"},{"key":"1586_CR20","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/TCS.1979.1084701","volume":"CAS\u201326","author":"RK Brayton","year":"1979","unstructured":"Brayton RK, Director SW, Hachtel GD, Vidigal L (1979) A new algorithm for statistical circuit design based on quasi-Newton methods and function splitting. IEEE Trans Circuits Syst CAS\u201326:784\u2013794","journal-title":"IEEE Trans Circuits Syst"},{"key":"1586_CR21","doi-asserted-by":"crossref","unstructured":"Fletcher R (2010) The sequential quadratic programming method. Nonlinear optimization. In: Lecture notes in mathematics, pp 165\u2013214","DOI":"10.1007\/978-3-642-11339-0_3"},{"issue":"1","key":"1586_CR22","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1137\/0715011","volume":"15","author":"C Charalambous","year":"1978","unstructured":"Charalambous C, Conn AR (1978) An efficient method to solve the minimax problem directly. SIAM J Numer Anal 15(1):162\u2013187","journal-title":"SIAM J Numer Anal"},{"key":"1586_CR23","unstructured":"Planetlab (2015). \n                              http:\/\/www.planet-lab.org\/\n                              \n                           . Accessed 12 Mar 2012"},{"key":"1586_CR24","doi-asserted-by":"crossref","unstructured":"Lee S-J, Sharma P, Banerjee S, Basu S, Fonseca R (2005) Measuring bandwidth between planetlab nodes. In: Passive and active network measurement, pp 292\u2013305","DOI":"10.1007\/978-3-540-31966-5_23"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-015-1586-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-015-1586-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-015-1586-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-015-1586-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T05:47:15Z","timestamp":1589608035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-015-1586-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,10]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["1586"],"URL":"https:\/\/doi.org\/10.1007\/s11227-015-1586-6","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,10]]},"assertion":[{"value":"10 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}