In this paper we study the call admission control problem to optimize the network operators' revenue guaranteeing the quality of service to the end users. We consider a network scenario where each class of service is characterized by a different constant bit rate and an associated revenue. We formulate the problem as a Semi-Markov Decision Process, and we use a model based Reinforcement Learning approach. Other traditional algorithms require an explicit knowledge of the state transition models while our solution learns it on-line. We will show how our policy provides better solution than a classic greedy algorithm.
A model based RL admission control algorithm for next generation networks / Mignanti, Silvano; DI GIORGIO, Alessandro; Suraci, Vincenzo. - ELETTRONICO. - (2008), pp. 303-308. (Intervento presentato al convegno 2nd International Conference on Next Generation Mobile Applications, Services, and Technologies, NGMAST 2008 tenutosi a Cardiff, Wales, gbr nel 2008) [10.1109/NGMAST.2008.19].
A model based RL admission control algorithm for next generation networks
MIGNANTI, SILVANO;DI GIORGIO, ALESSANDRO;SURACI, VINCENZO
2008
Abstract
In this paper we study the call admission control problem to optimize the network operators' revenue guaranteeing the quality of service to the end users. We consider a network scenario where each class of service is characterized by a different constant bit rate and an associated revenue. We formulate the problem as a Semi-Markov Decision Process, and we use a model based Reinforcement Learning approach. Other traditional algorithms require an explicit knowledge of the state transition models while our solution learns it on-line. We will show how our policy provides better solution than a classic greedy algorithm.File | Dimensione | Formato | |
---|---|---|---|
VE_2008_11573-907359.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
371.69 kB
Formato
Adobe PDF
|
371.69 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.