The symmetric longest queue system

Geert-Jan van Houtum, Ivo Adan, Jan van der Wal

Research output: Contribution to journalArticleAcademicpeer-review

11 Citations (Scopus)
152 Downloads (Pure)


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
Pages (from-to)105-120
JournalCommunications in statistics : Stochastic models
Issue number1
Publication statusPublished - 1997


  • METIS-206042
  • IR-101674


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

Cite this