一种基于排队论的关键流路由调整算法  

Key flow routing adjustment algorithm based on queueing theory

作　　者：李泽平[1,2] 卢显良[1] 李梁[1] 

机构地区：[1]电子科技大学计算机科学与工程学院,成都610054 [2]贵州大学理学院,贵阳550025

出　　处：《仪器仪表学报》2010年第5期1167-1172,共6页Chinese Journal of Scientific Instrument

基　　金：贵州省自然科学基金(编号:黔基合计字(2003)3069号)资助项目

摘　　要：在分析现有路由调整算法的基础上,提出一种基于排队论的关键流路由调整新算法(KFRA)。首先,应用排队论建立最优流分配模型,模型既给出最优流分配的计算方法,也给出路径的最优流分配与各路径最大可用带宽之间的关系。然后基于模型实现KFRA算法,其计算复杂度为O(nlogn),低于大部分路由调整算法。理论分析和仿真实验结果表明在不同的网络环境下,提出的算法能在保证时延的基础上对待调整的流进行全局最优分配,最小化流传输的端到端时延,提高流传输的质量,与同类算法相比有更好的性能。On the basis of analyzing current routing adjustment methods for load balancing, a novel key flow routing adjustment （KFRA） algorithm is proposed. Firstly, the optimal flow allocation model is established by applying queueing theory, which gives the method of computing the optimal flow allocation, and the relation between optimal flow allocation of path and maximal available bandwidths of path set. Then, KFRA algorithm based on the model is proposed. Finally, theoretical analysis proves that the computational complexity of KFRA is O（nlogn）, which is better than that of a majority of the methods nowadays. The simulation results using NS2 shows that the proposed KFRA algorithm can optimally allocate flows among multiple paths with delay guaranteed, minimize flow transmission delay, maximize transmission quality, and achieve a better performance than the other related algorithms.

关 键 词：路由调整 网络管理 流分配 服务质量 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]