On the behavior of ECN/RED gateways under a large number of TCP flows: limit theorems
From MaRDI portal
Publication:2494555
This paper presents a discrete-time stochastic model of an ECN/RED capable router where TCP flows share the link capacity. In this paper, the authors establish several asymptotic results for the aforementioned problem. The results may be useful for provisioning RED routers.
Recommendations
- Linear stability of TCP/RED and a scalable control
- Mean field convergence of a model of multiple TCP connections through a buffer implementing RED
- Asymptotic Behavior of Internet Congestion Controllers in a Many-Flows Regime
- STOCHASTICALLY SCALABLE FLOW CONTROL
- Asymptotic properties of a TCP model with time-outs
Cites work
- Asymptotic Statistics
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- On the behavior of ECN/RED gateways under a large number of TCP flows: limit theorems
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Rate-Based Versus Queue-Based Models of Congestion Control
- TCP in presence of bursty losses
Cited in
(5)- On the behavior of ECN/RED gateways under a large number of TCP flows: limit theorems
- Balancing queues by mean field interaction
- scientific article; zbMATH DE number 1717167 (Why is no real title available?)
- scientific article; zbMATH DE number 2088486 (Why is no real title available?)
- Estimation of the variances of TCP/RED using stochastic differential equation
This page was built for publication: On the behavior of ECN/RED gateways under a large number of TCP flows: limit theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494555)