Data networks
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Encyclopedia of Optimization
Max-min fairness in multi-commodity flows
Computers and Operations Research
pMapper: Power and Migration Cost Aware Application Placement in Virtualized Systems
Middleware '08 Proceedings of the ACM/IFIP/USENIX 9th International Middleware Conference
Sandpiper: Black-box and gray-box resource management for virtual machines
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multidimensional bin packing algorithms
IBM Journal of Research and Development
A Mathematical Programming Approach for Server Consolidation Problems in Virtualized Data Centers
IEEE Transactions on Services Computing
| Hi-index | 0.00 |
Server consolidation is a vital mechanism in modern data centers in order to minimize expenses with infrastructure. In most cases, server consolidation may require migrating virtual machines between different physical servers. Although the downtime of live-migration is negligible, the amount of time to migrate all virtual machines can be substantial, delaying the completion of the consolidation process. This paper proposes a new server consolidation algorithm, which guarantees that migrations are completed in a given maximum time. The migration time is estimated using the max-min fairness model, in order to consider the competition of migration flows for the network infrastructure. The algorithm was simulated using a real workload and shows a good consolidation ratio in comparison to other algorithms, while also guaranteeing a maximum migration time.