应用Best-Effort思想的公平排队算法  

Fair Queueing Using Best-Effort Method

作　　者：李旻[1] 贺亮[1] 高传善[1] 

机构地区：[1]复旦大学软件学院,上海200433

出　　处：《小型微型计算机系统》2004年第12期2222-2225,共4页Journal of Chinese Computer Systems

基　　金：华为公司科技基金资助

摘　　要：研究了以 CSFQ为主要代表的核心路由器中无状态公平排队技术 ,针对其在吞吐量等性能上的不足 ,提出了一种结合 CSFQ与 FIFO两种技术的公平排队算法 CSFQ -β.算法能够达到近似公平的带宽分配 ,在保持了 CSFQ的其它优点基础上 ,更进一步地改善了总体吞吐量 ,减少了包的转发时延 ,并更有效地利用了链路带宽 。The Core-Stateless Fair Queuing algorithm is a routing mechanism designed to achieve fair bandwidth allocation with minimal implementation complexity. But there are still several possibilities for improving CSFQ. This paper presented a new algorithm called CSFQ-β, which combined CSFQ with FIFO. This algorithm improves the performance of CSFQ at some aspects such as throughput yet still achieves approximately bandwidth allocation. It decreases the transfer delay and uses the bandwidth more efficiently.

关 键 词：公平排队 主动队列管理 拥塞 CSFQ FIFO 

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