針對(duì)主動(dòng)隊(duì)列管理算法普遍存在的公平性問題，提出基于速率的公平隊(duì)列管理算法RFED。該算法根據(jù)分組的到達(dá)速率調(diào)節(jié)丟包率，將隊(duì)列的到達(dá)速率控制在鏈路的服務(wù)速率下，根據(jù)非響應(yīng)流UDP 數(shù)據(jù)包空間分布特點(diǎn)，對(duì)非響應(yīng)流實(shí)施有效的懲罰，以保證不同數(shù)據(jù)流之間的公平。NS 仿真實(shí)驗(yàn)表明，該算法在公平性、穩(wěn)定性等方面效果良好，無需進(jìn)行復(fù)雜的參數(shù)配置，容易在現(xiàn)有網(wǎng)絡(luò)中實(shí)施。
關(guān)鍵詞：主動(dòng)隊(duì)列管理；擁塞控制；公平隊(duì)列

【Abstract】According to the fairness problem in Active Queue Management(AQM) algorithm, this paper proposes a novel fair AQM algorithm
namely RFED. By imposing effective punishment upon non-responsive flow, it ensures the fairness of different flow. And it maintains queue arrival
rate at or below queue service rate through more reasonable dropping probability according to the arrival rate. Simulation results show that the
algorithm outperforms RED, CSFQ and CHOKe in stabilizing instantaneous queue length and fairness.
【Key words】Active Queue Management(AQM); congestion control; fair queue