基于跳数约束的网络动态路由算法  

A dynamic routing algorithm based on jump-bounded

作　　者：郭迎[1] 徐凌[2] 王江[2] 

机构地区：[1]黑龙江省政务信息化管理服务中心,哈尔滨150001 [2]中国电子科技集团公司第四十九研究所,哈尔滨150001

出　　处：《信息技术》2009年第7期214-218,共5页Information Technology

摘　　要：阐述了网络动态负载平衡和跳数约束条件下寻找最小费用路径的算法，算法中引入了网络中边和点的流量因子的概念，然后利用计算出来的流量因子，定义出每条边的动态费用，这种动态费用包含了网络负载流量的信息。通过综合出来的动态费用，利用一种具有跳数约束计算最小路径的启发式算法，找出最优的可行路径。A kind of dynamic load balance algorithm which is constrained by jump numbers is discussed in this paper. This algorithm can find minimum costs with these constrains. The concept of flux-factor is introduced in this algorithm. It also defines the dynamic-cost which includes the information of the network load flux with the flux-factor. The optimum feasible paths are found through calculating the dynamic-costs and using a heuristics algorithm of searching the minimum cost path which is considered with jump numbers constrains.

关 键 词：负载平衡 最大流 路由 时延 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]