A 2-Layers Virtual Network Mapping Algorithm Based on Node Attribute and Network Simplex

Quan Zheng

doi:10.1109/ACCESS.2018.2883251

2018-01-01

DOI：10.1109/ACCESS.2018.2883251

原文链接

查看原文

摘要

En 中文

Network virtualization is one of the most important techniques to overcome Internet ossification, which can enable multiple networks to run on a common infrastructure. Virtual network mapping is a key process of network virtualization to efficiently map virtual network onto the substrate network within constraints of node and link resource. However, previous VNM heuristic algorithms completely separate the node mapping stage from link mapping stage and ignore the effect of link mapping results on physical node ranking, which may lead to higher mapping cost and distributed distribution of virtual nodes on the substrate network. The shortest path algorithm is used at most to resolve virtual link mapping which results in longer mapping time. To address these issues, a two-layer virtual network mapping algorithm named simplex-VNM is proposed based on node attribute and network simplex in this paper. In node mapping layer, a new node ranking approach which considers topology attributes, global network resources, and mapped physical node information provides candidate nodes and node mapping cost for link mapping layer. Then, in link mapping layer, network simplex algorithm which has smaller time complexity compared to traditional shortest path algorithms has been introduced to find the optimal link mapping solution under the result of node mapping layer. Finally, according to the results of two layers, the virtual node and relevant links will be mapped with minimal total mapping cost. Extensive simulation results have demonstrated that our proposed method behaves better than four other algorithms that consider node attribute and use shortest path algorithm in terms of total mapping cost and mapping time.

Keyword:

Virtual network mapping

network simplex

node attribute

node-ranking approach