On the behavior of ECN/RED gateways under a large number of TCP flows: limit theorems (Q2494555)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5036642
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the behavior of ECN/RED gateways under a large number of TCP flows: limit theorems |
scientific article; zbMATH DE number 5036642 |
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
0.7748790383338928
0 references
0.7733262777328491
0 references
0.7665711641311646
0 references
0.7638254761695862
0 references
0.763300895690918
0 references
