摘要
RED算法与DECbit机制是具有代表性的两种拥塞控制算法,其共同的问题是在计算平均队列长度困难。提出一种新的基于中间节点的拥塞避免机制SECN,它通过输入队列长度和吞吐量在早期检测到拥塞,不需要计算平均队列长度。之后,选择占用资源最多的连接进行通告,让发送端缩小发送窗口。SECN算法容易实现,具有较好的公平性,不会发生许多连接同时缩小发送窗口导致吞吐量下降的全局同步现象。仿真结果也证明具有较高的吞吐量与小的响应时间。
We firstly introduced two representative arithmetic RED and DECbit and interpret the difficulty in calculating the average queue length. Then presents a new scheme: SECN. The routers detect incipient congestion by compute the input queue length and throughout. Then choose the connection that occupies the most bandwidth to notify, requiring the sender to decrease the congestion window. Our scheme is easy-use, fair and no global synchronization of many connections decreasing their window at the same time. The simulation result also shows it has high throughout and low response time.
出处
《计算机应用研究》
CSCD
北大核心
2005年第7期251-252,260,共3页
Application Research of Computers
