摘要
提出了一种基于公平策略的CSFQ(Core-Stateless Fair Queueing)算法,通过动态阈值缓存管理机制,根据缓冲资源的占用率和数据流的到达速率共同决定丢包概率,减少了无谓、不公平丢包现象。根据非响应流UDP数据包空间分布特点,当网络拥塞时增加CHOKe机制对缓存进行管理,有效解决了响应流TCP和非响应流UDP之间的不公平问题。NS仿真实验表明,该算法在现实网络环境下能显著提高缓冲资源的利用率,保证了带宽在TCP、UDP数据流之间的公平分配。
A Core-Stateless Fair Queueing （CSFQ）algorithm based on fair strategy is proposed. With the buffer managed by dynamic threshold algorithm, the packet dropping probability is determined by the flow arrival rate and the utilization of buffer. So that the phenomenon of the fairness of bandwidth unnecessary and unfair packet loss is reduced. According to the distribution of UDP packets, applying CHOKe mechanism to manage the buffer for congested networks can effectively solve the fairness problem between TCP flows and UDP flows. NS Simulation results have shown that the algorithm can improve the buffer＇s utility in dynamic network.
出处
《南京邮电大学学报（自然科学版）》
2007年第2期51-56,共6页
Journal of Nanjing University of Posts and Telecommunications：Natural Science Edition
基金
国家高技术研究发展计划(863计划)(2003AA121560)
江苏省高技术研究计划(BEG200301)资助项目
关键词
核心无状态网络
拥塞控制
公平队列算法
动态阈值算法
core-stateless network
congestion control
fair queuing algorithm
dynamic threshold algorithm
