摘要
提出了一种基于最大独立链路集的快速随机虚拟网络映射算法.基于图论中的匹配理论重新定义了带权图中匹配的概念,并命名为独立链路集,在映射独立链路集中的虚拟链路时首先将物理链路按照资源可用性进行筛选,然后随机映射到单一物理链路上,以此提高虚拟网络映射成功率及减少链路映射消耗,同时随机映射能保证物理网络的负载均衡.仿真实验表明,该算法能有效减少链路映射的消耗和提高虚拟网络接受率.
A random virtual network embedding algorithm based on maximum independent link set was proposed. The algorithm redefines the concept of matching in the graph theory for the weighted graph and names it as independent link set. In order to improve the success rate of the virtual network embedding and reduce consumption of link embedding,in the stage of embedding virtual links in the independent link set,physical links are filtered by the availability of resources,and then the virtual link is randomly embedded to a single physical link. Randomly embedding can guarantee the load balancing for physical network. Simulation results show that the algorithm can effectively reduce the link consumption and improve virtual network acceptance rate.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2014年第S1期8-11,共4页
Journal of Beijing University of Posts and Telecommunications
基金
国家高技术研究发展计划项目(2013AA013502)
中央高校基本科研业务费专项资金项目(BUPT 2013RC1103)
关键词
网络虚拟化
虚拟网络映射
匹配
独立链路集
随机
负载均衡
network virtualization
virtual network embedding
matching
independent link set
ran-dom
load balancing
