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

Onderzoeksoutput: Boek/rapportRapportAcademic

110 Downloads (Pure)

Samenvatting

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.
Originele taal-2Engels
Plaats van productieEindhoven
UitgeverijTechnische Universiteit Eindhoven
Aantal pagina's16
StatusGepubliceerd - 1992

Publicatie series

NaamMemorandum COSOR
Volume9209
ISSN van geprinte versie0926-4493

Vingerafdruk Duik in de onderzoeksthema's van 'Upper and lower bounds for the waiting time in the symmetric shortest queue system'. Samen vormen ze een unieke vingerafdruk.

Citeer dit