Using Multicast Transfers in the Replica Migration Problem: Formulation and Scheduling Heuristics

Authors:
Nikos Tziritas;Thanasis Loukopoulos;Petros Lampsas;Spyros Lalis
Affiliations:
Dept. of Computer and Communication Engineering, Univ. of Thessaly, Volos, Greece 38221;Dept. of Informatics and Computer Technology, Technological Educational Institute (TEI) of Lamia, Lamia, Greece 35100;Dept. of Informatics and Computer Technology, Technological Educational Institute (TEI) of Lamia, Lamia, Greece 35100;Dept. of Computer and Communication Engineering, Univ. of Thessaly, Volos, Greece 38221
Venue:
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Year:
2009

Citing 6
Cited 0

On algorithms for efficient data migration

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for data migration with cloning

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Brief announcement: the overlay network content distribution problem

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Comparison and analysis of ten static heuristics-based Internet data replication techniques

Journal of Parallel and Distributed Computing
Formal Model and Scheduling Heuristics for the Replica Migration Problem

Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

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.