Abstract
Performing replica migrations in the minimum possible time, also called the Replica Migration Problem (RMP), is crucial in distributed systems using replication. In this paper we tackle RMP when multicast transfers are available. We give a formal problem statement as a Mixed Integer Programming problem. It turns out that the problem is NP-hard. Therefore, we resolve to scheduling heuristics in order to find good solutions. Through simulations we identify different tradeoffs between performance and execution time and conclude on the most attractive approaches.
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.: Comparison and Analysis of Ten Static Heuristics-Based In-ternet Data Replication Techniques. JPDC 68(2), 113–136 (2008)
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–2152.
Hall, J., Hartline, J., Karlin, A., Saia, J., Wilkes, J.: On Algorithms for Efficient Data Migration. In: Proc. SODA 2001, pp. 620–629 (2001)
Khuller, S., Kim, Y.A., Wan, Y.C.: Algorithms for Data Migration with Cloning. In: Proc. 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. PODC 2005, p. 98 (2005)
Tziritas, N., Loukopoulos, T., Lampsas, P., Lalis, S.: Formal Model and Scheduling Heuristics for the Replica Migration Problem. In: Luque, E., Margalef, T., BenÃtez, D. (eds.) Euro-Par 2008. LNCS, vol. 5168, pp. 305–314. Springer, Heidelberg (2008)
Desprez, F., Vernois, A.: Simultaneous Scheduling of Replication and Computation for Data-Intensive Applications on the Grid. J. Grid Computing 4(1), 19–31 (2006)
Wu, B.Y., Chao, K.M.: Spanning Trees and Optimization Problems, ch. 7. Chapman & Hall/CRC, Boca Raton (2004)
Lau, L.C.: An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem. In: Proc. FOCS 2004, pp. 61–70 (2004)
Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: Boston University Representa-tive 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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tziritas, N., Loukopoulos, T., Lampsas, P., Lalis, S. (2009). Using Multicast Transfers in the Replica Migration Problem: Formulation and Scheduling Heuristics. In: Sips, H., Epema, D., Lin, HX. (eds) Euro-Par 2009 Parallel Processing. Euro-Par 2009. Lecture Notes in Computer Science, vol 5704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03869-3_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-03869-3_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03868-6
Online ISBN: 978-3-642-03869-3
eBook Packages: Computer ScienceComputer Science (R0)