28606 articles – 22093 references  [version française]

inria-00136205, version 1

Convergence and Optimal Buffer Sizing for Window Based AIMD Congestion Control

Konstantin Avrachenkov () a, 1, Urtzi Ayesta () 2, Alexei Piunovskiy () b, 3

(2007)

  • a –  INRIA
  • b –  University of Liverpool
  • 1:  MAESTRO (INRIA Sophia Antipolis)

  • INRIA – Université Montpellier II - Sciences et techniques France
  • 2:  Laboratoire d'analyse et d'architecture des systèmes (LAAS)
  • http://www.laas.fr
    CNRS : UPR8001 – Université Paul Sabatier [UPS] - Toulouse III – Institut National Polytechnique de Toulouse - INPT – Institut National des Sciences Appliquées (INSA) - Toulouse 7 Av du colonel Roche 31077 TOULOUSE CEDEX 4 France
  • 3:  Department of Mathematical Sciences [Liverpool]
  • http://www.liv.ac.uk/maths/
    Liverpool University The University of Liverpool Mathematical Sciences Building Liverpool, L69 7ZL United Kingdom
  • Available versions :  v1 (2007-03-13) v2 (2007-03-13)

    • Bibliographic reference

    • Type of document: Research reports
    • Domain: Computer Science/Networking and Telecommunication
    • Title: Convergence and Optimal Buffer Sizing for Window Based AIMD Congestion Control
    • 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.
    • ACM Classification: J.: Computer Applications
    • Full text language: English
    • Report type: Research Report
    • Page number: 42
    • Publication date: 2007
    • Keywords: TCP/IP modeling – router buffer sizing – deterministic hybrid model approach – multi-criteria optimization

    Attached file list to this document: 

     
    • inria-00136205, version 1
    • http://hal.inria.fr/inria-00136205
    • oai:hal.inria.fr:inria-00136205
    • From: Konstantin Avrachenkov <>
    • Submitted on: Monday, 12 March 2007 19:15:34
    • Updated on: Tuesday, 13 March 2007 10:00:29