On the behavior of ECN/RED gateways under a large number of TCP flows: limit theorems (Q2494555): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: TCP in presence of bursty losses / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5560061 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rate-Based Versus Queue-Based Models of Congestion Control / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rate control for communication networks: shadow prices, proportional fairness and stability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the behavior of ECN/RED gateways under a large number of TCP flows: limit theorems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Asymptotic Statistics / rank | |||
Normal rank | |||
Latest revision as of 17:33, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the behavior of ECN/RED gateways under a large number of TCP flows: limit theorems |
scientific article |
Statements
On the behavior of ECN/RED gateways under a large number of TCP flows: limit theorems (English)
0 references
28 June 2006
0 references
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.
0 references
TCP
0 references
AIMD
0 references
RED
0 references
AQM
0 references
Limit Theorems
0 references
0 references
