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

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

35 Citaten (Scopus)
2 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
Pagina's (van-tot)197-217
TijdschriftAnnals of Operations Research
Volume48
Nummer van het tijdschrift2
DOI's
StatusGepubliceerd - 1994

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