Secure Virtual Machine Migration using Ant Colony Algorithm

Heuristic algorithms are used solve the VM consolidation. One of the well-known approaches to solve this issue is bin packing method. This method is considered as NP-hard. There are quite number of other heuristics algorithm available to address this issue. This problem can be handled effortlessly with one dimensional bin packing m. In Bin Packing there are few methods used to pack the empty bins efficiently. First Fit (II) Bin packing algorithm is one of most popular and efficient method to pack the empty bins. Here, FF algorithm packs available items into first bin where it aptly accommodates. Best Fit algorithm places an item into a maximum load instead of placing in the first bin like First Fit algorithm. These two methods are enhanced by making small alteration in the algorithm which are named as First Fit Decreasing (HID) method and Best Fit Decreasing (BFD) method. These methods could not be implemented straightaway for VM consolidation. This must me altered appropriately before applying for this issue. In addition, consider that physical machines (PM) don't have any virtual machines (VM) before executing the migration algorithm and also the utilization of the datacenters is managed by the number of VIVI's request and server's request. The energy consumption of the VM's is majorly considers the CPU utilization instead of bandwidth and memory. The authors concentrate on CPU utilization rate to minimize the energy consumption.