Abstrakti
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.
Alkuperäiskieli | Englanti |
---|---|
Otsikko | Proceedings of the 32nd International Teletraffic Congress, ITC 2020 |
Toimittajat | Yuming Jiang, Hideyuki Shimonishi, Kenji Leibnitz |
Kustantaja | IEEE |
Sivut | 123-128 |
Sivumäärä | 6 |
ISBN (elektroninen) | 9783948377021 |
DOI - pysyväislinkit | |
Tila | Julkaistu - syysk. 2020 |
OKM-julkaisutyyppi | A4 Artikkeli konferenssijulkaisuussa |
Tapahtuma | International Teletraffic Congress - Virtual, Online, Osaka, Japani Kesto: 22 syysk. 2020 → 24 syysk. 2020 Konferenssinumero: 32 |
Conference
Conference | International Teletraffic Congress |
---|---|
Lyhennettä | ITC |
Maa/Alue | Japani |
Kaupunki | Osaka |
Ajanjakso | 22/09/2020 → 24/09/2020 |