虚拟化移动核心网任务调度算法研究

Task Scheduling in the virtualized core network of wireless communication network

针对虚拟化移动核心网的任务调度问题进行研究。Min-Min调度算法是一个简单、快速、有效的算法,但是它很难满足移动用户对服务质量的要求。提出一种基于虚拟机响应时间的改进算法。在虚拟机与元任务映射过程中,首先按照Min-Min算法进行匹配,然后计算每个与元任务匹配的虚拟机的响应时间,将任务划分为满足响应时限和不满足两部分,对满足响应时限的任务进行调度,为不满足调度响应时限的任务重新分配一个空闲的虚拟机中执行时间最短的虚拟机,尽最大可能避免任务执行时间超出响应时限,导致任务调度失败,进而影响用户满意度。在虚拟机和元任务一定的情况下,分别仿真这两种算法的调度过程,得到任务完成时间、任务成功率和负载情况图,对仿真实验结果进行对比分析。

Researching on the problem of task scheduling in the virtualized mobile core network, we know, Min-Min algo- rithm is easy, flexible and effective. But it cannot meet customers＇ requirement for the qualification of service. An im- proved algorithm based on the virtual machine＇ s response time is proposed in this work. The mapping process is as follows. Firstly, according to M algorithm＇ s principle, the meta-tasks are mapped to the virtual machine. And then, calculate the virtual machine＇ s response time and divide the meta-tasks into two deadline-meeting group and deadline-missed group. The meta-tasks in the deadline-meeting group can be implemented directly. While in the deadline-missed group the meta-tasks will be mapped to an available virtual machines which can meet the deadline. Under the condition of simulated environment with fixed virtual machines and meta-tasks, the experiments of using Min-Min algorithm and improved algorithm are con- ducted to obtain meta-tasks＇ makespans, the rate of success and the load, and comparative analysis with the result.