This paper deals with the problem of congestion control in a heterogeneous network scenario. Specifically, it introduces the concept of dynamic congestion estimation. The algorithm runs in the edge routers (ER) (the routers collecting the traffic between two different networks) with the aim of avoiding congestion in the network routers. ERs communicate via the network itself, which, consequently, introduces a variable feedback delay in the control loop. The algorithm is based on the Smith's principle; the main novelty is that the algorithm adapts to the delay and rate variations, since it exploits on-line estimates obtained via probe packets.
Edge router congestion control with congestion estimation / Pietrabissa, Antonio; DELLI PRISCOLI, Francesco; V., Lombardi. - (2004), pp. 2370-2371. (Intervento presentato al convegno 43rd IEEE Conference on Decision and Control tenutosi a San Diego, CA nel DEC 14-17, 2004) [10.1109/cdc.2004.1428752].
Edge router congestion control with congestion estimation
PIETRABISSA, Antonio;DELLI PRISCOLI, Francesco;
2004
Abstract
This paper deals with the problem of congestion control in a heterogeneous network scenario. Specifically, it introduces the concept of dynamic congestion estimation. The algorithm runs in the edge routers (ER) (the routers collecting the traffic between two different networks) with the aim of avoiding congestion in the network routers. ERs communicate via the network itself, which, consequently, introduces a variable feedback delay in the control loop. The algorithm is based on the Smith's principle; the main novelty is that the algorithm adapts to the delay and rate variations, since it exploits on-line estimates obtained via probe packets.File | Dimensione | Formato | |
---|---|---|---|
VE_2004_11573-237541.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
179.2 kB
Formato
Adobe PDF
|
179.2 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.