高吞吐量的核心无状态公平队列算法  

A Core Stateless Fair Queuing Algorithm with High Throughput

作　　者：谢立峰[1] 叶澄清[2] 顾伟康[1] 

机构地区：[1]浙江大学信电系,杭州310027 [2]浙江大学计算机系

出　　处：《计算机工程》2005年第5期125-127,167,共4页Computer Engineering

摘　　要：提出了一种优化的核心无状态公平队列调度算法(xCSFQ),在CSFQ的基础上,根据缓冲区占用率和数据流到达速率决定丢包概率,缓存管理上采用基于CHOKe原理的机制进行缓存管理,解决了CSFQ链路利用率低的问题,提高了带宽在UDP流和TCP流之间分配的公平性,最后对算法进行了仿真分析。The problem of providing a fair allocation between responsible flows (such as TCP) and no-responsible flows (such as UDP)is investigated. A core stateless fair queuing algorithm with high throughput is presented. In the algorithm, the packet is dropped with a probability, which is determined by the estimated packet arrival rate and the utilization of buffer. In the algorithm, a mechanism based on CHOKe is used in the buffer management. The algorithm can protect TCP flows against UDP flows and improves the fairness of bandwidth allocation. The algorithm performs better than CSFQ for getting high throughput. Simulation shows that it is effective and efficient.

关 键 词：公平队列算法 缓冲区管理 核心无状态网络 

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