Asymptotic analysis of a multiclass queueing control problem under heavy traffic with model uncertainty

From MaRDI portal
Publication:5113914

DOI10.1287/STSY.2019.0034zbMATH Open1447.60134arXiv1710.00968OpenAlexW2993532252WikidataQ126637227 ScholiaQ126637227MaRDI QIDQ5113914FDOQ5113914

Asaf Cohen

Publication date: 18 June 2020

Published in: Stochastic Systems (Search for Journal in Brave)

Abstract: We study a multiclass M/M/1 queueing control problem with finite buffers under heavy-traffic where the decision maker is uncertain about the rates of arrivals and service of the system and by scheduling and admission/rejection decisions acts to minimize a discounted cost that accounts for the uncertainty. The main result is the asymptotic optimality of a cmu-type of policy derived via underlying stochastic differential games studied in [16]. Under this policy, with high probability, rejections are not performed when the workload lies below some cut-off that depends on the ambiguity level. When the workload exceeds this cut-off, rejections are carried out and only from the buffer with the cheapest rejection cost weighted with the mean service rate in some reference model. The allocation part of the policy is the same for all the ambiguity levels. This is the first work to address a heavy-traffic queueing control problem with model uncertainty.


Full work available at URL: https://arxiv.org/abs/1710.00968




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Asymptotic analysis of a multiclass queueing control problem under heavy traffic with model uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113914)