A Two-Stage VM Migration Framework for Power-Constrained Data Center Load Scheduling

With the rapid growth of data center (DC) energy consumption and the large-scale integration of renewable energy, DCs increasingly face time-varying power upper-bound constraints jointly shaped by grid power supply capability, renewable energy fluctuations, and demand response mechanisms. Meanwhile, DC power consumption exhibits a typical information-load-driven characteristic. The computing tasks hosted by virtual machines affect server-side IT power consumption through resource utilization states such as CPU, memory, disk I/O, and network I/O, and are further coupled with non-IT auxiliary power consumption from cooling, power distribution, and networking equipment. In such cyber–physical operation scenarios, physical-layer sensing data and hypervisor-level virtualization monitoring data jointly provide the state basis for power estimation, power warning, and migration decisions. To address the mismatch between dynamic power upper bounds and time-varying information loads, this paper investigates the information load scheduling problem under constrained power loads and proposes a two-stage virtual machine (VM) migration optimization framework. In the VM selection stage, a Multi-Factor Balanced (MFB) algorithm is designed. By introducing a warning-line trend model based on the arctangent function, MFB comprehensively considers resource utilization, power load variation trends, and service level agreement (SLA) violation levels to dynamically identify candidate VMs for migration. In the VM placement stage, a Multi-Factor Equilibrium Ant Colony Optimization (MFEACO) algorithm incorporating a Random Roulette Wheel (RRW) selection mechanism is proposed. By constructing normalized multi-dimensional equilibrium factors, MFEACO coordinates the trade-off among energy consumption, load balancing, and SLA violations. Simulation experiments are conducted on an improved CloudSim platform using real-world cluster trace data from Google and Alibaba. The results show that, while satisfying dynamic power constraints, the proposed MFB–MFEACO framework achieves a favorable comprehensive trade-off among energy consumption control, SLA violation suppression, and migration reduction. Compared with traditional heuristic methods and a power-constrained genetic algorithm baseline, the proposed framework demonstrates better dynamic adaptability and scheduling stability.