In this paper we study the call admission control problem to optimize the network operators revenue guaranteeing 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 learn 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 / Silvano, Mignanti; DI GIORGIO, Alessandro; Vincenzo, Suraci. - STAMPA. - (2009), pp. 191-196. (Intervento presentato al convegno 8th International Confefence on Networks (ICN) tenutosi a Gosier, Guadeloupe, France nel MAR 01-06, 2009) [10.1109/icn.2009.39].
A Model Based RL Admission Control Algorithm for Next Generation Networks
DI GIORGIO, ALESSANDRO;
2009
Abstract
In this paper we study the call admission control problem to optimize the network operators revenue guaranteeing 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 learn it on-line. We will show how our policy provides better solution than a classic greedy algorithm.File | Dimensione | Formato | |
---|---|---|---|
VE_2009_11573-443176.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
368.4 kB
Formato
Adobe PDF
|
368.4 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.