A comparison of two popular end-to-end congestion control algorithms: the case of AIMD and AIPD

Author

Lee, Kang-Won ; Kim, Tae-eun ; Bharghavan, Vaduvur

Author_Institution

IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA

Volume

3

fYear

2001

fDate

2001

Firstpage

1580

Abstract

The focus of this paper is to compare two popular end-to-end congestion control algorithm in the literature, namely, AIMD (additive increase/multiplicative decrease) and AIPD (additive increase/loss proportional decrease). We clarify the definitions of AIMD and AIPD algorithms, and compare them in various aspects such as convergence, steady state throughput, fairness characteristics, and the corresponding utility functions. The comparison is based on a simple mathematical analysis and a set of simulation results using the ns-2 simulator

Keywords

telecommunication congestion control; telecommunication traffic; transport protocols; wide area networks; AIMD; AIPD; TCP-friendliness; additive increase/loss proportional decrease; additive increase/multiplicative decrease; convergence; end-to-end congestion control; fairness characteristics; network flows; ns-2 simulator; steady state throughput; utility functions; wide area network; Analytical models; Channel allocation; Character generation; Computer aided software engineering; Convergence; Mathematical analysis; Optimal control; Proportional control; Steady-state; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE

Conference_Location

San Antonio, TX

Print_ISBN

0-7803-7206-9

Type

conf

DOI

10.1109/GLOCOM.2001.965846

Filename

965846