基于两次优先级排序的虚拟网络映射算法

A virtual network embedding algorithm based on double priority sorting model

为解决现有的虚拟网络映射算法忽略网络本身属性,仅按照请求到达的顺序分配资源而导致物理资源利用率低的问题,利用时间窗模型,提出了基于两次优先级排序的虚拟网络映射算法。在第一次排序中,粗化虚拟网络请求的同时根据业务类型、属性参数计算请求优先级,初步确定窗口中虚拟网络映射顺序;在第二次排序中,综合考虑链路带宽资源需求和节点途径跳数,通过链路权重来确定优先级,计算最佳映射路径。仿真结果表明,该算法降低了虚拟网络请求的平均等待时间,提高了请求接受率及收益开销比。

In order to solve the problem that the existing virtual network embedding algorithm ignores the attributes of the network itself and allocates resources only according to the order of request arrivals,which leads to the low utilization rate of physical resources,this paper proposes a virtual network embedding algorithm based on double priority sorting by using the time window model.In the first sorting,while coarsening the virtual network request,the priority of the request is calculated according to the service type and attribute parameters,and the mapping order of the virtual network in the window is preliminarily determined.In the second sorting,the priority is determined by the link weight,and the best mapping path is calculated by comprehensively considering the link bandwidth resource demand and node path hops.The simulation results show that the algorithm reduces the average waiting time of virtual network requests,and improves the request receiving rate and the revenue-cost ratio.