Abstract
We consider the M/G/1 queue where job sizes become known upon arrival subject to a general cost structure. More specifically, we are interested in determining the optimal admission policy to the (size-aware) system with multiple job-classes each having its own admission and rejection costs. The cost for admitting a job is a class-specific function of the waiting time. As a special case, we consider a deadline cost structure where admitting a job that will be late has a smaller cost than rejecting it. We analyse the system within the framework of Markov decision processes, and derive expressions that enable us to determine the size-aware value function, and the optimal class-specific admission control, as well as the resulting mean cost. The availability of the value function allows one to develop efficient dispatching policies for a system with heterogeneous parallel servers.
Original language | English |
---|---|
Title of host publication | Proceedings of the 32nd International Teletraffic Congress, ITC 2020 |
Editors | Yuming Jiang, Hideyuki Shimonishi, Kenji Leibnitz |
Publisher | International Institute for Geo-Information Science and Earth Observation (ITC) |
Pages | 123-128 |
Number of pages | 6 |
ISBN (Electronic) | 978-3-948377-02-1 |
DOIs | |
Publication status | Published - Sept 2020 |
MoE publication type | A4 Conference publication |
Event | International Teletraffic Congress - Virtual, Online, Osaka, Japan Duration: 22 Sept 2020 → 24 Sept 2020 Conference number: 32 |
Conference
Conference | International Teletraffic Congress |
---|---|
Abbreviated title | ITC |
Country/Territory | Japan |
City | Osaka |
Period | 22/09/2020 → 24/09/2020 |