This paper proposes a Reinforcement Learningbased lexicographic approach to the Call Admission Control (CAC) problem in communication networks. The CAC problem is modeled as a multi-constrained Markov Decision Problem (MDP). To overcome the problems of the standard approaches to the solution of constrained MDP, a multiconstraint lexicographic approach is defined, and an on-line implementation based on Reinforcement Learning techniques is proposed. Simulations validate the proposed approach. © 2013 IEEE.
A lexicographic approach to constrained MDP admission control / Panfili, Martina; Pietrabissa, Antonio. - (2013), pp. 1428-1433. ( 2013 21st Mediterranean Conference on Control and Automation, MED 2013 Platanias-Chania, Crete 25 June 2013 through 28 June 2013) [10.1109/med.2013.6608908].
A lexicographic approach to constrained MDP admission control
PANFILI, MARTINA;PIETRABISSA, Antonio
2013
Abstract
This paper proposes a Reinforcement Learningbased lexicographic approach to the Call Admission Control (CAC) problem in communication networks. The CAC problem is modeled as a multi-constrained Markov Decision Problem (MDP). To overcome the problems of the standard approaches to the solution of constrained MDP, a multiconstraint lexicographic approach is defined, and an on-line implementation based on Reinforcement Learning techniques is proposed. Simulations validate the proposed approach. © 2013 IEEE.| File | Dimensione | Formato | |
|---|---|---|---|
|
VE_2013_11573-536461.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
379.3 kB
Formato
Adobe PDF
|
379.3 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
