一种改进的RED算法及其稳定性分析  

AN IMPROVED RED ALGORITHM AND ITS STABILITY ANALYSIS

作　　者：陈剑勇[1] 胡存英[1] 

机构地区：[1]深圳大学计算机与软件学院,广东深圳518060

出　　处：《计算机应用与软件》2010年第5期15-19,33,共6页Computer Applications and Software

基　　金：国家自然科学基金项目(60703112)

摘　　要：随机早期检测RED(Random early detection)用于解决网络拥塞问题,然而由于TCP-RED本身具有非线性特性,导致了系统的不稳定和服务质量性能下降。基于离散的TCP-RED动力模型,从平均队列长度的角度分析了RED算法线性稳定的条件,提出了一种自适应地调整控制参数的改进算法。模拟结果表明,所提出的改进算法在稳定性方面优于Adaptive RED和gentle RED算法。RED（random early detection） is utilized to solve the problem of Internet congestion.However,the nonlinear character of TCP-RED itself results in the instability of system and the degradation of QoS（Quality of Service）.Based on a discrete-time dynamic TCP-RED model,in this paper we analyse the conditions of linear stability of RED algorithm in terms of average queue size,and propose an improved RED algorithm,which can adaptively adjust the control parameters.Simulation results show that the proposed improved algorithm outperforms the Adaptive RED and gentle RED algorithms in terms of stability.

关 键 词：TCP-RED 平均队列 线性稳定 混沌 

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