一种基于排队论的主动队列拥塞控制算法  

A New Congestion Control Algorithm for Active Queue Based on Queuing Theory

作　　者：闫英战[1] 田立伟[1] 

机构地区：[1]广东科技学院计算机系,广东东莞523083

出　　处：《华南师范大学学报（自然科学版）》2012年第1期63-66,71,共5页Journal of South China Normal University(Natural Science Edition)

基　　金：国家自然科学基金项目(70571017);广西壮族自治区自然科学基金项目(0728099)

摘　　要：主动队列(AQM)算法存在诸多的不足,如排队延时大、时延抖动性强、数据进队与出队速率不匹配等,从而导致数据的滞留、丢失和振荡.基于此,在BLUE算法的基础上,引入M/M/m(n)排队系统的思想,提出一种新的算法——PBLUE.该算法根据稳定状态下的平衡方程来保证队列长度的稳定性,增加扩充因子调节路由器的缓存来快速恢复丢失的数据.通过仿真实验,改进的算法降低了丢包率,提高了带宽利用率,并稳定了队列长度.AQM algorithm has many deficiencies,such as a large queuing delay,strong delay jitter,the rate of the data into and out the team not matched,and thus it always leads to data retention,loss and oscillation.Based on this,the M/M/m（n） queuing system thought based on the BLUE algorithm is introduced which is called PBLUE.The algorithm ensures the stability of the queue length according to equilibrium equation under stable state.Meanwhile,it increases the expansion factor and adjusts the router＇s cache for quickly recovering of the lost data.In the simulation,the improved algorithm reduced the packet loss rate and increased the bandwidth utilization and stabled the queue length.

关 键 词：排队论 主动队列 BLUE 带宽利用率 丢包率 队列长度 

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