论文部分内容阅读
现有网络常用的路由算法(比如链路状态路由算法)都不具有拥塞预规避控制能力.提出了一种基于拥塞预规避控制的QoS路由算法(QRCP).该算法对业务流量进行了更为合理的分配,避免或尽量减少对将来业务流的连接请求的影响,最终减少网络的拥塞概率.通过实验仿真,结果表明,该算法在拥塞避免与网络效益上,比现有的最宽-最短(WSP)与最短-最宽(SWP)路径算法具有明显的优越性.
The existing routing algorithms (such as link-state routing algorithms) used in the existing networks do not have the ability of congestion avoidance control.This paper proposes a QoS routing algorithm based on congestion avoidance control (QRCP) Reasonable allocation to avoid or minimize the impact of the future business flow connection request, and ultimately reduce the network congestion probability.Through the experimental simulation, the results show that the algorithm in the congestion avoidance and network efficiency, than the existing widest-shortest (WSP) and shortest-widest (SWP) path algorithms have obvious advantages.