{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:55:03Z","timestamp":1742939703820,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038686"},{"type":"electronic","value":"9783642038693"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03869-3_24","type":"book-chapter","created":{"date-parts":[[2009,8,22]],"date-time":"2009-08-22T04:04:48Z","timestamp":1250913888000},"page":"228-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Using Multicast Transfers in the Replica Migration Problem: Formulation and Scheduling Heuristics"],"prefix":"10.1007","author":[{"given":"Nikos","family":"Tziritas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thanasis","family":"Loukopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petros","family":"Lampsas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Spyros","family":"Lalis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"24_CR1","first-page":"113","volume":"68","author":"S. Khan","year":"2008","unstructured":"Khan, S., Ahmad, I.: Comparison and Analysis of Ten Static Heuristics-Based In-ternet Data Replication Techniques. JPDC\u00a068(2), 113\u2013136 (2008)","journal-title":"JPDC"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Laoutaris, N., Smaragdakis, G., Oikonomou, K., Stavrakakis, I., Bestavros, A.: Dis-tributed Placement of Service Facilities in Large-Scale Networks. In: Proc. INFOCOM 2007, pp. 2144\u20132152.","DOI":"10.1109\/INFCOM.2007.248"},{"key":"24_CR3","unstructured":"Hall, J., Hartline, J., Karlin, A., Saia, J., Wilkes, J.: On Algorithms for Efficient Data Migration. In: Proc. SODA 2001, pp. 620\u2013629 (2001)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Khuller, S., Kim, Y.A., Wan, Y.C.: Algorithms for Data Migration with Cloning. In: Proc. PODS 2004, pp. 448\u2013461 (2004)","DOI":"10.1137\/S009753970342585X"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Killian, C., Vrable, M., Snoeren, A., Vahdat, A., Pasquale, J.: Brief Announcement: The Overlay Network Content Distribution Problem. In: Proc. PODC 2005, p. 98 (2005)","DOI":"10.1145\/1073814.1073831"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-85451-7_33","volume-title":"Euro-Par 2008 Parallel Processing","author":"N. Tziritas","year":"2008","unstructured":"Tziritas, N., Loukopoulos, T., Lampsas, P., Lalis, S.: Formal Model and Scheduling Heuristics for the Replica Migration Problem. In: Luque, E., Margalef, T., Ben\u00edtez, D. (eds.) Euro-Par 2008. LNCS, vol.\u00a05168, pp. 305\u2013314. Springer, Heidelberg (2008)"},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10723-005-9016-2","volume":"4","author":"F. Desprez","year":"2006","unstructured":"Desprez, F., Vernois, A.: Simultaneous Scheduling of Replication and Computation for Data-Intensive Applications on the Grid. J. Grid Computing\u00a04(1), 19\u201331 (2006)","journal-title":"J. Grid Computing"},{"key":"24_CR8","doi-asserted-by":"publisher","DOI":"10.1201\/9780203497289","volume-title":"Spanning Trees and Optimization Problems","author":"B.Y. Wu","year":"2004","unstructured":"Wu, B.Y., Chao, K.M.: Spanning Trees and Optimization Problems, ch.\u00a07. Chapman & Hall\/CRC, Boca Raton (2004)"},{"key":"24_CR9","unstructured":"Lau, L.C.: An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem. In: Proc. FOCS 2004, pp. 61\u201370 (2004)"},{"key":"24_CR10","unstructured":"http:\/\/www.lindo.com"},{"key":"24_CR11","unstructured":"Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: Boston University Representa-tive Internet Topology Generator (March 2001), \n                    \n                      http:\/\/cs-pub.bu.edu\/brite\/index.htm"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barabasi","year":"1999","unstructured":"Barabasi, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2009 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03869-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T13:37:46Z","timestamp":1589895466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03869-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038686","9783642038693"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03869-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}