Mean field convergence of a model of multiple TCP connections through a buffer implementing RED

DOI10.1214/105051605000000700MaRDI QIDQ2494580zbMATH OpenOpenAlexFDO

Authors J. Reynier, David R. Mcdonald

Publication date 29 June 2006

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0603325

zbMATH Keywords

dynamical systemsmean-field

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Circuits, networks (94C99) Continuous-time Markov processes on general state spaces (60J25)

Abstract: RED (Random Early Detection) has been suggested when multiple TCP sessions are multiplexed through a bottleneck buffer. The idea is to detect congestion before the buffer overflows by dropping or marking packets with a probability that increases with the queue length. The objectives are reduced packet loss, higher throughput, reduced delay and reduced delay variation achieved through an equitable distribution of packet loss and reduced synchronization. Baccelli, McDonald and Reynier [Performance Evaluation 11 (2002) 77--97] have proposed a fluid model for multiple TCP connections in the congestion avoidance regime multiplexed through a bottleneck buffer implementing RED. The window sizes of each TCP session evolve like independent dynamical systems coupled by the queue length at the buffer. The key idea in [Performance Evaluation 11 (2002) 77--97] is to consider the histogram of window sizes as a random measure coupled with the queue. Here we prove the conjecture made in [Performance Evaluation 11 (2002) 77--97] that, as the number of connections tends to infinity, this system converges to a deterministic mean-field limit comprising the window size density coupled with a deterministic queue.

Recommendations

• Estimation of the variances of TCP/RED using stochastic differential equation
• Stability and analysis of TCP connections with RED control and exogenous traffic
• Linear stability of TCP/RED and a scalable control
• scientific article; zbMATH DE number 1726622
• scientific article; zbMATH DE number 2088486
• Performance analysis of AIMD mechanisms over a multi-state Markovian path
• HTTP turbulence
• Asymptotic properties of a TCP model with time-outs

Cites work

• scientific article; zbMATH DE number 446474 (Why is no real title available?)
• scientific article; zbMATH DE number 3951715 (Why is no real title available?)
• scientific article; zbMATH DE number 1354815 (Why is no real title available?)
• Modelling and performance evaluation methodology. Proceedings of the International Seminar, Paris, France, January 24-26, 1983. (INRIA)
• Particle representations for measure-valued population models
• Rate-Based Versus Queue-Based Models of Congestion Control
• The fluid limit of a heavily loaded processor sharing queue

Cited in

(8)

• Balancing queues by mean field interaction
• STOCHASTICALLY SCALABLE FLOW CONTROL
• HTTP turbulence
• On the behavior of ECN/RED gateways under a large number of TCP flows: limit theorems
• A multi-class mean-field model with graph structure for TCP flows
• Interacting multi-class transmissions in large stochastic networks
• Law of Large Numbers for Dynamic Bargaining Markets
• A probabilistic approach to spectral analysis of growth-fragmentation equations

This page was built for publication: Mean field convergence of a model of multiple TCP connections through a buffer implementing RED

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494580)