Hostname: page-component-76fb5796d-wq484 Total loading time: 0 Render date: 2024-04-27T20:22:13.478Z Has data issue: false hasContentIssue false
  • English
  • Français

WAITING TIME CHARACTERISTICS IN CYCLIC QUEUES

Published online by Cambridge University Press:  01 July 2004

Sanne R. Smits ,
Ivo Adan  and
Ton G. de Kok
Sanne R. Smits
Affiliation:
Department of Technology Management, Eindhoven University of Technology, 5600 MB, Eindhoven, The Netherlands
Ivo Adan
Affiliation:
Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 MB, Eindhoven, The Netherlands, E-mail: iadan@win.tue.nl
Ton G. de Kok
Affiliation:
Department of Technology Management, Eindhoven University of Technology, 5600 MB, Eindhoven, The Netherlands
Get access Rights & Permissions [Opens in a new window]

Abstract

In this article, we study a single-server queue with FIFO service and cyclic interarrival and service times. An efficient approximative algorithm is developed for the first two moments of the waiting time. Numerical results are included to demonstrate that the algorithm yields accurate results. For the special case of exponential interarrival times, we present a simple exact analysis.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 18 , Issue 3 , July 2004 , pp. 299 - 313
Copyright
© 2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Cohen, J.W. (1996). Periodic Pollaczek waiting time processes. In C.C. Heyde, Y.V. Prohorov, R. Pyke, & S.T. Rachev (eds.), Athens Conference on Applied Probability and Time Series Analysis: Applied Probability in Honor of J.M. Gani, pp. 361–377. New York: Springer-Verlag.
de Kok, A.G. (1989). A Moment-iteration method for approximating the waiting-time characteristics of the GI/G/1 queue. Probability in the Engineering and Informational Sciences 3: 273–287.Google Scholar
Morrice, D.J. & Gajulapalli, R.S. (1994). A single server queue with cyclically indexed arrival and services rates. Queueing Systems 15: 165–198.Google Scholar
Tijms, H.C. (1994). Stochastic models: An algorithmic approach. Chichester: Wiley.