Abstract
Replication of the most popular objects is often used in distributed data provision systems to reduce access time and improve availability. In fact, a given replica placement scheme may have to be redefined as object popularity changes. Given two replica placement schemes X old and X new, the Replica Migration Problem (RMP) is to compute a schedule of replica transfers and deletions that lead from X old to X new in the shortest time possible. In this paper, we provide a rigorous problem formulation and prove that even for trivial cases RMP is intractable. We also propose a set of heuristics and evaluate them for different scenarios using simulations.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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)
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)
Desprez, F., Vernois, A.: Simultaneous Scheduling of Replication and Computation for Data-Intensive Applications on the Grid. Report RR2005-01, INRIA, France (January 2005)
Laoutaris, N., Smaragdakis, G., Bestavros, A., Matta, I., Stavrakakis, I.: Distributed Selfish Replication. In IEEE Trans. on Parallel and Distributed Systems (TPDS) 17(12), 1401–1413 (2006)
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–629 (2001)
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–461 (2004)
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)
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)
Garey, J., Johnson, D.: Computers and Intractability. W. H. Freeman and Co., NY (1979)
Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: Boston University Representative Internet Topology Generator (March 2001), http://cs-pub.bu.edu/brite/index.htm
Barabasi, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science 286, 509–512 (1999)
GÉANT2, Backbone Network Topology (January 2008), http://www.geant2.net/upload/pdf/PUB-07-179_GN2_Topology_Jan_08_final.pdf
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tziritas, N., Loukopoulos, T., Lampsas, P., Lalis, S. (2008). Formal Model and Scheduling Heuristics for the Replica Migration Problem. In: Luque, E., Margalef, T., Benítez, D. (eds) Euro-Par 2008 – Parallel Processing. Euro-Par 2008. Lecture Notes in Computer Science, vol 5168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85451-7_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-85451-7_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85450-0
Online ISBN: 978-3-540-85451-7
eBook Packages: Computer ScienceComputer Science (R0)