北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2006, Vol. 29 ›› Issue (1): 88-91.doi: 10.13190/jbupt.200601.88.yaol

• 综述 • 上一篇    下一篇

一种保护TCP流的AFRED缓存管理算法

姚 凌1, 孙文波2, 纪 红1, 乐光新1   

  1. 1.北京邮电大学 数字通信与信息网络实验室, 北京 100876
    2.中国公安部信息通信局, 北京 100075
  • 收稿日期:2004-12-07 出版日期:2006-02-28 发布日期:2006-02-28
  • 通讯作者: 姚 凌 E-mail:Yaoling@m165.com
  • 作者简介:姚 凌(1977—),女,博士生,E-mail: Yaoling@m165.com.

An AFRED Buffer Management Scheme for Protecting TCP Flows

YAO Ling1, SUN Wen-bo2, JI Hong1, YUE Guang-xin1   

  1. 1.Laboratory of Digital Communication and Information Networks, Beijing University of Posts and Telecommunications, Beijing 100876, China
    2.The Ministry of Public Security of P R China, Beijing 100876, China
  • Received:2004-12-07 Online:2006-02-28 Published:2006-02-28
  • Contact: YAO Ling E-mail:Yaoling@m165.com

摘要:

在存在用户数据报协议业务流的情况下, 为了有效地保护传输控制协议(TCP)流, 并保证业务流的公平性,提出了一种自适应的流随机早期检测(FRED)缓存管理算法AFRED(Adaptive FRED). 新算法通过对分组丢弃门限和丢弃概率的动态调节,保护了TCP流,提高了系统的公平性和带宽利用的有效性. 分析和仿真表明, 算法的复杂度与FRED相近,但是能获得更好的性能.

关键词: 随机早期检测, 流随机早期检测, 缓存管理

Abstract:

An adaptive fair queue management algorithm-adaptive flow random early detection (AFRED) is proposed to protect transfor control protocal(TCP) flows in the presence of user data protocal (UDP) flows and to provide flow fairness. By dynamically varying the threshold of each flow, that could be allowed into the buffer and the drop probability, the algorithm can protect TCP flows effectively and improve the fairness of the system and the efficiency of the bandwidth utilization. The analysis and simulations indicate that the implementation complexity of AFRED is comparable to flow random early detection (FRED), but its performance is better than FRED.

Key words: random early detection, flow random early detection, buffer management

中图分类号: