This paper defines a theoretical framework based on Markov Decision Processes (MDPs) to deal with call control algorithms in links with variable capacity supporting multiple classes of service. The variable capacity problem, which arises in wireless network scenarios, is addressed by incorporating the link model into the MDP formulation and by introducing, besides the standard call admission policy, a call dropping policy. In this way, the proposed approach is capable of controlling class-level quality of service in terms of both blocking and dropping probabilities. Numerical simulations show the effectiveness of the approach.
Optimal Call Admission and Call Dropping Control in Links with Variable Capacity / Pietrabissa, Antonio. - In: EUROPEAN JOURNAL OF CONTROL. - ISSN 0947-3580. - 15:1(2009), pp. 56-67. [10.3166/ejc.15.56-67]
Optimal Call Admission and Call Dropping Control in Links with Variable Capacity
PIETRABISSA, Antonio
2009
Abstract
This paper defines a theoretical framework based on Markov Decision Processes (MDPs) to deal with call control algorithms in links with variable capacity supporting multiple classes of service. The variable capacity problem, which arises in wireless network scenarios, is addressed by incorporating the link model into the MDP formulation and by introducing, besides the standard call admission policy, a call dropping policy. In this way, the proposed approach is capable of controlling class-level quality of service in terms of both blocking and dropping probabilities. Numerical simulations show the effectiveness of the approach.File | Dimensione | Formato | |
---|---|---|---|
VE_2009_11573-134628.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
171.44 kB
Formato
Adobe PDF
|
171.44 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.