摘要
针对在虚拟网络映射过程中物理资源碎片化导致嵌入请求被拒绝,从而降低物理资源利用率的问题,提出一种基于最优子网的虚拟网络映射算法,通过优化的重边匹配算法,合并符合约束条件的虚拟节点,同时粗化网络拓扑,运用广度优先搜索算法创建候选物理子网集合,将粗化后的虚拟网络请求映射至最优子网。仿真结果表明,该算法能够减小链路映射跳数,提升虚拟网络请求接受率和收益开销比。
Aiming at the problems that the fragmentation of physical resources results in the rejection of the embedding requests and reduces utilization of physical resources during the virtual network mapping,a Virtual Network Mapping(VNM)algorithm based on the optimal subnet is proposed.It coarsens network topology using Band Heavy Edge Matching(B-HEM)algorithm by merging the virtual nodes that meet the constraints.A set of candidate physical subnet is created by the Breadth First Search(BFS)algorithm,and the coarsened virtual network request is mapped to the optimal subnet.Simulation results show that the proposed algorithm can reduce the hops of link mapping and improve the request acceptance ratio and the revenue/cost ratio of virtual networks.
作者
朱国晖
康潇轩
雷兰洁
ZHU Guohui;KANG Xiaoxuan;LEI Lanjie(School of Communications and Information Engineering,Xi’an University of Posts and Telecommunications,Xi’an 710061,China)
出处
《计算机工程》
CAS
CSCD
北大核心
2019年第10期8-12,共5页
Computer Engineering
基金
国家自然科学基金(61371087)
关键词
虚拟网络映射
资源碎片化
最优子网
重边匹配
网络拓扑粗化
广度优先搜索
Virtual Network Mapping(VNM)
fragmentation of resources
optimal subnet
Heavy Edge Matching(HEM)
network topology coarsening
Breadth First Search(BFS)
