{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:37:44Z","timestamp":1743039464549,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540854500"},{"type":"electronic","value":"9783540854517"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-85451-7_33","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T13:15:29Z","timestamp":1219151729000},"page":"305-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Formal Model and Scheduling Heuristics for the Replica Migration Problem"],"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":[{"doi-asserted-by":"crossref","unstructured":"Khan, S., Ahmad, I.: A Semi-Distributed Axiomatic Game Theoretical Mechanism for Replicating Data Objects in Large Distributed Computing Systems. In: Proc. 21st Int. Parallel and Distributed Processing Symp (IPDPS 2007), Long Beach, California (March 2007)","key":"33_CR1","DOI":"10.1109\/IPDPS.2007.370279"},{"doi-asserted-by":"crossref","unstructured":"Loukopoulos, T., Lampsas, P., Ahmad, I.: Continuous Replica Placement Schemes in Distributed Systems. In: Proc. 19th ACM International Conference on Supercomputing (ACM ICS), Boston, MA (June 2005)","key":"33_CR2","DOI":"10.1145\/1088149.1088187"},{"unstructured":"Desprez, F., Vernois, A.: Simultaneous Scheduling of Replication and Computation for Data-Intensive Applications on the Grid. Report RR2005-01, INRIA, France (January 2005)","key":"33_CR3"},{"issue":"12","key":"33_CR4","doi-asserted-by":"publisher","first-page":"1401","DOI":"10.1109\/TPDS.2006.171","volume":"17","author":"N. Laoutaris","year":"2006","unstructured":"Laoutaris, N., Smaragdakis, G., Bestavros, A., Matta, I., Stavrakakis, I.: Distributed Selfish Replication. In IEEE Trans. on Parallel and Distributed Systems (TPDS)\u00a017(12), 1401\u20131413 (2006)","journal-title":"In IEEE Trans. on Parallel and Distributed Systems (TPDS)"},{"unstructured":"Hall, J., Hartline, J., Karlin, A., Saia, J., Wilkes, J.: On algorithms for efficient data migration. In: Proc. of the twelfth annual ACM-SIAM Symposium on Discrete algorithms (SODA 2001), Washington D.C., United States, pp. 620\u2013629 (2001)","key":"33_CR5"},{"doi-asserted-by":"crossref","unstructured":"Khuller, S., Kim, Y., Wan, Y.: Algorithms for data migration with cloning. In: Proc. of the twenty-second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2004), pp. 448\u2013461 (2004)","key":"33_CR6","DOI":"10.1145\/773153.773156"},{"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. ACM Symp. on Principles of Distributed Computing (PODC), Las Vegas, NV, July 2005, p. 98 (2005)","key":"33_CR7","DOI":"10.1145\/1073814.1073831"},{"doi-asserted-by":"crossref","unstructured":"Loukopoulos, T., Tziritas, N., Lampsas, P., Lalis, S.: Implementing Replica Placements: Feasibility and Cost Minimization. In: Proc. 21st Int. Parallel and Distributed Processing Symp (IPDPS 2007), Long Beach, California (March 2007)","key":"33_CR8","DOI":"10.1109\/IPDPS.2007.370316"},{"key":"33_CR9","volume-title":"Computers and Intractability","author":"J. Garey","year":"1979","unstructured":"Garey, J., Johnson, D.: Computers and Intractability. W. H. Freeman and Co., NY (1979)"},{"unstructured":"http:\/\/www.lindo.com","key":"33_CR10"},{"unstructured":"Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: Boston University Representative Internet Topology Generator (March 2001), \n                    \n                      http:\/\/cs-pub.bu.edu\/brite\/index.htm","key":"33_CR11"},{"key":"33_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"},{"unstructured":"G\u00c9ANT2, Backbone Network Topology (January 2008), \n                    \n                      http:\/\/www.geant2.net\/upload\/pdf\/PUB-07-179_GN2_Topology_Jan_08_final.pdf","key":"33_CR13"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2008 \u2013 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85451-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T13:18:31Z","timestamp":1589894311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85451-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540854500","9783540854517"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85451-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}