Heavy traffic limits for queues with non-stationary path-dependent arrival processes
Kerry Fendick () and
Ward Whitt ()
Additional contact information
Kerry Fendick: Johns Hopkins University Applied Physics Laboratory
Ward Whitt: Columbia University
Queueing Systems: Theory and Applications, 2022, vol. 101, issue 1, No 4, 113-135
Abstract:
Abstract In this paper, we develop a diffusion approximation for the transient distribution of the workload process in a standard single-server queue with a non-stationary Polya arrival process, which is a path-dependent Markov point process. The path-dependent arrival process model is useful because it has the arrival rate depending on the history of the arrival process, thus capturing a self-reinforcing property that one might expect in some applications. The workload approximation is based on heavy-traffic limits for (i) a sequence of Polya processes, in which the limit is a Gaussian–Markov process, and (ii) a sequence of P/GI/1 queues in which the arrival rate function approaches a constant service rate uniformly over compact intervals.
Keywords: Path-dependent stochastic processes; Generalized Polya process; Gaussian Markov process; Diffusion approximations; Queues; Heavy-traffic limit; Primary 60K25; Secondary 60F17; 90B22 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s11134-021-09728-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:101:y:2022:i:1:d:10.1007_s11134-021-09728-5
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/
DOI: 10.1007/s11134-021-09728-5
Access Statistics for this article
Queueing Systems: Theory and Applications is currently edited by Sergey Foss
More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().