基于最小节点负载优先的逻辑承载网构建方法

计算机工程与应用 ›› 2014, Vol. 50 ›› Issue (10): 87-91.

基于最小节点负载优先的逻辑承载网构建方法

李志敏1，2，汤创为1，谭敏生1，王　　舒1，周　　欢1

1.南华大学计算机科学与技术学院，湖南衡阳 421001
2.湖南机电职业技术学院信息工程学院，长沙 410151

出版日期:2014-05-15 发布日期:2014-05-14

Logic carrying network building methods based on minimum node and priority load

LI Zhimin1，2, TANG Chuangwei1, TAN Minsheng1, WANG Shu1, ZHOU? Huan1

1.School of Computer Science and Technology, University of South China, Hengyang, Hunan 421001, China
2.Shool of Information Technology, Hunan Mechanical & Eelectrical Polytechnic, Changsha 410151, China

Online:2014-05-15 Published:2014-05-14

摘要/Abstract

摘要： 针对现有节点映射算法在节点负载不均衡的问题，提出了最小节点负载优先的映射策略（MinNLP），该策略以节点内存负载作为判断节点忙闲度的参数，通过计算物理节点的负载强度，选择具有最小负载和较大剩余资源的物理节点来接受映射，并采用K短路径算法进行节点间的链路映射。实验结果表明，采用基于最小节点负载优先的映射策略并与K短路径思想相结合的方法来构建逻辑承载网比用贪心节点映射算法能得到更高的资源利用率、构建成功率和链路均衡度。

关键词: 最小节点, 负载优先, 逻辑承载网

Abstract: The MinNLP based on minimum node and priority load is proposed aimed at limitation of the existing node mapping algorithm on the node load. The strategy uses node memory load as duty cycles parameter, chooses the minimum load and large residual resources of physical nodes to accept the mapping by calculating the load strength of the physical node, and uses the K shortest path algorithm to link the mapping between the nodes. The experimental results show that the mapping strategy based on minimum node and priority load and combined with K shortest path to construct logical bearer network node can obtain higher resource utilization, build success rate and link balance than the greedy method.

Key words: minimum node, priority load, logical bearer network

李志敏1，2，汤创为1，谭敏生1，王　　舒1，周　　欢1. 基于最小节点负载优先的逻辑承载网构建方法[J]. 计算机工程与应用, 2014, 50(10): 87-91.

LI Zhimin1，2, TANG Chuangwei1, TAN Minsheng1, WANG Shu1, ZHOU? Huan1. Logic carrying network building methods based on minimum node and priority load[J]. Computer Engineering and Applications, 2014, 50(10): 87-91.