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