Show simple item record

dc.contributor.authorYazidi, Anis
dc.contributor.authorUng, Fredrik
dc.contributor.authorHaugerud, Hårek
dc.contributor.authorBegnum, Kyrre
dc.identifier.citationYazidi A, Ung, Haugerud H, Begnum KM. Effective live migration of virtual machines using partitioning and affinity aware-scheduling. Computers & electrical engineering . 2018;69:240-255en
dc.description.abstractDuring 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 simulations and real-life experimental results show that our approach is able to decrease the volume of separated traffic by a factor larger than 30%.en
dc.relation.ispartofseriesComputers and Electrical Engineering;volume 69 (2018)
dc.subjectLive Migrationen
dc.subjectGraph Partitioningen
dc.subjectMigration Schedulingen
dc.subjectSeparated Trafficsen
dc.titleEffective live migration of virtual machines using partitioning and affinity aware-schedulingen
dc.typeJournal articleen
dc.typePeer revieweden
dc.source.journalComputers & electrical engineering

Files in this item


This item appears in the following Collection(s)

Show simple item record
Except where otherwise noted, this item's license is described as