On queues with periodic inputs

The authors 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 peridic. 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.