Abstract
AbstractWe study the transient and limiting behavior of a queue with a Pólya arrival process. The Pólya process is interesting because it exhibits path-dependent behavior, e.g. it satisfies a non-ergodic law of large numbers: the average number of arrivals over time [0, t] converges almost surely to a nondegenerate limit as $t \rightarrow \infty$. We establish a heavy-traffic diffusion limit for the $\sum_{i=1}^{n} P_i/GI/1$ queue, with arrivals occurring exogenously according to the superposition of n independent and identically distributed Pólya point processes. That limit yields a tractable approximation for the transient queue-length distribution, because the limiting net input process is a Gaussian Markov process with stationary increments. We also provide insight into the long-run performance of queues with path-dependent arrival processes. We show how Little’s law can be stated in this context, and we provide conditions under which there is stability for a queue with a Pólya arrival process.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference40 articles.
1. [1] Arthur, W. B. (1988). Self-reinforcing mechanisms in economics. In The Economy as an Evolving Complex System, eds P. W. Anderson, K. Arrow and D. Pines. CRC Press, Boca Raton, FL.
2. Uber die Statistik verketteter Vorgange;Pólya;Z. angewandte Mathematische Mechanik,1923
3. Path-dependent processes and the emergence of macro-structure
4. A queueing model with independent arrivals, and its fluid and diffusion limits
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献