基于层次最短路径的FallBack路由算法  

FallBack Routing Algorithm Based on Hierarchical Shortest Path

作　　者：沈艳琳[1] 李立夏[2] 

机构地区：[1]华中师范大学物理学院,武汉430000 [2]武汉数字工程研究所,武汉430074

出　　处：《计算机与数字工程》2007年第4期23-26,共4页Computer & Digital Engineering

摘　　要：通常,在多约束条件下的Qos路由是一种NP完全问题。下文首先分析了约束条件的网络特征,然后讨论了基于FallBack算法的有关问题。FallBack算法是满足多Qos路由选择的基本算法,是D ijkstra算法的一种改进;有人提出FallBack+算法对其进行了改进,从而可以排除FallBack算法设计者根据经验排序约束条件的问题,并且可以有效利用网络资源;本文则是对FallBack+算法的进一步改进,在保留了原算法上述优点的同时加快了算法的收敛速度。In general,finding a feasible route subject to multiple additive Qos constraints is a NP-complete problem.In this paper,we first analyze the constraints and their properistics that can reflect the basic characteristics of a network and support the fundamental Qos requirements.FallBack(FB) Algorithm,which derives from Dijkstra strategy,is a fundamental algorithm mainly focusing on multiple-Qos router-control;another algorithm called FallBack+ is improved on FallBack and it can solve the problem that FB algorithm sorts the constrains by designer's experience also it can make full use of the network resources.Now we continually improve on FallBack+ and make it convege fast as well as make it hold the advantages of FallBack+ algorithm.

关 键 词：QOS FallBack算法 FallBack^+算法 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]