计算机工程 ›› 2019, Vol. 45 ›› Issue (4): 13-17,24.doi: 10.19678/j.issn.1000-3428.0050008

• 体系结构与软件技术 • 上一篇    下一篇

基于网络单纯形的虚拟网络映射算法

王志臻1,郑烇1,陈晨1,田洪亮2   

  1. 1.中国科学技术大学 自动化系,合肥 230027; 2.中兴通讯股份有限公司,广东 深圳 518057
  • 收稿日期:2018-01-08 出版日期:2019-04-15 发布日期:2019-04-15
  • 作者简介:王志臻(1993—),男,硕士研究生,主研方向为未来网络、虚拟网络映射;郑烇(通信作者),副教授;陈晨,硕士研究生;田洪亮,博士。
  • 基金项目:

    中兴通讯科研项目“接入网面向内容服务网络的研究项目”(2017ZTE04-09)

Virtual Network Mapping Algorithm Based on Network Simplex

WANG Zhizhen 1,ZHENG Quan 1,CHEN Chen 1,TIAN Hongliang 2   

  1. 1.Department of Automation,University of Science and Technology of China,Hefei 230027,China; 2.Zhongxing Telecommunication Equipment Corporation,Shenzhen,Guangdong 518057,China
  • Received:2018-01-08 Online:2019-04-15 Published:2019-04-15

摘要:

在软件定义网络(SDN)架构中,虚拟网络映射是实现网络虚拟化的关键技术。针对虚拟网络映射算法映射成本高、执行时间长的问题,提出一种虚拟网络映射算法Simplex-VNM。在节点映射阶段,对虚拟节点按照资源需求进行排序,综合考虑节点连通性和映射成本选择映射节点。在链路映射阶段,采用网络单纯形算法求解最小费用流问题。实验结果表明,相比于NA-PVNM和Improved-vnmFlib算法,该算法具有更低的映射成本和更短的运行时间。

关键词: 软件定义网络, 虚拟网络映射, 节点连通性, 网络单纯形, 效用函数, 性能指标

Abstract:

In the Software Defined Network(SDN) architecture,virtual network mapping is the key technology to achieve network virtualization.To solve the problems of high cost of mapping and long running time,a virtual network mapping algorithm named Simplex-VNM is proposed.In the stage of node mapping,virtual nodes are ranked according to resources requirements and search order,then the mapping node is chosen according to the node connectivity and mapping costs.In the stage of link mapping,the process is equivalent to the minimum cost flow problem which can be solved by the network simplex algorithm.Experimental results show that,compared with NA-PVNM and Improved-vnmFlib algorithms,the proposed algorithm has lower mapping cost and shorter running time.

Key words: Software Defined Network(SDN), virtual network mapping, node connectivity, network simplex, utility function, performance index

中图分类号: