摘要
基于网络中输入输出速率和队列长度均可帮助决定更精确丢弃概率的思想,提出了根据输入输出速率和队列长度决定包的丢弃标注概率的AQM算法,即RQC算法.通过仿真将该算法与RED和PI算法进行比较,说明了RQC控制算法的优点.
Based on the idea that both input/output rate and queue length can help the determination of the accurate drop probability in the network, an algorithm called rate/queue controller (RQC) is presented. The method computes drop probability based on input/output rate and queue length. This algorithm is compared with random early detection (RED), The simulation results show some features of RQC algorithm.
出处
《控制与决策》
EI
CSCD
北大核心
2005年第4期478-480,共3页
Control and Decision
基金
教育部博士点基金项目(20020288025)
江苏省自然科学基金项目(BK2004132).
关键词
RQC
主动队列管理
RED
队列长度
输入输出速率
Adaptive systems
Computer simulation
Information management
Probability distributions
Queueing theory