QoS动态路由算法分析  

Analysis of QoS Dynamic Routing Algorithm

作　　者：王燕琳[1] 孙雨耕[1] 薛希俊[1] 

机构地区：[1]天津大学电气工程与能源学院,天津300072

出　　处：《计算机工程》2000年第12期64-65,68,共3页Computer Engineering

摘　　要：保证服务质量(QoS)的通信是当今网络发展的必然趋势之一。动态路由算法可根据网络拓扑和负载情况实时为业务流选择路径，其合理性和有效性对于网络资源的优化使用及网络运行性能起着重要作用。文章阐述了QoS动态路由算法的研究内容：链路量度的选择、选路原则、改进Bellman-Ford算法和Dijkstra算法以及算法的触发，并总结了QoS路由算法目前存在的几个问题。One trend of Internet development is to guarantee quality of service(QoS). A dynamic routing algorithm can select traffic flow routes on-line according to network's topology and loading condition. So, the rational and effective dynamic routing algorithms are vital to the performance and resource optimization of networks. Research activities on QoS dynamic routing algorithms are analysed as follows: the selection of link metric, routing scheme, improved Bellman-Ford algorithm, Dijksra algorithm and the trigger of algorithms. Moreover, dynamic routing problems to be solved are presented in this paper.

关 键 词：计算机网络 QOS 动态路由 路由选择算法 

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