The symmetric longest queue system

I.J.B.F. Adan, G.J. van Houtum, J. van der Wal

    Research output: Book/ReportReportProfessional

    43 Downloads (Pure)

    Abstract

    We derive the performance of the exponential symmetric longest queue system from two variants: a longest queue system with Threshold Rejection of jobs and one with Threshold Addition of jobs. It is shown that these two systems provide lower and upper bounds for the performance of the longest queue system. Both variants can be analyzed efficiently. Numerical experiments demonstrate the power of the approach.
    Original languageEnglish
    Place of PublicationEindhoven
    PublisherEindhoven University of Technology
    Number of pages12
    Publication statusPublished - 1994

    Publication series

    NameCOSOR Memorandum
    PublisherEindhoven University of Technology
    Volume94-33
    ISSN (Print)0926-4493

    Fingerprint Dive into the research topics of 'The symmetric longest queue system'. Together they form a unique fingerprint.

    Cite this