Eun Ho Yang , Sung Il Ham , Seong Ho Cho , Chong Kwon Kim

The KIPS Transactions:PartC, Vol. 12, No. 4, pp. 571-580, Aug. 2005
10.3745/KIPSTC.2005.12.4.571,   PDF Download:

Abstract

In fast long-distance networks, TCP´s congestion control algorithm has the problem of utilizing bandwidth effectively. Several window-based congestion control protocols for high-speed and large delay networks have been proposed to solve this problem. These protocols deliberate mainly three properties : scalability, TCP-friendliness, and RTT-fairness. These protocols, however, cannot satisfy above three properties at the same time because of the trade-off among them. This paper presents a new window-based congestion control algorithm, called EIMD (Exponential Increase / Multiplicative Decrease), that simultaneously supports all four properties including fast convergence, which is another important constraint for fast long-distance networks; it can support scalability by increasing congestion window exponentially proportional to the time elapsed since a packet loss; it can support RTT-fairness and TCP-friendliness by considering RTT in its response function; it can support fast fair-share convergence by increasing congestion window inversely proportional to the congestion window just before packet loss. We evaluate the performance of EIMD and other algorithms by extensive computer simulations.

Statistics
Cite this article