Upper and lower bounds for the waiting time in the symmetric shortest queue system

Research output: Book/ReportReportAcademic

115 Downloads (Pure)

Abstract

In this paper we compare the exponential symmetric shortest queue system with two related systems: the shortest queue system with threshold jockeying and the shortest queue system with threshold blocking. The latter two systems are easier to analyse and are shown to give tight lower and upper bounds respectively for the mean waiting time in the shortest queue system. The approach also gives bounds for the distribution of the total number of jobs in the system.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages16
Publication statusPublished - 1992

Publication series

NameMemorandum COSOR
Volume9209
ISSN (Print)0926-4493

Fingerprint Dive into the research topics of 'Upper and lower bounds for the waiting time in the symmetric shortest queue system'. Together they form a unique fingerprint.

Cite this