Sojourn time approximations for a multi-server processor sharing system with priorities

R.D. van der Mei, Hans Leo van den Berg, R. Vranken, B.M.M. Gijsen

    Research output: Contribution to journalArticleAcademicpeer-review

    3 Citations (Scopus)

    Abstract

    We study mean sojourn times in a multi-server processor sharing system with two priority classes and with general service-time distributions. For high-priority customers, the mean sojourn time follows directly from classical results on symmetric queues. For low-priority customers, in the absence of exact results, we propose a simple and explicit approximation for the mean sojourn time. Extensive numerical experiments demonstrate that the approximations are highly accurate for a wide range of parameter settings.
    Original languageEnglish
    Pages (from-to)249-261
    Number of pages12
    JournalPerformance evaluation
    Volume54
    Issue number3
    DOIs
    Publication statusPublished - 2003

    Keywords

    • Priorities
    • Sojourn-time approximations
    • Process sharing system
    • Symmetric queues
    • METIS-216274
    • IR-75020

    Fingerprint Dive into the research topics of 'Sojourn time approximations for a multi-server processor sharing system with priorities'. Together they form a unique fingerprint.

  • Cite this