摘要
针对当前虚拟网络映射存在局部区域的节点和链路负载压力过大、节点和相邻链路传输时产生报文抖动和资源浪费等问题,设计一种基于全网负载均衡的虚拟网络映射算法。将节点和相邻链路资源差异性考虑到节点映射中,对k最短路径算法的邻接矩阵进行优化,将矩阵转换成反映链路负载均衡的映射矩阵。通过对节点和链路资源的动态调整,分析虚拟网络映射时出现的瓶颈问题。实验结果表明,与随机算法和贪婪算法相比,该算法具有更好的虚拟网络映射率和网络负载均衡性。
As the existing nodes and links of local areas are overweight,the phenomenon of packet jitter and resource waste generates when packets transmits between nodes and adjacent links. A virtual network embedding algorithm is designed for load balancing of the whole network in this paper. It considers the differences of nodes and adjacent links resources and put the differences into the node embedding process. The k shortest path algorithm of the adjacency matrix is optimized. The matrix is transformed into the new matrix which could reflect link load balancing. Finally,it analyzes the bottleneck problem of virtual network embedding by dynamically adjusting the resources of nodes and links.Experimental results show that the method could achieve better virtual network embedding ratio and network load balancing than randomized algorithm and greedy algorithm.
作者
高斐
陈德礼
洪家军
于智
田甜
GAO Fei;CHEN Deli;HONG Jiajun;YU Zhi;TIAN Tian(College of Information Engineering, Putian University, Putian, Fujian 351100, China;College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China;Shanghai Agency of National Audit Office, Shanghai 200051, China)
出处
《计算机工程》
CAS
CSCD
北大核心
2018年第5期146-154,共9页
Computer Engineering
基金
国家自然科学基金(61502417)
福建省自然科学基金(2016J01759)
关键词
虚拟网络映射
负载均衡
抖动
网络瓶颈
k最短路径算法
virtual network mapping
load balance
jitter
network bottleneck
k shortest path algorithm
