Waiting-time approximations for multiple-server polling systems

S.C. Borst, R.D. Mei, van der

    Research output: Contribution to journalArticleAcademicpeer-review

    13 Citations (Scopus)

    Abstract

    We consider multiple-server polling systems, in which each of the servers visits the queues according to its own cyclic schedule. Such systems appear to completely defy the derivation of exact waiting-time results, which motivates the search for accurate approximations. In the present paper, we derive waiting-time approximations for asymmetric systems with the exhaustive and gated service discipline. The approximations are tested for a wide range of parameter combinations.
    Original languageEnglish
    Pages (from-to)163-182
    Number of pages20
    JournalPerformance Evaluation
    Volume31
    Issue number3-4
    DOIs
    Publication statusPublished - 1998

    Fingerprint

    Dive into the research topics of 'Waiting-time approximations for multiple-server polling systems'. Together they form a unique fingerprint.

    Cite this