A Strength Pareto Evolutionary Algorithm for live migration of multiple interdependent virtual machines in data centers
Data(s) |
01/11/2015
|
---|---|
Resumo |
Although live VM migration has been intensively studied, the problem of live migration of multiple interdependent VMs has hardly been investigated. The most important problem in the live migration of multiple interdependent VMs is how to schedule VM migrations as the schedule will directly affect the total migration time and the total downtime of those VMs. Aiming at minimizing both the total migration time and the total downtime simultaneously, this paper presents a Strength Pareto Evolutionary Algorithm 2 (SPEA2) for the multi-VM migration scheduling problem. The SPEA2 has been evaluated by experiments, and the experimental results show that the SPEA2 can generate a set of VM migration schedules with a shorter total migration time and a shorter total downtime than an existing genetic algorithm, namely Random Key Genetic Algorithm (RKGA). This paper also studies the scalability of the SPEA2. |
Formato |
application/pdf |
Identificador | |
Publicador |
Springer |
Relação |
http://eprints.qut.edu.au/87490/1/255.pdf DOI:10.1007/978-3-319-26535-3_14 Sarker, Tusher Kumer & Tang, Maolin (2015) A Strength Pareto Evolutionary Algorithm for live migration of multiple interdependent virtual machines in data centers. Neural Information Processing: 22nd International Conference, ICONIP 2015, Proceedings Part II [Lecture Notes in Computer Science, Volume 9490], pp. 114-121. |
Direitos |
Copyright 2015 Springer |
Fonte |
School of Electrical Engineering & Computer Science; Science & Engineering Faculty |
Palavras-Chave | #live VM migration #migration time #downtime #strength pareto evolutionary algorithm |
Tipo |
Journal Article |