基于动态最短路径策略的多QoS路由算法

Multiple QoS Router-Control Algorithm Based on Dynamic Shortest Path Strategy

对FallBack算法进行改进,先利用动态最短路径算法计算出最短路径,然后对路径进行QoS需求检查,最后进行调整,得到动态环境下具有多QoS保证的最优路径。该算法在一定程度上克服了路由信息不能得到及时更新所引起的问题,根据网络拓扑结构变化和流量的变化动态调整路由选择,从而更好地保证了服务质量。最后将此策略引入到OSPF路由协议中,提出一种综合性的路由更新机制,在尽可能最少的网络负载下满足QOS对链路状态信息的要求,从而在一定程度上扩展了OSPF路由协议的服务质量。

In order to meet the needs of different applications in network,multiple constraint condition QoS routing problem become the key to information transmission of network multimedia technology.FallBack algorithm,which derives from Dijkstra strategy,is a basic algorithm mainly focusing on multiple QoS router-control.This paper introduces a improvement of FallBack algorithm,the first use of dynamic shortest path algorithm to calculate the shortest path,and then check the QoS requirements,and finally adjusted to obtain dynamic environment to ensure the optimal path with multiple QoS guarantee.The algorithm to a certain extent overcame the problems that caused by routing information cannot get the update,according to network topology and traffic changes dynamically adjust the routing so as to better ensure the quality of service.Finally this strategy into OSPF routing protocol,and puts forward a kind of comprehensive routing updates mechanism.At least as much as possible to meet the QOS of network load on the link state information request,which extends to some extent the quality of service routing protocol OSPF.