基于拥塞预规避控制的QoS路由选择算法研究  

Research on QoS Routing Algorithm Based on Congestion Preavoidance Control

作　　者：吴清亮[1,2] 陶军[1,2] 姚婕 

机构地区：[1]教育部计算机网络和信息集成支撑技术重点实验室,江苏南京210096 [2]东南大学计算机科学与工程系,江苏南京210096

出　　处：《小型微型计算机系统》2005年第6期941-944,共4页Journal of Chinese Computer Systems

基　　金：江苏省自然科学基金(BK2001205)资助;国家自然科学基金重大研究计划(90104009)资助

摘　　要：现有网络常用的路由算法(比如链路状态路由算法)都不具有拥塞预规避控制能力.提出了一种基于拥塞预规避控制的QoS路由算法(QRCP).该算法对业务流量进行了更为合理的分配,避免或尽量减少对将来业务流的连接请求的影响,最终减少网络的拥塞概率.通过实验仿真,结果表明,该算法在拥塞避免与网络效益上,比现有的最宽-最短(WSP)与最短-最宽(SWP)路径算法具有明显的优越性.Commonly used routing algorithms, such as link state routing (LS), have no congestion pre-avoidance mechanism. This paper presents a QoS routing algorithm based on congestion pre-avoidance (QRCP) which can distribute flows more rationally. Based on the idea that a newly routed tunnel must follow a route that can avoid or reduce the impact on future demands, the algorithm can finally cut down the congestion rate of the network. We examine via simulation the system performances using various routing algorithms. Simulation results show that QRCP algorithm obviously performs better than widest-shortest path (WSP) and shortest-widest path (SWP) on congestion avoidance as well as network efficiency.

关 键 词：拥塞预规避 QOS路由 阻塞率 网络效益 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]