inria-00136205, version 2
Convergence and Optimal Buffer Sizing for Window Based AIMD Congestion Control
N° RR-6142 (2007)
Abstract: We study the interaction between the AIMD (Additive Increase Multiplicative Decrease) congestion control and a bottleneck router with Drop Tail buffer. We consider the problem in the framework of deterministic hybrid models. First, we show that the hybrid model of the interaction between the AIMD congestion control and bottleneck router always converges to a cyclic behavior. We characterize the cycles. Necessary and sufficient conditions for the absence of multiple jumps of congestion window in the same cycle are obtained. Then, we propose an analytical framework for the optimal choice of the router buffer size. We formulate the problem of the optimal router buffer size as a multi-criteria optimization problem, in which the Lagrange function corresponds to a linear combination of the average goodput and the average delay in the queue. The solution to the optimization problem provides further evidence that the buffer size should be reduced in the presence of traffic aggregation. Our analytical results are confirmed by simulations performed with Simulink and the NS simulator.
- a – University of Liverpool
- 1:
- INRIA – Université Montpellier II - Sciences et techniques
- 2:
- CNRS : UPR8001 – Université Paul Sabatier [UPS] - Toulouse III – Institut National Polytechnique de Toulouse - INPT – Institut National des Sciences Appliquées (INSA) - Toulouse
- 3:
- Liverpool University
- Domain : Computer Science/Networking and Telecommunication
- Keywords : TCP/IP modeling – router buffer sizing – deterministic hybrid model approach – multi-criteria optimization
- Internal note : RR-6142
- Available versions : v1 (2007-03-13) v2 (2007-03-13)
- inria-00136205, version 2
- http://hal.inria.fr/inria-00136205
- oai:hal.inria.fr:inria-00136205
- From:
- Submitted on: Tuesday, 13 March 2007 10:35:54
- Updated on: Wednesday, 15 October 2008 13:36:58




Associated documents

Export