一种链路压力相关的虚拟网络嵌入算法

A Link Stress-related Virtual Network Embedding Algorithm

针对传统虚拟网络嵌入算法造成底层网络链路压力过高的问题,提出一种新的虚拟网络嵌入算法。在节点嵌入阶段,通过节点的连通度和带宽属性确定节点的重要度,并筛选出第一个虚拟节点进行嵌入,以该虚拟节点的嵌入位置为中心确定其他虚拟节点的嵌入范围,在链路嵌入过程中采用预请求资源方法在k条最短路径中查找合适的嵌入路径。实验结果表明,与决定性节点嵌入k阶最短路径和决定性节点嵌入分割路径2种算法相比,该算法在嵌入成本、成本/收益、平均链路压力、虚拟网络请求接受率等方面表现更优。

Aiming at the problem of high link stress in substrate network caused by traditional Virtual Network Embedding （VNE） algorithm, a new VNE algorithm is proposed. In the stage of node embedding, the importance degree of node in network is gotten by its connectivity and bandwidth properties, and the first virtual node is selected to embed. To determine the embedding scope of other virtual nodes, the place of the first embedding virtual node is determined as the centre. The appropriate path is selected within k-shortest paths by pre-request resource method. Experimental results show that compared with the deterministic node embedding with k-shortest path link and that with splittable link,this algorithm has better performance in embedding cost, cost/revenue, average link stress and virtual network request acceptance ratio.