Admission Control to M/G/1 Subject to General Class-Specific Admission and Rejection Costs

Esa Hyytia, Rhonda Righter, Jorma Virtamo

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review


    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 languageEnglish
    Title of host publicationProceedings of the 32nd International Teletraffic Congress, ITC 2020
    EditorsYuming Jiang, Hideyuki Shimonishi, Kenji Leibnitz
    PublisherInternational Institute for Geo-Information Science and Earth Observation (ITC)
    Number of pages6
    ISBN (Electronic)978-3-948377-02-1
    Publication statusPublished - Sept 2020
    MoE publication typeA4 Conference publication
    EventInternational Teletraffic Congress - Virtual, Online, Osaka, Japan
    Duration: 22 Sept 202024 Sept 2020
    Conference number: 32


    ConferenceInternational Teletraffic Congress
    Abbreviated titleITC


    Dive into the research topics of 'Admission Control to M/G/1 Subject to General Class-Specific Admission and Rejection Costs'. Together they form a unique fingerprint.

    Cite this