Article ID: | iaor20003135 |
Country: | Netherlands |
Volume: | 28 |
Issue: | 4 |
Start Page Number: | 295 |
End Page Number: | 316 |
Publication Date: | Jul 1998 |
Journal: | Queueing Systems |
Authors: | Buzacott J.A., Cheng D.W. |
Improved bounds are developed for a queue where arrivals are delayed by a fixed time. For moderate to heavy traffic, a simple improved upper bound is obtained which only uses the first two moments of the service time distribution. We show that our approach can be extended to obtain bounds for other types of delayed arrival queues. For very light traffic, asymptotically tight bounds can be obtained using more information about the service time distribution. While an improved upper bound can be obtained for light to moderate traffic it is not particularly easy to apply.