随机早期检测算法公平性的改进  

Improvement of Fairness of Random Early Detection Algorithm

作　　者：杜玉林[1] 张术平[1] 王炜[1] 

机构地区：[1]武汉交通职业学院电子与计算机系,湖北武汉430065

出　　处：《计算机与网络》2009年第3期112-115,共4页Computer & Network

摘　　要：随机早期检测(Random Early Detection,RED)算法是广泛应用于路由器中的IP层的拥塞控制算法之一,它的主要思想是在拥塞发生以前通过一定的丢失概率随机丢弃一部分分组,端系统通过收到重复的ACK(Acknowledgement)报文段感知网络即将发生或已经发生网络拥塞,来降低自己的发送速率,从而达到实现网络拥塞控制的目的,但该算法在应用中仍有不足,特别是RED算法在多个流竞争带宽的情况下,不能保证各流获得相对公平的带宽分配。针对于此,在RED算法的基础上设计了一种限制高带宽流算法,以提高的网络公平性。The RED （Random Early Detection） algorithm, which is widely used in routers, is one of the congestion control algorithms in the IP layer. The main idea is to discard randomly a part of the packets before the congestion occurs, the end system is aware of that, the network congestion will occur or has occurred by receiving the repeated ACK （Acknowledgment） packet to reduce its send rate, so the network congestion control is achieved. However, the algorithm is still not better in the applications. In the case of flow competition for bandwidth, the RED algorithm can not guarantee that the bandwidth is allocated to flows relatively fairly. For this, based on the RED algorithm, this paper proposes an algorithm that restricts high-bandwidth flows to improve the fairness of the network.

关 键 词：随机早期检测 公平性 拥塞控制 平均队列长度 

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