Abstract:

Aiming at the problem of link resource limitation and network survivability in virtual network mapping process, a node mapping scheme based on node extended resources and a virtual network remapping scheme are proposed respectively. In order to solve the problem of insufficient resources in the link mapping phase after node mapping, this article selects a physical node with a large node expansion resource as the bearer node to ensure the reliability and efficiency of the link mapping, and the link mapping phase adopts a mapping scheme based on the minimum link cost to obtain a highly reliable mapping. Based on this, a remapping strategy is adopted for network failure, and the failed nodes are quickly remapped to the candidate node set to ensure the continuity of the virtual network service. The performance of several algorithms are compared by simulation and the results show that the proposed algorithm achieves good results in virtual network mapping success rate, virtual network recovery success rate and resource load utilization.

Key words: virtual network mapping, node extension resources, link cost, network failure, remapping

摘要：

针对虚拟网络映射过程中链路资源受限和网络生存性问题，分别提出一种基于节点扩展资源的节点映射方案和一种虚拟网络重映射方案。为克服节点映射后链路映射阶段的资源不足问题，通过将节点扩展资源大的节点作为承载节点以确保链路映射的可靠性和高效性，链路映射阶段采用一种基于最小链路代价的映射方案以获得高可靠映射，在此基础上针对网络故障采取一种重映射策略，将失效节点迅速重映射至候选节点集中以确保虚拟网络服务的连续性。通过仿真对几种算法性能进行对比，结果表明所提算法在虚拟网络映射成功率、虚拟网络恢复成功率和资源负载利用率等方面均取得较好结果。

关键词: 虚拟网络映射, 节点扩展资源, 链路代价, 网络故障, 重映射