一种基于流的数目的主动队列管理机制  

A Flow Number Based Active Queue Management Mechanism

作　　者：钱进[1] 贺贵明[1] 王凯[1] 

机构地区：[1]武汉大学计算机学院,武汉430079

出　　处：《计算机工程与应用》2005年第25期136-140,共5页Computer Engineering and Applications

基　　金：国家自然科学基金资助项目(编号:90204008)

摘　　要：提出了一种基于流的数目的主动队列管理机制。主要思想是根据上一个采样间隔末的流的到达速率,每流在队列中所占的比率,估计流的数目,以流的数目来决定数据包的丢弃概率,达到稳定队列长度和实现公平性的目的。仿真结果证明在多种网络条件下,算法能够实现稳定队列长度和流公平性两个目的。This paper presents a flow number based active queue management mechanism.This mechanism predicts the incoming and flow number in the next sample intervals according to the past data.And then with the queue length of each flow at the end of last interval,predicted incoming and outgoing data and expected queue length drop probability in this interval is calculated.The goal of this mechanism is to achieve both stabilized queue length and per-flow fairness.Through ns-2 simulation,we have compared FNE against FRED and SRED and obtained satisfying results.

关 键 词：主动队列管理(AQM) 稳定队列长度 公平性 流的数目 

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