基于测量的主动队列管理算法  

Measurement-based active queue management algorithm

作　　者：简贵胄[1] 葛宁[1] 冯重熙[1] 

机构地区：[1]清华大学电子工程系,北京100084

出　　处：《清华大学学报（自然科学版）》2004年第4期522-524,529,共4页Journal of Tsinghua University(Science and Technology)

基　　金：国家自然科学基金资助项目(69896242)

摘　　要：针对RED(RandomEarlyDetection)队列管理算法不能实现业务流之间带宽公平共享,提出了基于测量的主动队列管理算法(MBAQM)。这种算法采用基于测量和预测的方式估计不同业务流的输入速率,并根据队列大小计算出新到来包的丢弃概率,在维持较少的流状态情况下,通过队列的丢弃机制,实现了不同速率输入业务流之间的链路公平共享。通过对参数的调整还可以实现优先带宽分配机制。该文从理论上说明了该算法能够保证各业务流近似公平地共享输出链路带宽,同时给出相应的仿真结果。A new active queue management mechanism, named the measurement-based active queue management, was developed to eliminate the unfair bandwidth sharing in the random early detection method. The current flow rate is estimated from measurements, with the rate dynamically adjusted according to the queue length and the discard possibility for an incoming packet based on a comparison of the two rate values. Dropping precedence can be calculated for all flows by regulating the parameters. Theoretical analysis and simulations show that the mechanism provides approximately fair bandwidth sharing among all input flows.

关 键 词：带宽公平分配 主动队列管理算法 带宽分配机制 拥塞控制 丢弃机制 输入速率 

分 类 号：TN911[电子电信—通信与信息系统]