计算机工程 ›› 2018, Vol. 44 ›› Issue (9): 107-112.doi: 10.19678/j.issn.1000-3428.0048076

• 移动互联与通信技术 • 上一篇    下一篇

基于邻接节点与拓扑结构感知的虚拟网络映射算法

谢枫,孟相如,赵志远,苏玉泽   

  1. 空军工程大学 信息与导航学院,西安 710077
  • 收稿日期:2017-07-24 出版日期:2018-09-15 发布日期:2018-09-15
  • 作者简介:谢枫(1993—),男,硕士研究生,主研方向为网络虚拟化;孟相如,教授、博士生导师;赵志远、苏玉泽,博士研究生。
  • 基金项目:

    国家自然科学基金(61401499)。

Virtual Network Mapping Algorithm Based on Adjacent Node and Topology Awareness

XIE Feng,MENG Xiangru,ZHAO Zhiyuan,SU Yuze   

  1. College of Information and Navigation,Air Force Engineering University,Xi’an 710077,China
  • Received:2017-07-24 Online:2018-09-15 Published:2018-09-15

摘要:

现有虚拟网络映射算法的节点映射和链路映射间关联性较差,且链路映射路径较长,导致算法请求接受率和收益开销比均较低。为此,提出一种基于邻接节点与拓扑结构感知的虚拟网络映射算法。在考虑节点位置约束的条件下,将节点资源度、接近中心度与广度优先搜索算 法相结合对节点映射过程进行改进,同时利用链路带宽需求与最短路径算法实现链路映射。仿真结果表明,与G-VNM、TCF-VNM、TAS-VNM算法相比,该算法能够缩短链路映射长度,提高请求接受率和收益开销比。

关键词: 虚拟网络映射, 节点资源度, 接近中心度, 位置约束, 邻接节点感知, 拓扑结构感知

Abstract:

The existing Virtual Network(VN) mapping algorithms have poor correlation between node mapping and link mapping,and the longer link mapping path leads to lower request acceptance rate and lower revenue overhead.To solve this problem,a VN mapping algorithm based on adjacent node and topology awareness is proposed.Considering node location constraint,node resource degree,closeness centrality and breadth first search algorithm are combined to improve node mapping.At the same time,link map is implemented by link bandwidth requirement and shortest path algorithm.Simulation results show that,compared with G-VNM,TCF-VNM and TAS-VNM algorithm,the proposed algorithm can shorten the proposed link mapping length and improve the request acceptance rate and the return cost ratio.

Key words: Virtual Network(VN) mapping, node resource degree, closeness centrality, location constraint, adjacent node awareness, topology awareness

中图分类号: