Managing the bandwidth allocated to a Label Switched Path in MPLS networks plays a major role for provisioning of Quality of Service and efficient use of resources. In doing so, two main contrasting factors have to be considered: not only the bandwidth should be adapted to the traffic profile but also the effort for bandwidth renegotiation associated with a variation of the allocated bandwidth should be kept at low levels. In this context, we formulate a problem of optimal LSP bandwidth reservation as the one of minimizing a convex combination of the difference between the assigned bandwidth and the estimated future traffic, and of a measure of the frequency of bandwidth variations. The contribution of this paper is to propose a new method to reserve optimally the bandwidth of an LSP, avoiding an excess of bandwidth renegotiations on the basis of prediction of future traffic, assuming a simple birth-and-death model to describe the traffic dynamics. Whenever the prediction is inaccurate due to unpredictable variations in the characteristics of real traffic, a suitable ‘‘emergency procedure’’ is proposed, which performs a new traffic prediction and a consequent modified bandwidth reservation. Numerical results are presented which show the effectiveness of the method and the achieved performance, both for simulated and real data traffic.
Dynamic bandwidth reservation for label switched paths: An on-line predictive approach / T., Anjali; Bruni, Carlo; Iacoviello, Daniela; C., Scoglio. - In: COMPUTER COMMUNICATIONS. - ISSN 0140-3664. - STAMPA. - 29:16(2006), pp. 3265-3276. [10.1016/j.comcom.2006.05.004]
Dynamic bandwidth reservation for label switched paths: An on-line predictive approach
BRUNI, Carlo;IACOVIELLO, Daniela;
2006
Abstract
Managing the bandwidth allocated to a Label Switched Path in MPLS networks plays a major role for provisioning of Quality of Service and efficient use of resources. In doing so, two main contrasting factors have to be considered: not only the bandwidth should be adapted to the traffic profile but also the effort for bandwidth renegotiation associated with a variation of the allocated bandwidth should be kept at low levels. In this context, we formulate a problem of optimal LSP bandwidth reservation as the one of minimizing a convex combination of the difference between the assigned bandwidth and the estimated future traffic, and of a measure of the frequency of bandwidth variations. The contribution of this paper is to propose a new method to reserve optimally the bandwidth of an LSP, avoiding an excess of bandwidth renegotiations on the basis of prediction of future traffic, assuming a simple birth-and-death model to describe the traffic dynamics. Whenever the prediction is inaccurate due to unpredictable variations in the characteristics of real traffic, a suitable ‘‘emergency procedure’’ is proposed, which performs a new traffic prediction and a consequent modified bandwidth reservation. Numerical results are presented which show the effectiveness of the method and the achieved performance, both for simulated and real data traffic.File | Dimensione | Formato | |
---|---|---|---|
VE_2006_11573-240436.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
385.51 kB
Formato
Adobe PDF
|
385.51 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.