论文部分内容阅读
提出了一种基于最大独立链路集的快速随机虚拟网络映射算法.基于图论中的匹配理论重新定义了带权图中匹配的概念,并命名为独立链路集,在映射独立链路集中的虚拟链路时首先将物理链路按照资源可用性进行筛选,然后随机映射到单一物理链路上,以此提高虚拟网络映射成功率及减少链路映射消耗,同时随机映射能保证物理网络的负载均衡.仿真实验表明,该算法能有效减少链路映射的消耗和提高虚拟网络接受率.
A fast random virtual network mapping algorithm based on the largest independent link set is proposed.According to the matching theory in graph theory, the concept of matching in weighted graph is redefined and named as independent link set.In the mapping independent link set Of virtual links, the physical links are screened according to resource availability and then randomly mapped to a single physical link so as to improve the virtual network mapping success rate and reduce the link mapping consumption, and at the same time, the random mapping can ensure the load of the physical network The simulation results show that this algorithm can effectively reduce the consumption of link mappings and improve the acceptance rate of virtual networks.