满足链路约束的拓扑聚集度虚拟网络映射算法  

Virtual network embedding algorithm based on topology convergence-degree meeting link constraints

作　　者：梁召伟 吕光宏[1] 王坤[1] 

机构地区：[1]四川大学计算机学院,成都610065

出　　处：《四川大学学报（自然科学版）》2015年第1期69-73,共5页Journal of Sichuan University(Natural Science Edition)

基　　金：国家"863"高技术发展计划项目(2008AA01Z105)

摘　　要：高效的虚拟网络映射算法能提高网络收益,降低物理资源的消耗.假如一个虚拟网络能够被满足映射,那么它对物理节点资源的消耗是固定的,对资源消耗的总大小取决于链路映射.为减少链路资源消耗,相邻的虚拟节点在被映射后应该是接近的.本文提出基于满足链路约束的拓扑聚集度映射算法.该算法在计算汇聚度时考虑节点间的链路请求,是一阶段映射算法.此外,本文根据图的广度优先搜索对虚拟节点排名,使连续映射的虚拟节点有较高的关联性.仿真实验表明,所提出的算法提高了长期网络收益和收益花费比.Effective virtual network embedding algorithm can increase network revenue and reduce the consumption of physical resources.If a virtual network can be meet the mapping,it is fixed for the con-sumption of physical node source,the sum of resource consumption depends on the paths embedded by virtual links.In order to reduce the link resource consumption,virtual nodes connecting directly to each other should be adjacent when mapped onto the substrate network.The paper proposes an algorithm based on topology convergence-degree meeting link constraints.The algorithm considers the link con-straint between nodes when computing nodes convergence-degree.It belongs to one stage mapping algo-rithm.In addition,virtual nodes are ranked through the Breadth-First-Search of graph,so the virtual nodes mapped continuously have high correlation.Simulation results show that,the proposed algorithm improves the long-term revenue and revenue/cost （R/C）ratio.

关 键 词：聚集度 广度优先搜索 虚拟网络映射 

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