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

【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.更多还原