采用基于速率的缓存控制的CSFQ算法  

CSFQ algorithm using rate-based buffer management

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

机构地区：[1]浙江大学信息与电子工程学系,浙江杭州310027 [2]浙江大学计算机科学与工程学系,浙江杭州310027

出　　处：《浙江大学学报（工学版）》2004年第7期851-855,共5页Journal of Zhejiang University：Engineering Science

摘　　要：在核心无状态公平队列调度(CSFQ)算法的基础上,提出了一种采用基于速率的随机早期检测(RED)机制的核心无状态公平队列调度(rr-CSFQ)算法.在路由器中根据网络拥塞状态和数据流到达速率,采用基于速率的随机早期检测机制进行缓存管理.该算法通过调节早期丢包概率,解决了CSFQ时延较长造成的缓存"丢尾"问题,提高了带宽在不同数据流之间分配的公平性.仿真实验证明,该算法在缓存较小的情况下仍能保证带宽在传输控制协议(TCP)数据流和用户数据报协议(UDP)数据流之间的公平分配.A CSFQ (core stateless fair queuing) based algorithm using rate-based buffer management (rr-CSFQ) was presented. On the basis of the estimated packet arrival rate and the status of network congestion in router, the buffer was managed using rate-based random early detection (RED). By adjusting the drop probability, the algorithm solved the problem of drop tail caused by the poor delay characteristic of CSFQ, and improved the fairness in bandwidth allocation between different data flows. Simulation results prove that the algorithm can allocate the bandwidth between TCP (transmission control protocol) flows and UDP (user data protocol) flows in the condition of little buffer.

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

分 类 号：TN915.03[电子电信—通信与信息系统]