Journal of South China University of Technology (Natural Science Edition) ›› 2008, Vol. 36 ›› Issue (1): 38-43.

• Computer Science & Technology • Previous Articles     Next Articles

An Improved Explicit Congestion Notification Algorithm

Lai Jun  Ye Wu  Feng Sui-li   

  1. School of Electronic and Information Engineering, South China University of Technology, Guangzhou 510640, Guangdong, China
  • Received:2007-01-26 Revised:2007-03-19 Online:2008-01-25 Published:2008-01-25
  • Contact: 赖峻(1979-),男,博士生,主要从事网络流量优化和拥塞控制方面的研究. E-mail:laijun_2005@126.com
  • About author:赖峻(1979-),男,博士生,主要从事网络流量优化和拥塞控制方面的研究.

Abstract:

As the algorithm of explicit congestion notification (ECN) in RFC 3168 recommends the gateway to drop packets when the average queue length in the gateway buffer exceeds the upper queue threshold, the network throughput may be too low. In order to improve the system performance, this paper proposes an algorithm named Long-Queue Random Drop (LQRD). In the proposed algorithm, the gateway drops packets according to a drop probability function when the average queue length in the gateway buffer exceeds the upper queue threshold, thus limiting the continuous increase in queue length. The drop probability function synthetically considers the average queue length, the buffer size, the link capacity and the average queue delay. Simulated results show that the proposed algorithm ensures high throughput, short delay and robust connectivity for long queue length in the gateway buffer. The analytical model of the proposed algorithm is finally analyzed by using the nonlinearly differential equation.

Key words: gateway, congestion control, explicit congestion notification, random early detection