The admission control problem can be modelled as a Markov decision process (MDP) under the average cost criterion and formulated as a linear programming (LP) problem. The LP formulation is attractive in the present and future communication networks, which support an increasing number of classes of service, since it can be used to explicitly control class-level requirements, such as class blocking probabilities. On the other hand, the LP formulation suffers from scalability problems as the number C of classes increases. This article proposes a new LP formulation, which, even if it does not introduce any approximation, is much more scalable: the problem size reduction with respect to the standard LP formulation is O((C+1)(2)2(C)). Theoretical and numerical simulation results prove the effectiveness of the proposed approach.

A new LP formulation of the admission control problem modelled as an MDP under average reward criterion / Pietrabissa, Antonio. - In: INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE. - ISSN 0020-7721. - STAMPA. - 42:12(2011), pp. 2085-2096. [10.1080/00207721003717289]

A new LP formulation of the admission control problem modelled as an MDP under average reward criterion

PIETRABISSA, Antonio
2011

Abstract

The admission control problem can be modelled as a Markov decision process (MDP) under the average cost criterion and formulated as a linear programming (LP) problem. The LP formulation is attractive in the present and future communication networks, which support an increasing number of classes of service, since it can be used to explicitly control class-level requirements, such as class blocking probabilities. On the other hand, the LP formulation suffers from scalability problems as the number C of classes increases. This article proposes a new LP formulation, which, even if it does not introduce any approximation, is much more scalable: the problem size reduction with respect to the standard LP formulation is O((C+1)(2)2(C)). Theoretical and numerical simulation results prove the effectiveness of the proposed approach.
admission control; communication networks; linear programming; markov decision processes
01 Pubblicazione su rivista::01a Articolo in rivista
A new LP formulation of the admission control problem modelled as an MDP under average reward criterion / Pietrabissa, Antonio. - In: INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE. - ISSN 0020-7721. - STAMPA. - 42:12(2011), pp. 2085-2096. [10.1080/00207721003717289]
File allegati a questo prodotto
File Dimensione Formato  
VE_2011_11573-134888.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 404.76 kB
Formato Adobe PDF
404.76 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/134888
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact