Published in

Taylor and Francis Group, International Journal of Control, 2(89), p. 235-247

DOI: 10.1080/00207179.2015.1068955

Links

Tools

Export citation

Search in Google Scholar

A lexicographic approach to constrained MDP admission control

Journal article published in 2015 by Martina Panfili, Guido Oddi, Antonio Pietrabissa, Vincenzo Suraci ORCID
This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Red circle
Preprint: archiving forbidden
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

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.