| 基于加权公正队列的QoS路由选择算法 |
| |
| 引用本文： | 吕国英,刘泽民.基于加权公正队列的QoS路由选择算法[J].北京邮电大学学报,2001,24(1):56-60. |
| |
| 作者姓名： | 吕国英 刘泽民 |
| |
| 作者单位： | 北京邮电大学电信工程学院， 北京 100876 |
| |
| 摘 要： | 基于Bellman-Ford最短路短径算法提出了一种修改的QoS路由选择算法，给出了仿真结果，并与其它QoS路由选择算法进行了比较，进一步表明了所提出算的有效性。
|
| 关 键 词： | 路由选择算法 加权公正队列 服务质量 因特网 |
| 文章编号： | 1007-5321(2001)01-0056-05 |
| 修稿时间： | 2000年10月27 |
QoS Routing Algorithm Based on Weighted Fair Queuing Service Discipline |
| |
| LU Guo ying,LIU Ze min.QoS Routing Algorithm Based on Weighted Fair Queuing Service Discipline[J].Journal of Beijing University of Posts and Telecommunications,2001,24(1):56-60. |
| |
| Authors: | LU Guo ying LIU Ze min |
| |
| Abstract: | With weighted fair queuing service discipline, the complexity of the QoS routing problem could be reduced to that of shortest path (SP)routing without any QoS constraints, and thus the multiple QoS constrained route could be searched in polynomial time. Based the discussion of the complexity reductions and a modified version of Bellman Ford shortest path, we present a QoS routing algorithm,We give the simulation results and compared to the existing QoS routing algorithms, and thus show the validity of QRBF routing algorithm. |
| |
| Keywords: | shortest path QoS routing algorithm weighted fair queuing QoS constraints |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
