Embedded renewal processes in theGI/G/squeue
Ward Whitt · Journal of Applied Probability · 1972
The stableGI/G/squeue (ρ < 1) is sometimes studied using the “fact” that epochs just prior to an arrival when all servers are idle constitute an embedded persistent renewal process. This is true for theGI/G/1 queue, but a simpleGI/G/2 example is given here with all interarrival time and service time moments finite and ρ < 1 in which, not only does the system fail to be empty ever with some positive probability, but it is never empty. Sufficient conditions are then given to rule out such examples. Implications of embedded persistent renewal processes in theGI/G/1 andGI/G/squeues are discussed. For example, functional limit theorems for time-average or cumulative processes associated with a large class ofGI/G/squeues in light traffic are implied.
Cited by 67 works. doi:10.2307/3212333
Authors
References
- An introduction to probability theory and its applications
- A Course in Probability Theory
- Principles of Random Walk
- The theory of queues with a single server
- Renewal Theory and its Ramifications
- An Introduction to Probability Theory and its Applications
- Regenerative stochastic processes
- The stability of a queue with non-independent inter-arrival and service times
- On the theory of queues with many servers
- On the distribution of queueing times