Learning Optimal Admission Control in Partially Observable Queueing Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2023

Learning Optimal Admission Control in Partially Observable Queueing Networks

Abstract

We present an efficient reinforcement learning algorithm that learns the optimal admission control policy in a partially observable queueing network. Specifically, only the arrival and departure times from the network are observable, and optimality refers to the average holding/rejection cost in infinite horizon. While reinforcement learning in Partially Observable Markov Decision Processes (POMDP) is prohibitively expensive in general, we show that our algorithm has a regret that only depends sub-linearly on the maximal number of jobs in the network, S. In particular, in contrast with existing regret analyses, our regret bound does not depend on the diameter of the underlying Markov Decision Process (MDP), which in most queueing systems is at least exponential in S. The novelty of our approach is to leverage Norton's equivalent theorem for closed product-form queueing networks and an efficient reinforcement learning algorithm for MDPs with the structure of birth-and-death processes.
Fichier principal
Vignette du fichier
Norton-learning.pdf (1.11 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04170992 , version 1 (25-07-2023)
hal-04170992 , version 2 (22-02-2024)

Licence

Identifiers

  • HAL Id : hal-04170992 , version 2

Cite

Jonatha Anselmi, Bruno Gaujal, Louis-Sébastien Rebuffi. Learning Optimal Admission Control in Partially Observable Queueing Networks. 2023. ⟨hal-04170992v2⟩
55 View
39 Download

Share

Gmail Mastodon Facebook X LinkedIn More