节点拓扑感知的高效节能虚拟网络映射算法  

Energy Efficient Virtual Network Mapping Algorithms Based on Node Topology Awareness

作　　者：朱国晖 张茵 刘秀霞 孙天骜 ZHU Guo-hui;ZHANG Yin;LIU Xiu-xia;SUN Tian-ao(School of Communications and Information Engineering,Xi’an University of Posts&Telecommunications,Xi’an 710121,China)

机构地区：[1]西安邮电大学通信与信息工程学院,西安710121

出　　处：《计算机科学》2020年第9期270-274,共5页Computer Science

基　　金：国家自然科学基金(61371087)。

摘　　要：针对现有网络资源过度饱和的问题,提出一种节点拓扑感知的高效节能的虚拟网络映射算法。该算法在节点映射阶段,量化节点映射成本的同时考虑拓扑属性,通过改进后的节点排序方法对每个虚拟节点的候选物理节点进行资源评估,计算最佳映射节点。在链路映射阶段,采用Dijkstra算法,对于每条候选物理链路,综合考虑链路剩余带宽资源、途径节点剩余资源以及跳数,重新计算链路排序值,从而获得高效节能的最佳映射链路。仿真实验数据表明,该算法能有效降低能量成本,节省物理网络资源,在虚拟网络请求接受率和收益开销比等参数指标上具有显著提升。Aiming at the problem of over-saturation of existing network resources,this paper proposes an efficient and energy-saving virtual network mapping algorithm based on node topology awareness.In the node mapping stage,the proposed algorithm quantifies the cost of node mapping and considers the topological attributes.It evaluates the candidate physical nodes of each virtual node through the improved node sorting algorithm,and calculates the best mapping nodes.In the link mapping stage,the Dijkstra algorithm is used to redefine the link by considering the maximum link residual bandwidth resources,the maximum path node residual resources and hops.In order to achieve the goal of energy-saving and high efficiency,the ranking value is used to obtain the effective link with the lowest energy cost.The simulation results show that the proposed sorting method can effectively reduce the energy cost and significantly improve the parameters such as request acceptance rate and revenue-cost ratio of virtual networks.

关 键 词：虚拟网络映射 网络虚拟化 拓扑感知 节点排序 高效节能 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]