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

Conference Record / IEEE Global Telecommunications Conference

Volumn 3, Issue , 2001, Pages 1580-1584

  Lee, Kang Won ^a   Kim, Tae Eun ^a   Bharghavan, Vaduvur ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Additive Increase Loss Proportional Decrease (AIPD); Additive Increase Multlplicative Decrease (AIMD); Congestion control; Fairness; TCP friendliness; Utility Function

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MATHEMATICAL MODELS; NETWORK PROTOCOLS;

CONGESTION CONTROL ALGORITHMS;

CONGESTION CONTROL (COMMUNICATION);

EID: 0035687539     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Rate control for communication networks: Shadow prices, proportional fairness and stability
2. Bandwidth sharing: Objectives and algorithms
3. End-to-end congestion control schemes: Untility functions, random losses and ECN marks
4. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
5. Design and evaluation of congestion control algorithms in the future internet
6. Equation-based congestion control for unitcast applications
7. The performance of TCP/IP for networks with high bandwidth-delay products and random loss
8. Modeling TCP throughput: A simple model and its empirical validation
9. Promoting the use of end-to-end congestion control in the internet
10. A comparison of equation-based and AIMD congestion control
11. An integrated source coding and congestion control framework for video streaming in the internet
12. RAP: An end-to-end rate-based congestion control mechanism for realtime streams in the internet
13. Improving congestion control performance through loss differentiation