Title
A comparison of two popular end-to-end congestion control algorithms: the case of AIMD and AIPD
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
Year
DOI
Venue
2001
10.1109/GLOCOM.2001.965846
GLOBECOM
Keywords
Field
DocType
ns-2 simulator,fairness characteristics,steady state throughput,aipd,tcp-friendliness,network flows,telecommunication congestion control,utility functions,additive increase/multiplicative decrease,aimd,convergence,transport protocols,telecommunication traffic,wide area networks,end-to-end congestion control,wide area network,additive increase/loss proportional decrease,computer aided software engineering,optimal control,channel allocation,steady state,throughput,mathematical analysis,proportional control
Flow network,Convergence (routing),Optimal control,Proportional control,Multiplicative function,Computer science,Computer network,Algorithm,Real-time computing,Throughput,Channel allocation schemes,Additive increase/multiplicative decrease
Conference
Volume
ISSN
ISBN
3
1930-529X
0-7803-7206-9
Citations 
PageRank 
References 
3
0.42
7
Authors
3
Name
Order
Citations
PageRank
Kang-Won Lee130.42
Tae-Eun Kim246190.78
V. Bharghavan34278980.73