A mean-field model for multiple TCP connections through a buffer implementing RED

  • Authors:

  • F. Baccelli;D. R. McDonald;J. Reynier

  • Affiliations:

  • LIENS Department of Mathematiques and Informatiques, INRIA and Ecole Normale Supérieure, 45 Rue d'Ulm, 75230 Paris Cedex 50, France;Department of Mathematics, University of Ottawa, Ottawa, Canada;Ecole Normale Supérieure, Paris, France

  • Venue:
  • Performance Evaluation
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Active queue management schemes like RED (random early detection) have been suggested when multiple TCP sessions are multiplexed through a bottleneck buffer. The idea is to detect congestion before the buffer overflows and packets are lost. When the queue length reaches a certain threshold RED schemes drop/mark incoming packets with a probability that increases as the queue size increases. The objectives are an equitable distribution of packet loss, reduced delay and delay variation and improved network utilization.Here we model multiple connections maintained in the congestion avoidance regime by the RED mechanism. The window sizes of each TCP session evolve like independent dynamical systems coupled by the queue length at the buffer. We introduce a mean-field approximation to one such RED system as the number of flows tends to infinity. The deterministic limiting system is described by a transport equation. The numerical solution of the limiting system is found to provide a good description of the evolution of the distribution of the window sizes, the average queue size, the average loss rate per connection and the total throughput. TCP with RED or tail-drop may exhibit limit cycles and this causes unnecessary packet delay variation and variable loss rates. The root cause of these limit cycles is the hysteresis due to the round trip time delay in reacting to a packet loss.