| 高吞吐量的核心无状态公平队列算法 |
| |
| 引用本文： | 谢立峰,叶澄清,顾伟康.高吞吐量的核心无状态公平队列算法[J].计算机工程,2005,31(5):125-127,167. |
| |
| 作者姓名： | 谢立峰 叶澄清 顾伟康 |
| |
| 作者单位： | 1. 浙江大学信电系,杭州,310027
2. 浙江大学计算机系,杭州,310027 |
| |
| 摘 要： | 提出了一种优化的核心无状态公平队列凋度算法(xCSFQ)，在CSFQ的基础上，根据缓冲区占用率和数据流到达速率决定丢包概率，缓存管理上采用基于CHOKC原理的机制进行缓存管理，解决了CSFQ链路利用率低的问题，提高了带宽在UDP流和TCP流之间分配的公平性，最后对算法进行了仿真分析。
|
| 关 键 词： | 公平队列算法 缓冲区管理 核心无状态网络 |
| 文章编号： | 1000-3428(2005)05-0125-03 |
A Core Stateless Fair Queuing Algorithm with High Throughput |
| |
| XIE Lifeng,YE Chengqing,GU Weikang.A Core Stateless Fair Queuing Algorithm with High Throughput[J].Computer Engineering,2005,31(5):125-127,167. |
| |
| Authors: | XIE Lifeng YE Chengqing GU Weikang |
| |
| Affiliation: | XIE Lifeng1,YE Chengqing2,GU Weikang1 |
| |
| Abstract: | 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. |
| |
| Keywords: | Fair queuing algorithm Buffer management Core stateless network |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
