CAJ | 학술논문

在云数据中心网络内，虚拟机（Virtual machine ，VM ）被动态创建和下线，这就导致资源碎片不被后续VM请求所利用。为解决上述问题，以最小化使用服务器数量为目标的服务器整合技术被提出。虽然这种方法可以在某一时间段内减少资源碎片，但却付出了较大的VM迁移代价。因此本文提出了一种基于预测的先应式碎片整理算法，在减少无效VM 迁移的同时，将资源碎片重新整合为可用的连续资源，从而最大化VM收益。文中对此问题进行了数学定义，随后设计了启发式方法获取近似最优解。仿真结果表明，所提算法能够获取最大收益，并能够大幅度降低VM迁移成本。
재운수거중심망락내，허의궤（Virtual machine ，VM ）피동태창건화하선，저취도치자원쇄편불피후속VM청구소이용。위해결상술문제，이최소화사용복무기수량위목표적복무기정합기술피제출。수연저충방법가이재모일시간단내감소자원쇄편，단각부출료교대적VM천이대개。인차본문제출료일충기우예측적선응식쇄편정리산법，재감소무효VM 천이적동시，장자원쇄편중신정합위가용적련속자원，종이최대화VM수익。문중대차문제진행료수학정의，수후설계료계발식방법획취근사최우해。방진결과표명，소제산법능구획취최대수익，병능구대폭도강저VM천이성본。
In a cloud data center network ,virtual machines (VMs) can be dynamically created and termi‐nated ,causing the fact that fragmented resources cannot be further utilized .To solve the problem ,the server consolidation is proposed to minimize the number of active servers .Although the approach can re‐duce resource fragmentation at particular time ,it may be over aggressive at the price of too frequent VM migration .Therefore ,a novel provident resource defragmentation algorithm is proposed to reduce the un‐necessary VM migration and maxmize the profit by re‐consolidating fragments into available continuous resources .An optimization problem is formulated ,and a heuristic method for obtaining near‐optimal re‐sults is developed .Extensive numerical results confirm that the framework provides the highest profit and significantly reduces the VM migration cost .