Stochastic bound for a polling system

O.J. Boxma, M. Kelbert

    Research output: Contribution to journalArticleAcademicpeer-review

    4 Citations (Scopus)


    In this note we consider two queueing systems: a symmetric polling system with gated service at allN queues and with switchover times, and a single-server single-queue model with one arrival stream of ordinary customers andN additional permanently present customers. It is assumed that the combined arrival process at the queues of the polling system coincides with the arrival process of the ordinary customers in the single-queue model, and that the service time and switchover time distributions of the polling model coincide with the service time distributions of the ordinary and permanent customers, respectively, in the single-queue model. A complete equivalence between both models is accomplished by the following queue insertion of arriving customers. In the single-queue model, an arriving ordinary customer occupies with probabilityp i a position at the end of the queue section behind theith permanent customer,i = l, ...,N. In the cyclic polling model, an arriving customer with probabilityp i joins the end of theith queue to be visited by the server, measured from its present position. For the single-queue model we prove that, if two queue insertion distributions {p i, i = l, ...,N} and {q i, i = l, ...,N} are stochastically ordered, then also the workload and queue length distributions in the corresponding two single-queue versions are stochastically ordered. This immediately leads to equivalent stochastic orderings in polling models. Finally, the single-queue model with Poisson arrivals andp 1 = 1 is studied in detail.
    Original languageEnglish
    Pages (from-to)295-310
    JournalAnnals of Operations Research
    Issue number3
    Publication statusPublished - 1994


    Dive into the research topics of 'Stochastic bound for a polling system'. Together they form a unique fingerprint.

    Cite this