Author:
Bambos Nicholas,Walrand Jean
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.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference14 articles.
1. Stationary Random Processes Associated with Point Processes
2. Konstantopoulos T. and Walrand J. (1989) Stationarity and stability of fork-join networks. J. Appl. Prob. 26.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Exact Simulation of Non-Stationary Reflected Brownian Motion;SSRN Electronic Journal;2013
2. Transient Solution;Constructive Computation in Stochastic Models with Applications;2010
3. The periodic BMAP/PH/c queue;Queueing Systems;2001
4. A sample path analysis of the M-t/M-t/c queue;Queueing Systems;1999
5. Per-stream jitter analysis in CBR ATM multiplexors;IEEE/ACM Transactions on Networking;1998-04