On queues with periodic inputs
- 1 March 1989
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 26 (02) , 381-389
- https://doi.org/10.1017/s0021900200027364
Abstract
We consider a single-server queue with a periodic and ergodic input. It is shown that if the traffic intensity is less than 1, then the waiting time process is asymptotically periodic. Limit theorems associated with the asymptotic behavior of the queue are also proven. The results are then extended to acyclic networks of queues with periodic inputs. Particular cases of these results had been previously obtained for a single queue with periodic Poisson arrival input process and with independent and identically distributed service times.Keywords
This publication has 5 references indexed in Scilit:
- The asymptotic behavior o queues with time-varying arrival ratesJournal of Applied Probability, 1984
- On queues with periodic Poisson inputJournal of Applied Probability, 1981
- Queues with non-stationary input stream: Ross's conjectureAdvances in Applied Probability, 1981
- Limit theorems for periodic queuesJournal of Applied Probability, 1977
- The stability of a queue with non-independent inter-arrival and service timesMathematical Proceedings of the Cambridge Philosophical Society, 1962