可生存性虚拟网络映射算法的研究  

A Survey on Survivable Virtual Network Embedding Algorithm

作　　者：黄丽萍 杨龙祥[1] HUANG Li-ping;YANG Long-xiang(School of Communication and Information Engineering,Nanjing University of Posts and Telecommunications,Nanjing 210003,China)

机构地区：[1]南京邮电大学通信与信息工程学院,江苏南京210003

出　　处：《计算机技术与发展》2018年第7期144-148,共5页Computer Technology and Development

基　　金：国家自然科学基金(61372124);国家"973"重点基础研究发展计划项目(2013CB329104)

摘　　要：网络虚拟化是未来网络的关键技术之一。网络虚拟化技术能共享底层网络资源,在此基础上建立多个相互隔离的虚拟网络。每个虚拟网络由虚拟节点和节点之间的虚拟链路组成。在网络虚拟化环境下,如何有效地将虚拟网络映射到底层网络上,即虚拟网络映射问题。由于底层网络易出现故障,从而导致映射到底层网络上的虚拟网络不能继续工作。如何从底层网络故障中快速恢复过来,并且最大可能地降低损失,已成为当前研究虚拟网络映射问题的重点。为了全面了解可生存性虚拟网络映射问题,从问题定义、故障原因、映射目标等方面对可生存性虚拟网络映射算法进行了综述。在按照算法不同特性进行分类和讨论的基础上,对几种典型的算法进行比较分析,据此指出未来的研究趋势。Network virtualization,as one of the key technologies of the future network,can share substrate network resources,and build multiple isolated virtual networks based on that.Every virtual network is composed of virtual nodes and virtual links.In the environment of network virtualization,efficient mapping of virtual networks onto a substrate network is known as the virtual network ending problem.Because the substrate network is failure-prone,affecting all the VNs using it.Howto quickly recover from the underlying network fault and minimize the loss has become the focus of current study on virtual network mapping.To fully understand the problem of survivable virtual network mapping,we present a survey of current SVNE algorithms from the aspects of problem definition,cause of fault and embedding objects.Based on the classification and discussion of different characteristics of the algorithm,we make a comparison and analysis for several typical algorithms and point out the future research trends.

关 键 词：网络虚拟化 虚拟网络 虚拟网络映射 映射算法 可生存性算法 

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