基于加权公正队列的QoS路由选择算法

北京邮电大学学报 ›› 2001, Vol. 24 ›› Issue (1): 56-60.

基于加权公正队列的QoS路由选择算法

吕国英, 刘泽民

北京邮电大学电信工程学院, 北京 100876

收稿日期:2000-10-27 出版日期:2001-01-10
作者简介:吕国英(1965—),男,山东省距野人,博士生.
基金资助:
原邮电部重点资助项目

QoS Routing Algorithm Based on Weighted Fair Queuing Service Discipline

LU Guo-ying, LIU Ze-min

Telecommunication Engineering School, Beijing University of Posts and Telecommunications, Beijing 100876, China

Received:2000-10-27 Online:2001-01-10

摘要/Abstract

摘要： 基于Bellman-Ford最短路径算法提出了一种修改的QoS路由选择算法,给出了仿真结果,并与其它QoS路由选择算法进行了比较,进一步表明了所提出算法的有效性.

关键词: 最短路径, QoS路由选择算法, 加权公正队列, QoS限制

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.

Key words: shortest path, QoS routing algorithm, weighted fair queuing, QoS constraints

中图分类号:

TN913.1

吕国英, 刘泽民. 基于加权公正队列的QoS路由选择算法[J]. 北京邮电大学学报, 2001, 24(1): 56-60.

LU Guo-ying, LIU Ze-min. QoS Routing Algorithm Based on Weighted Fair Queuing Service Discipline[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2001, 24(1): 56-60.

[1]	王新胜, 喻明艳. 工艺变化条件下互连延时最小缓冲器插入方法[J]. 北京邮电大学学报, 2014, 37(3): 93-97,108.
[2]	李道丰，杨义先，谷利泽，孙斌. 采用可净化签名的OSPF协议安全保护机制[J]. 北京邮电大学学报, 2011, 34(3): 79-83.
[3]	卢放鸣. 资源分区算法应用于接入网设计（增刊）[J]. 北京邮电大学学报, 2007, 29(s1): 118-121.
[4]	张静1, 胡捍英1, 程楠2, 童珉1. IPv6网络中OSPFv3洪泛多QoS度量的性能[J]. 北京邮电大学学报, 2007, 30(6): 46-50.
[5]	赵会群1，2 , 孙晶1. Internet异构路由建模与冲突分析[J]. 北京邮电大学学报, 2007, 30(2): 46-49.
[6]	樊明, 马跃, 蒋砚军. 一种支持QoS的OSPF扩展算法[J]. 北京邮电大学学报, 2001, 24(2): 65-68.