dc.contributor.author | Yazidi, Anis | |
dc.contributor.author | Ung, Frederik | |
dc.contributor.author | Haugerud, Hårek | |
dc.contributor.author | Begnum, Kyrre Matthias | |
dc.date.accessioned | 2020-02-08T18:19:41Z | |
dc.date.accessioned | 2020-02-18T13:38:46Z | |
dc.date.available | 2020-02-08T18:19:41Z | |
dc.date.available | 2020-02-18T13:38:46Z | |
dc.date.issued | 2019 | |
dc.identifier.citation | Yazidi, Ung, Haugerud, Begnum: Affinity Aware-Scheduling of Live Migration of Virtual Machines Under Maintenance Scenarios.. In: NN N. Proceedings from 2019 IEEE Symposium on Computers and Communications (ISCC2019), 2019. IEEE conference proceedings | en |
dc.identifier.isbn | 978-1-7281-2999-0 | |
dc.identifier.issn | 1530-1346 | |
dc.identifier.issn | 1530-1346 | |
dc.identifier.uri | https://hdl.handle.net/10642/8137 | |
dc.description.abstract | During maintenance and disaster recovery scenarios, Virtual Machine (VM) inter-site migrations usually take place over limited bandwidth–typically Wide Area Network (WAN)–which is highly affected by the amount of inter-VM traffic that becomes separated during the migration process. This causes both a degradation of the Quality of Service (QoS) of inter-communicating VMs and an increase in the total migration time due to congestion of the migration link. We consider the problem of scheduling VM migration in those scenarios. In the first stage, we resort to graph partitioning theory in order to partition the VMs into groups with high intra-group communication. In the second stage, we devise an affinity-based scheduling algorithm for controlling the order of the migration groups by considering their inter-group traffic. Comprehensive real-life experimental results and simulations show that our approach in some cases is able to decrease the volume of separated traffic by a factor larger than 60%. | en |
dc.language.iso | en | en |
dc.publisher | IEEE | en |
dc.relation.ispartofseries | Proceedings of the IEEE Symposium on Computers and Communications;2019 IEEE Symposium on Computers and Communications (ISCC) | |
dc.rights | © 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including
reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists,
or reuse of any copyrighted component of this work in other works. | en |
dc.subject | Live migrations | en |
dc.subject | Graph partitioning | en |
dc.subject | Migration scheduling | en |
dc.subject | Separated traffic | en |
dc.title | Affinity Aware-Scheduling of Live Migration of Virtual Machines Under Maintenance Scenarios. | en |
dc.type | Conference object | en |
dc.date.updated | 2020-02-08T18:19:40Z | |
dc.description.version | acceptedVersion | en |
dc.identifier.doi | https://dx.doi.org/10.1109/ISCC47284.2019.8969573 | |
dc.identifier.cristin | 1792192 | |
dc.source.journal | Proceedings of the IEEE Symposium on Computers and Communications | |
dc.source.isbn | 978-1-7281-2999-0 | |