摘要
随着 Internet的迅猛发展 ,在 Internet中实现高效、公平、可扩展的业务流控制正变得日趋重要 .CSFQ ( Core-Stateless Fair Queueing)算法无需核心路由器为每一业务流保存状态但仍可实现相当程度的资源公平共享 .本文首先归纳总结了 CSFQ算法 ,然后给出了最大最小公平准则下公平共享速率的理想值、分析并揭示了 CSFQ算法存在的病态情形 ,最后对 CSFQ进行了改进 ,使得改进后的
Provision of efficient, fair and scalable traffic flow control is becoming increasingly important in the Internet. The Core-Stateless Fair Queueing(CSFQ) algorithm can achieve reasonably fair bandwidth allocations while not requiring per-flow state in core routers. In this paper, we first summarize the CSFQ algorithm. Then we derive the theoretical fair share rate based on max-min fairness criterion, we show that there are pathological cases in the CSFQ algorithm when we evaluate it theoretically. Finally, we present the improvement on the CSFQ. Our improvement includes self-tuning adaptive control for the estimation of fair share rate and self-compensating mechanism for dropping packets due to pessimistic estimation.
出处
《小型微型计算机系统》
CSCD
北大核心
2002年第12期1476-1479,共4页
Journal of Chinese Computer Systems
基金
国家重点基础研究发展规划 973项目 ( G19980 30 40 3)资助
中国科学院高水平大学建设资助项目( KYZ2 70 6)资助
