Abstract
dc:descriptionThe relative waiting times in a G/G/2 queue are investigated for FIFS vs. cyclic service order. We will prove that under the FIFS system the expected wait is shorter given rather weak conditions on the arrival process. However, the wait is not necessarily stochastically less, nor is the average wait less for every realization. This result bears on the upper limits on expected wait in a G/G/k queue given by Brumelle and Kingman.
Degree
thesis:*- Name thesis:degree_name
- Master of Science - MSc
- Level thesis:degree_level
- master's
- Discipline thesis:degree_discipline
- Mathematics
- Grantor dc:publisher
- University of British Columbia
- Year dc:date
- 1975
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Piater, Reinhard
Rights
dc:rights- Statement dc:rights
-
- For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
- Language dc:language
- eng
Identifiers
dc:identifier.*- Handle dc:identifier
- http://hdl.handle.net/2429/19301