The symmetric longest queue system

Research output: Book/ReportReportAcademic

100 Downloads (Pure)


In this paper 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
PublisherTechnische Universiteit Eindhoven
Number of pages12
Publication statusPublished - 1994

Publication series

NameMemorandum COSOR
ISSN (Print)0926-4493


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

Cite this