## 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.

## Introduction

In this paper, we establish a heavy traffic limit theorem (HTLT) for the standard single-server queue with an exogenous arrival process that is a generalized Polya process (GPP), which we refer to as a *P/GI/1* queue. We then apply that limit to develop a diffusion approximation for the transient distribution of the workload process.

As in Konno [13] and Cha [6], a GPP \(N\equiv \left\{N\left(t\right):t\ge 0\right\}\) is a Markov point process with stochastic intensity (defined in terms of the internal histories \({\mathcal{H}}_{t}\)) by

where \(N\left(0\right)=0\), \(\gamma \) and \(\beta \) are positive constants, \(\kappa \left(t\right)\) is a positive integrable real-valued function, and \(\equiv \) denotes equality by definition. The GPP is interesting and important because it is *path-dependent*, i.e., it fails to have the *asymptotic loss of memory* (ALOM) property, i.e., the influence of early conditions fails to dissipate over time.

This paper extends our paper [9], which established results for the special case of a stationary GPP. Theorem 1 of [9] shows that a GPP is a stationary point process (has stationary increments) if

As discussed in [9], a stationary GPP satisfies a non-ergodic law of large numbers, which causes the queue length process (not normalized by time) to approach infinity with positive probability as time evolves. (For the stationary GPP, we defined path dependence by lack of ergodicity; for the more general GPP, we define path-dependence by the lack of ALOM.)

The GPP is a self-exciting point process like the Hawkes process. Infinite-server queues with Hawkes arrival processes have been studied by Koops et al. [14] and references there. As discussed in [14], self-exciting point processes are interesting to capture overdispersion found in arrival process data, for example [12]. However, as discussed in Remark 3 of [9], the GPP is quite different from the Hawkes process; for example, unlike the GPP, the Hawkes process is always stationary and ergodic and has the ALOM property. The GPP can capture the long-term impact of initial conditions. Very broadly, we are motivated by a non-stationary worldview brought on by climate change and the pandemic in which early conditions may strongly influence long-term outcomes.

In our opinion, the greatest appeal of the heavy-traffic limit for the *P/GI/1* queue with a stationary GPP arrival process in [9] is its remarkable tractability, as illustrated by the explicit three-dimensional distribution of the limit process in Corollary 6 of [9]. That tractability suggests that the GPP can be useful for modelling in practical applications. Our goal in this paper was to see how much of this appealing tractability we could achieve without requiring the stationarity. We succeed in generalizing both the HTLT and a result obtained in Corollary 6 of [9] describing the transient distribution of the queue’s limit process. We also show that a general GPP can be approximated arbitrarily well by a piecewise-stationary GPP, and we use that structure to obtain an explicit transient approximation formula particularly convenient for modeling.

In this paper, we continue to study the much larger class of non-stationary GPPs. Theorem 2 of [9] establishes that a GPP \(\widehat{N}\) with parameter triple \(\left(\widehat{\kappa }\left(t\right),\gamma ,\beta \right)\) can be represented as a deterministic time-transformation of a stationary GPP \(N\) with parameter triple \(\left(\kappa \left(t\right),\gamma ,\beta \right)\), where \(\kappa \) is of the form in (1.2). That property facilitates applying the composition map and the continuous-mapping theorem to establish the more general heavy-traffic limit, but more is required to obtain useful results.

First, we need to specify a heavy-traffic regime. Our approach is to make the system critically loaded over an initial time interval of interest. To achieve that, we let the instantaneous traffic intensity approach 1 uniformly over such intervals. But that in turn depends on a definition of the arrival rate. For that, Theorem 1 here determines the arrival rate \(\lambda \left(t\right)\) (which is defined like \({\lambda }^{*}\left(t\left|{\mathcal{H}}_{t}\right.\right)\) above, but is not conditioned on the history) and shows that a GPP exists with any integrable rate function. As a consequence, Corollary 2 here shows that the parameter triples \(\left(\lambda \left(t\right),\gamma ,\beta \right)\) and \(\left(\kappa \left(t\right),\gamma ,\beta \right)\) are homeomorphic representations of a GPP. Going forward, we use the representation \(\left(\lambda \left(t\right),\gamma ,\beta \right)\), which directly specifies the rate.

Because of the non-stationarity, the diffusion approximation for the transient distribution depends on the entire rate function \(\lambda \left(t\right).\) In the first paper, we exploit full stationarity, which corresponds to the case where \(\lambda \left(t\right)\) is constant. In this paper, we allow the rate function to be a general (positive) function. In order to obtain a transient distribution that depends on a finite number of parameters, we apply Theorem 1 in Corollary 3 to characterize a piecewise-stationary GPP, which we refer to as a \({\psi }^{k}-{\text{GPP}}\) (when there are \(k\) pieces). The rate function for a \({\psi }^{k}-{\text{GPP}}\) is constant on each piece, and it follows that a \({\psi }^{k}-{\text{GPP}}\) has \(k+2\) parameters. Corollary 4 then shows any GPP can be represented as a limit of \({\psi }^{k}-{\text{GPPs}}\). We envision useful applications having relatively small \(k\).

To achieve the desired critical loading here, we consider a sequence of GPPs indexed by \(n\) with parameter triples \(\left({\lambda }^{n}\left(t\right),{\gamma }^{n},{\beta }^{n}\right)=\left(n {\zeta }^{n}\left(t\right),\gamma ,nb\right)\). We then specify the scaling by

where the \({M}_{1}\) topology is used on the function space \(D\), \(u\left(t\right)\equiv 1\) is the unit function, and the \({\mu }^{n}\) are scalar service rates. (The \({M}_{1}\) topology is used throughout rather than a more conventional topology because we either require discontinuous limits approached by continuous functions, for example in Corollaries 2 and 3, or we wish to allow them, as we do in (1.3).) The limit function \(\overline{\eta }\) and scalar \(\overline{\mu }\) define the mean of the limit process for the queue’s net input process. In particular, \(\overline{\eta }\) reflects its non-stationary nature. As a consequence of (1.3), the queue’s instantaneous traffic intensity function \({\rho }^{n}\left(t\right)\), defined as

will approach one uniformly over compact intervals (u.o.c.) as \(n\to \infty .\) With that scaling, we establish a functional central limit theorem (FCLT) for the arrival process and the desired HTLT for the workload process in the *P/GI/1* queue. However, the limit processes both depend on the limit function \(\overline{\eta }\) in (1.3). In order to obtain more useful approximations, in Sect. 3.3 we apply the limit theorems to develop an asymptotic approximation that depends instead on the rate function and the other parameters of the original *P/GI/1* model. To the best of our knowledge, this approach has never been proposed before. In fact, we think that this approximation approach is new even for an \({M}_{t}\) arrival process, i.e., for a non-homogeneous Poisson process (NHPP). In that regard, we mention that results for the NHPP arrival process are covered as a special case here by just setting \(\gamma =0\) (which requires minor modifications in some definitions to avoid dividing by 0).

Since the GPP is an arrival process with a time-varying rate, the limits here are related to previous ones for time-varying single-server queues; see [21], especially Sect. 7.2 for a review. The papers [15] and [22] are relevant. Particularly relevant are the HTLTs for the \({M}_{t}\)/\({M}_{t}\)/1 model in [15] obtained from the strong approximation. The scaling in (1.3) here and the approximation scheme in Sect. 3.3 here are different than used previously.

This paper is organized as follows: In Sect. 2, after reviewing GPPs, we establish Theorem 1, providing the new representation of a GPP in terms of the rate function, and show how to construct piecewise-stationary GPPs. In Sect. 3, we establish limit theorems for the arrival and workload processes and asymptotically correct approximations for those processes. Theorem 2 is the FCLT for the arrival process, while Theorem 3 is the HTLT for the workload process. The new asymptotic approximation is then developed in Sect. 3.3. Finally, Theorem 4 in Sect. 3.4 establishes the approximating transient workload distribution. In Sect. 4, we prove two lemmas used in the proof of Theorem 4. Finally, we provide some concluding discussion in Sect. 5.

## A piecewise-stationary Generalized Polya Process (\({{\varvec{\psi}}}^{{\varvec{k}}}-{\varvec{\text{GPP}}}\))

In this section, we briefly review GPPs, as developed in [6, 9, 13]. Then, we show how to construct a piecewise-stationary GPP with \(k\) pieces, which we refer to as a \({\psi }^{k}-{\text{GPP}}\). We then show that, under regularity conditions, a general GPP can be approximated by a \({\psi }^{k}-{\text{GPP}}\) for suitably large \(k.\)

A GPP with parameter triple \(\left(\kappa \left(t\right),\gamma ,\beta \right)\) is defined in [6] as the orderly point process \(\left\{N\left(t\right):t\ge 0\right\}\) with \(N\left(0\right)=0\) and stochastic intensity function

where \({\mathcal{H}}_{t}\) denotes the internal history of \(N\) up to time \(t\), \(\kappa \left(t\right)\) is a positive-integrable real-valued function, while \(\beta \) and \(\gamma \) are positive real numbers. For background on point processes and their intensity functions, see Sect. 3.3 and 7.2 of [7].

A GPP can be a stationary point process (meaning that it possesses stationary increments) although GPPs are not in general stationary processes.

### Proposition 1

(*Theorem 1 of* [9]) *The GPP* \(\tilde{N }\) *with parameter triple* \(\left(\kappa \left(t\right),\gamma ,\beta \right)\), *where*

*as in (1.2) is a stationary point process with mean and covariance functions*

*Sketch of proof*. By Theorem 1 of [6], if \(N\) is a GPP with parameter triple \(\left(\kappa \left(t\right),\gamma ,\beta \right)\) and

then \(N\left(t\right)\) has a negative binomial distribution with mean \(E\left[N\left(t\right)\right]=\tau p\left(t\right)/\left(1-p\left(t\right)\right)\) and \(Var\left[N\left(t\right)\right]=\tau p\left(t\right)/{\left(1-p\left(t\right)\right)}^{2}\), where \(\tau \equiv \gamma /\beta \) and \(p\left(t\right)=1-\mathrm{exp}\left(-\gamma \mathrm{K}\left(t\right)\right)\). If (1.2) holds, then \(\mathrm{K}\left(t\right)={\gamma }^{-1}\mathrm{log}\left(\gamma t+1\right)\), and \(1-p\left(t\right)=\mathrm{exp}\left(-\gamma \mathrm{ K}\left(t\right)\right)=\kappa \left(t\right)\). The mean and variance of \(\tilde{N }\left(t\right)\) easily follow. The proof of the stationarity of \(\tilde{N }\) from Theorem 1 of [9] uses the property from Theorem 3 and Remark 3 of [6] that the times of increase of a GPP on the interval \(\left[s,t\right]\), conditioned on \(N\left(t\right)-N\left(s\right)=n\), have the distribution of the order statistics of \(n\) i.i.d random variables. When (1.2) holds, those random variables are uniformly distributed. The covariance function in (2.2) follows easily from the mean and variance functions and the stationarity of \(\tilde{N }\).□

The GPP \(\tilde{N }\) from Proposition 1 is called a stationary-increment GPP, or a \(\psi -{\text{GPP}}\) for short, and is specified by the parameter pair \(\left(\gamma ,\beta \right)\). The classical Polya process defined on page 435 of [8] is the \(\psi -{\text{GPP}}\) with parameter pair \(\left(\gamma ,1\right).\)

In this paper, we will make strong use of Theorem 2 of [9], which shows that a general GPP can be represented as a deterministic time transformation of a \(\psi -{\text{GPP}}\). We thus restate it here as Proposition 2. For that purpose, let \(\stackrel{d}{=}\) denote equality in distribution for stochastic processes.

### Proposition 2

*(Theorem 2* of [9]*) Let* \(N\) *be a GPP with parameter tripl*e \(\left(\kappa \left(t\right),\gamma ,\beta \right)\) *and* \(\tilde{N }\) *be the* \(\psi -{\text{GPP}}\) *with parameter pair *\(\left(\gamma ,\beta \right)\)*. Then,*

*if and only if*

*where* \(K(t)\) *is defined in (2.3)*.

We can apply Proposition 2 to derive properties of non-stationary GPPs from those of a corresponding \(\psi -{\text{GPP}}\), as illustrated by the following corollary.

### Corollary 1

*If* \(N\) *is a GPP with parameter triple* \(\left(\kappa \left(t\right),\gamma ,\beta \right)\), *then* \(E[N\left(t\right)]=\beta {\gamma }^{-1}\left(exp\left(\gamma \mathrm{ K}\left(t\right)\right)-1\right)\) *and* \(Cov\left[N\left(s\right),N\left(t\right)\right]=\beta {\gamma }^{-1}exp\left(\gamma \mathrm{ K}\left(t\right)\right)\left(exp\left(\gamma \mathrm{ K}\left(s\right)\right)-1\right)\) *for* \(0\le s\le t\).

###
*Proof*

If \(\tilde{N }\) is the \(\psi -{\text{GPP}}\) with parameter pair \(\left(\gamma ,\beta \right)\), then \(E[\tilde{N }\left(t\right)]=\beta t\) and \(Cov[\tilde{N }\left(s\right)\tilde{N }\left(t\right)]=\beta s\left(1+\gamma t\right)\) by Proposition 1. We then obtain the result by applying Proposition 2.□

It will be helpful to express results for a GPP in terms of its instantaneous mean function \(\lambda \left(t\right)\) and its mean function \(\Lambda \left(t\right)\) which we define and characterize next. The instantaneous mean function \(\lambda \left(t\right)\) is defined as \(\lambda \left(t\right)\equiv {\mathrm{lim}}_{h\to 0}E\left[N\left(t+h\right)-N\left(t\right)\right]/h\). The instantaneous mean function \(\lambda \left(t\right)\) differs from the stochastic intensity function \({\lambda }^{*}\left(t\left|{\mathcal{H}}_{t}\right.\right)\) in (2.1) by not conditioning on the history. The instantaneous mean function is also known as the arrival rate function. We will sometimes refer to it as the rate or the mean rate; for instance, see Remark 2.

We show that, for given parameter pair \((\gamma ,\beta )\), the instantaneous mean function \(\lambda \left(t\right)\) is a one-to-one function of the parameter function \(\kappa \left(t\right)\).

### Theorem 1

(instantaneous mean and mean functions) *If N is a GPP with parameter triple* \(\left(\kappa \left(t\right),\gamma ,\beta \right)\), *then the instantaneous mean function can be expressed as:*

*for* \(\mathrm{ K}\left(t\right)\) *in* (2.3), *so that* \(\lambda \left(t\right)\) *is integrable*. *As a consequence, the associated mean function is*

*where* \(M\left(\mathrm{t}\right)\) *is defined in (2.5), and*

*and*

\(\text{for} \,s\ge 0 \,\text{and} \,0\le t\le u\), where \(\tau \equiv \gamma /\beta .\)

###
*Proof*

The result in (2.7) follows from Corollary 1. The results in (2.6) and (2.8) follow from (2.7). By Corollary 1 and (2.7), \(\Gamma \left(t,u\right)\equiv \mathrm{Cov}\left[N\left(t\right),N\left(u\right)\right]=\left({\int }_{0}^{t}\lambda \left(v\right)dv\right)\left(1+\tau {\int }_{0}^{u}\lambda \left(v\right)dv\right)\) for \(0\le t\le u\). The result in (2.9) is obtained for \(s\ge 0\) through the identity \(\mathrm{Cov}\left[N\left(s+t\right)-N\left(s\right),N\left(s+u\right)-N\left(s\right)\right]=\Gamma \left(s+t,s+u\right)-\Gamma \left(s,s+u\right)-\Gamma \left(s,s+t\right)+\Gamma \left(s,s\right)\). By (2.6) and (2.7), the result in (2.10) holds, and (2.11) follows using (2.1).□

We will consider limits of GPPs. For this purpose, we will exploit the function space \(D\) of all right-continuous real-valued functions on the semi-infinite interval \(\left[0\right.,\left.\infty \right)\) with limits from the left, endowed with one of the Skorohod topologies, as in Sects. 3.3 and 11.5 and Chapter 12 of [20]. These topologies reduce to uniform convergence over compact sets (u.o.c.) when the limit function is continuous. In order to allow for continuous functions converging to discontinuous limits, we use the Skorohod \({M}_{1}\) topology. Convergence in \(D\) under the \({M}_{1}\) metric is implied by u.o.c. convergence. The use of \({M}_{1}\) to denote a metric should not be confused with the use of \(M\) in (2.5) to denote the time-transformation function. Throughout, \(\Rightarrow \) will denote weak convergence of a sequence of random elements of a given topological space. Let \(\left({D}^{k},{M}_{1}\right)\) be the product space with the product topology. (It is used in the proofs of Theorem 2 and Corollary 5.)

### Corollary 2

The function \(\kappa \left(t\right)\) *is an element of* \(\left(D,{M}_{1}\right)\) if and only if \(\lambda \left(t\right)\) *is an element of* \(\left(D,{M}_{1}\right)\), *and* \(\left(\kappa \left(t\right),\gamma ,\beta \right)\) *and* \(\left(\lambda \left(t\right),\gamma ,\beta \right)\) *constitute homeomorphic representations of a GPP.*

###
*Proof*

The one-to-one relationship is established by Theorem 1. The continuity map from \(\kappa \left(t\right)\) to \(\lambda \left(t\right)\) and its inverse follow from their explicit representations in (2.6) and (2.10), because converge of functions in \(\left(D,{M}_{1}\right)\) implies convergence of their integrals; see [17] for background.□

Theorem 1 implies one-to-one relationships between \(\left(\kappa \left(t\right),\gamma ,\beta \right),\) \(\left(\lambda \left(t\right),\gamma ,\beta \right)\), \(\left(\mathrm{ K}\left(t\right),\gamma ,\beta \right)\), \(\left(\Theta \left(t\right),\gamma ,\beta \right)\), and \(\left(\mathrm{M}\left(t\right),\gamma ,\beta \right)\). Convergence of \(\left(\kappa \left(t\right),\gamma ,\beta \right)\) or \(\left(\lambda \left(t\right),\gamma ,\beta \right)\) implies convergence of any of the others, but the converse is not true because convergence of functions does not imply convergence of their derivatives. Therefore, Corollary 2 describes the only homeomorphic representation of a GPP from those among those one-to-one relationships.

###
*Remark 1*

(\(instantaneous\, mean \,representation \,of \,a \,GPP\)). We will use the \(\left(\lambda \left(t\right),\gamma ,\beta \right)\) representation of a GPP for results that follow. In that representation, the first element is the GPP’s instantaneous mean, and the second and third elements are always positive, just as for the \(\left(\kappa \left(t\right),\gamma ,\beta \right)\) representation. As an example, GPPs with parameter triples \(\left(\lambda \left(t\right),\gamma ,\beta \right)\) and \(\left(\lambda \left(t\right),\gamma ,n\beta \right)\) have the same instantaneous mean.

We now apply Theorem 1 to characterize a \({\psi }^{k}-{\text{GPP}}\), a piecewise-stationary GPP with \(k\) pieces.

### Corollary 3

(characterization of a \({\psi }^{k}-{\text{GPP}}\)). If \(N\) *is a GPP with parameter tripl*e \(\left(\lambda \left(t\right),\gamma ,\beta \right)\)*, where*

*for real *\({\lambda }_{i}>0\)*, *\(u\left(t\right)\equiv 1\)*,* and \({t}_{0}\equiv 0\), *then*

*for* \({t}_{i-1}\le t<{t}_{i} \,{\rm and}\, 1\le {i}\le {k}\le \infty ,\) *so that the instantaneous mean* \(\lambda \left(t\right)\) *is piecewise constant and the mean* \(\Lambda \left(t\right)\) *is continuous and piecewise linear,*

*and*

*for* \({t}_{i-1}\le s<{t}_{i}\) and \(0\le t\le u<{t}_{i}-s\)*, where* \(\tau =\gamma /\beta .\) *Furthermore,* \(N\) *is stationary on* \({t}_{i-1}\le t<{t}_{i}\) *for each* \(i\ge 1\).

###
*Proof*

The expressions in (2.13)-(2.15) are special cases of the results in Theorem 1. By Theorem 1 and (2.13), a \({\psi }^{k}-{\text{GPP}}\) can be represented as a piecewise linear time transformation of a \(\psi -{\text{GPP}}\), in which time is scaled by a constant on each piece. The stationarity of the \(\psi -{\text{GPP}}\) on each piece is then preserved by the time transformation, so that a \({\psi }^{k}-{\text{GPP}}\) is piecewise stationary.□

###
*Remark 2*

(\({\it{GPPs}}\) *with constant or piecewise-constant rates*). As a consequence of Corollary 3, a GPP has a piecewise-constant instantaneous mean function \(\lambda \left(t\right)\) if and only if it is a \({\psi }^{k}-{\text{GPP}}.\) In particular, a \({\text{GPP}}\) has a constant rate \(c\) if and only if it is a \(\psi -{\text{GPP}}\) with parameter triple \(\left(\lambda \left(t\right)=cu\left(t\right),\gamma ,\beta \right)\). The \(\psi -{\text{GPP}}\) \(\tilde{N }\) with parameter pair \(\left(\gamma ,\beta \right)\) defined in terms of \(\kappa \left(t\right)\) in (1.2) arises as the special case when \(c=\beta \).

We will consider a sequence of GPPs indexed by \(n\) with parameter triples \(\left({\lambda }^{n}\left(t\right),{\gamma }^{n},{\beta }^{n}\right)\), where \({\lambda }^{n}\left(t\right)\) will denote the instantaneous mean function of the \({n}^{th}\) GPP in the sequence. We will then define the mean function \({\Lambda }^{n}\left(t\right)\) and time-transformation function \({M}^{n}\left(t\right)\) to be

consistently with the definitions in Theorem 1.

### Proposition 3

(continuity for GPPs) *If* \({\widehat{N}}^{n}\) *is a GPP with parameter tripl*e \(\left({\lambda }^{n}\left(t\right),\gamma ,\beta \right)\) *for* \(n\ge 1\)*, where* \({\lambda }^{n}\) *is in* \(D\)*, and* \({\lambda }^{n}\to \lambda >0\) *in* \(\left(D,{M}_{1}\right)\) *as *\(n\to \infty \)*, **then* \({\widehat{N}}^{n}\Rightarrow N\) *in *\(\left(D,{M}_{1}\right)\)*, where* \(N\) *is a GPP with parameter triple *\(\left(\lambda \left(t\right),\gamma ,\beta \right)\)*.*

###
*Proof*

Under the assumptions, \({M}^{n}={{\beta }^{-1}\Lambda }^{n}\to {\beta }^{-1}\Lambda =M\) in \(\left(D,{M}_{1}\right)\), where \({\Lambda }^{n}\left(t\right)\) and \({M}^{n}\left(t\right)\) are defined in (2.16) and \(\Lambda \left(t\right)\) and \(M\left(t\right)\) are defined in (2.7). Applying Proposition 2 twice,

where the weak convergence step follows from continuity of the composition map by applying Theorem 13.2.3 of [20], which uses the fact that \(M\) is continuous and strictly increasing.□

### Corollary 4

*If N is a GPP with parameter triple * \(\left(\lambda \left(t\right),\gamma ,\beta \right)\) *where* \(\lambda \) *is in* \(D\)*, then there exists a sequence* \({\widehat{N}}^{n} \) *of* \({\psi }^{k}-{\text{GPPs}}\) *such that *\({\widehat{N}}^{n} \Rightarrow N\)* in *\(\left(D,{M}_{1}\right)\) *as* \(n\to \infty \).

###
*Proof*

The limit follows from Proposition 3 and Theorem 12.2.2 of [20], which states that any function in \(D\) can be represented as the u.o.c. convergence of a sequence of piecewise-constant functions. At this point, the \({M}_{1}\) topology is used only to ensure that the space \(D\) is endowed with the usual Kolmogorov \(\sigma -\) field; see Sect. 11.5.3 of [20] for further discussion. We can obtain u.o.c. convergence because we can choose the discontinuity points of the converging function to match those of the limit function.□

## The P/GI/1 workload in heavy traffic

Our purpose now is to obtain a HTLT for a sequence of *P/GI/1* queues as the associated sequence of instantaneous time-dependent traffic intensities approaches one u.o.c. and to apply that limit to develop tractable approximations. In Sect. 3.1, we derive a FCLT for the arrival processes. In Sect. 3.2, we define the net input and workload processes for a *P/GI/1* queue and derive an HTLT describing them. In Sect. 3.3, we apply the HTLT to develop asymptotic approximations for the net input and workload processes as functions of their parameters. Finally, in Sect. 3.4 we provide a tractable approximation for the transient distribution of the workload process.

### The functional central limit theorem for the arrival process

We first state a FCLT for a sequence of \(\psi -{\text{GPPs}}\) approaching a zero-mean Gaussian Markov process \(\overline{N }\) with stationary increments, referred to as an \(\psi -{\text{GMP}}\) in [9, 10].

Because the limit process \(\overline{N }\) is a \(\psi -{\text{GMP}},\) it is a zero-mean Gaussian process, so that its distribution (as a process, i.e., its finite-dimensional distributions) is determined by its covariance function. As shown in [14], if \(A\) is a \(\psi -{\text{GMP}}\) with parameter pair \(\left({\alpha }^{*}>0,{\beta }^{*}\le 0\right)\), then

A \(\psi -{\text{GMP}}\) is continuous with probability one. We will apply the following FCLT for \(\psi -{\text{GPPs}}\) from [9] together with Proposition 2 to obtain a FCLT for non-stationary GPPs.

### Proposition 4

(FCLT for \(\psi - {\text{GPPs}}\) from [3]) *If *\({\tilde{N }}_{n}\left(t\right){\equiv n}^{-1/2}({\tilde{N }}^{n}\left(t\right)-nbt)\) *for* \(n\ge 1\)*, where *\({\tilde{N }}^{n}\) *is a *\(\psi -{\text{GPP}}\) *with parameter pair* \(\left(\gamma ,nb\right)\), *then *\({\tilde{N }}_{n}\Rightarrow \overline{N }\) *in* \(\left(D,{M}_{1}\right)\break \) *as* \(n\to \infty \)*, where *\(\overline{N }\)* is the *\(\psi -{\text{GMP}}\) *with parameter pair* \(\left({\alpha }^{*},{\beta }^{*}\right)=\left(b,-b\gamma \right)\)*.*

###
*Proof*

By Proposition 3 of [9], \({\tilde{N }}^{n}\) has the same distribution as the superposition of \(n\) i.i.d \(\psi -{\text{GPPs}}\) each with parameter pair \(\left(\gamma ,b\right)\). The result is then implied by Theorem 4 of [9], since u.o.c. convergence there to a continuous limit is equivalent to \({M}_{1}\) convergence.□

We now establish convergence of a sequence of non-stationary GPPs.

### Theorem 2

(convergence to a \(\psi -{\text{GMP}}\) with time-dependent drift) *If*

*where* \({N}^{n}\) *is a GPP with parameter triple* \(\left({\lambda }^{n}\left(t\right),{\gamma }^{n},{\beta }^{n}\right)=\left(n {\zeta }^{n}\left(t\right),\gamma ,nb\right)\) *for* \({\zeta }^{n}>0\) *a deterministic element of* \(D\) *and* \(b>0\), *and*

*(where* \(\overline{\eta }\) *need not be continuous), then*

*where* \(\overline{N }\) *is the* \(\psi -{\text{GMP}}\) *with parameter pair* \(\left({\alpha }^{*},{\beta }^{*}\right)=\left(b,-b\gamma \right)\) *and* \(\overline{\nu }\left(t\right)={\int }_{0}^{t}\overline{\eta }\left(s\right)ds.\)

###
*Proof*

Using (2.16),

Then, (3.3) implies that

so that

By Proposition 2 and the definitions from Proposition 4,

Then, \(\left({M}^{n},{M}_{n}\right)\to \left(e,{b}^{-1}\overline{\nu }\right)\) in \(\left({D}^{2}, {M}_{1}\right)\) by (3.7). Applying Theorem 11.4.5 of [20], \(\left({\tilde{N }}_{n},{M}^{n},{M}_{n}\right)\to \left(\overline{N },e,{b}^{-1}\overline{\nu }\right)\,{\rm in}\,\left({D}^{3}, {M}_{1}\right)\). The limit preservation in Theorem 13.3.1 of [20] then yields

□

###
*Remark 3*

For an example of a sequence satisfying (3.3), let \({\zeta }^{n}=bu+{n}^{-1/2}\overline{\eta }\) for any \(\overline{\eta }\) in *D.*

### Heavy traffic limit theorem for the queue

We apply Theorem 2 to develop the HTLT for a sequence of *P/GI/1* models, where the arrival process for each model \(n\) is the GPP \({N}^{n}\) defined in Proposition 5. Let \(\left\{{V}_{k}:k\ge 1\right\}\) be the sequence of service requirements of successive arrivals, which we assume for each of the models. There are two key assumptions. The first is that the service requirements are independent of the arrival processes. (That conditions could be replaced by joint convergence.) The second key assumption is that the associated sequence of partial sums satisfies a FCLT. In particular, let

Our key assumption is that

where \(B\) is standard (0 drift, unit variance) Brownian motion. This is the classical Donsker’s theorem in Sect. 4.3 of [20].

A sufficient condition for (3.9) is for the sequence \(\left\{{V}_{k}:k\ge 1\right\}\) to be i.i.d. with \(E\left[{V}_{k}\right]=1\) and \(Var\left[{V}_{k}\right]={c}_{s}^{2}\). That puts us in the setting of the P/GI/1 queue, but the i.i.d. assumption can be relaxed, as illustrated by Sect. 4.4 of [20].

Then, let

be the total input process over the interval \(\left[0,t\right]\) for model \(n.\) It represents the total service requirements of all arrivals in \({N}^{n}\) over the interval \(\left[0,t\right]\). In this context, the net input process is

where \({\mu }^{n}\) is the constant deterministic rate that service is performed when there is work waiting to be served. The corresponding workload process is then defined as the reflection of the net input process, i.e.,

where \(\phi :D\times R\to D\) is the reflection map, defined by

The reflection map describes the workload (or service backlog) for a single-server queue with an infinite buffer. For additional properties of the reflection map, see Sect. 2 of Chapter 2 on pages 19–21 of [11].

We can obtain an FCLT for \({T}^{n}\left(t\right)\) because it is a random sum, as discussed in Sect. 7.4 of [20], or more generally in Sect. 13.3 of [20] (as needed here, because we will apply Proposition 4, which has the \(\psi -{\text{GMP}}\) limit \(\overline{N }\) instead of a Brownian motion limit). We can then use the FCLT for \({T}^{n}\left(t\right)\) to obtain limits \({X}^{n}\left(t\right)\) and \({W}^{n}\left(t\right)\). In particular, let

### Theorem 3

(HTLT for a P/GI/1 queue with non-stationary arrival process) *If* \(\left({N}_{n},{T}_{n},{X}_{n},{W}_{\mathrm{n}}\right)\) *is defined by (3.14)–(3.15), where the definitions in (3.10)-(3.12) apply,* \({N}^{n}\) *is a GPP with parameter triple* \(\left({\lambda }^{n}\left(t\right),{\gamma }^{n},{\beta }^{n}\right)=\left(n {\zeta }^{n}\left(t\right),\gamma ,nb\right)\) for \({\zeta }^{n}>0\) *in *\(D\)*, and*

*then* \(\left({N}_{n},{T}_{n},{X}_{n},{W}_{\mathrm{n}}\right)\Rightarrow \left(\overline{N }+\overline{\nu },\overline{T }+\overline{\nu },\overline{X },\overline{\mathrm{W} }\right)\) *in* \(\left({D}^{4}, {M}_{1}\right),\) *where* \(\overline{N }\) *is the *\(\psi -{\text{GMP}}\) *with parameter pair* \(\left({\alpha }^{*},{\beta }^{*}\right)=\left(b,-b\gamma \right)\)*,* \(\overline{T }\) *is the *\(\psi -{\text{GMP}}\) *with parameter pair* \(\left({\alpha }^{*},{\beta }^{*}\right)=\left(b+b{c}_{s}^{2},-b\gamma \right)\)*, *\(\overline{\nu }\left(t\right)={\int }_{0}^{t}\overline{\eta }\left(s\right)ds\)*, *\(\overline{X}\equiv \overline{\nu }-\overline{\mu }e+\overline{T }\)*, and* \(\overline{W }\equiv \phi \left(\overline{X },\overline{W }\left(0\right)\right).\)

###
*Proof*

Let \(S^{n} \left( t \right) = \sum\nolimits_{k = 1}^{{\left\lfloor {nt} \right\rfloor }} {V_{k} }\), so that \({S}_{n}\left(t\right)={n}^{-1/2}\left({S}^{n}\left(t\right)-nt\right)\) by (3.8). Corollary 13.3.2 of [20] plus Theorem 2 then imply that

Using (3.16) and (3.17),

The conclusion about joint convergence then follows by the continuous mapping theorem.□

###
*Remark 4 *

(Double sequences) It might be more natural to assume that there is a double sequence of service requirements, i.e., that there is a sequence \(\left\{{V}_{k}^{n}:k\ge 1\right\}\) of service requirements of successive arrivals in model \(n\) for each \(n\ge 1\). We would then need a generalization of Donsker’s theorem in Sect. 4.3 of [20] to double sequences or triangular arrays, because we have a sequence \(k\) for each \(n\). An early statement of the direct extension of Donsker’s theorem to double sequences or triangular arrays appears on p. 220 of [18]. The extension is also discussed in Sect. 2.4. of the Internet Supplement to [20]. It requires an additional regularity condition. It would be natural to require that \({V}_{k}^{n}\) have uniformly bounded third moments. Under appropriate assumptions, the same conclusions from Theorem 2 would be obtained when there is a double sequence of service requirements.

### Asymptotic approximation for the prelimit sequence

In order to develop approximations that depend on the parameter triples of the converging processes, we want to replace the unspecified function \(\overline{\nu }\) in the limit from Theorem 3 by a function depending directly on the parameter triple. We provide asymptotic justification for that step now. In Sect. 3.4, we apply the resulting asymptotic approximation to obtain explicit distributional results under additional assumptions about the instantaneous mean function of the arrival process.

A new sequence will now be defined and its asymptotic equivalence to the prelimit sequence from Theorem 2 proven. For that purpose, \({d}_{{M}_{1}}\left(x,y\right)\) will denote the \({M}_{1}\) metric for \(x\) and \(y\) in \(D\) or \({D}^{2}\).

### Corollary 5

(asymptotically equivalent sequence) *Using the definitions and assumptions from Theorem* 3, *let*

*where* \({\mathrm{ Z}}^{n}\left(t\right)\equiv {\int }_{0}^{t}{\zeta }^{n}\left(v\right)dv,\) \({\acute{W}}^{n} \left( 0 \right)\stackrel{d}{=} W^{n} \left( 0 \right)\)*, and* \(\overline{T }\) *is the* \(\psi -{\text{GMP}}\) *with parameter pair* \(\left({\alpha }^{*},{\beta }^{*}\right)=\left(b+b{c}_{s}^{2},-b\gamma \right)\)*. Then*

###
*Proof*

By Theorem 3,

where \(\overline{X }=\overline{\nu }-\overline{\mu }e+\overline{T }.\) Let \({\acute{X}_{n} }\equiv n^{{\frac{ - 1}{2}}} \acute{X}^{n}\) and \(\acute{W}_{n} \equiv n^{{\frac{ - 1}{2}}} \acute{W}^{n} \). Applying (3.5), (3.7), and (3.16),

Using the assumption that \({\acute{W}}^{n}\left(0\right)\stackrel{d}{=}{W}^{n}\left(0\right),\) the continuous mapping theorem then implies that

By (3.21), \({T}_{n}-\overline{\nu }\Rightarrow \overline{T }\) in \(\left(D, {M}_{1}\right)\). We apply the Skorohod representation theorem from Theorem 3.2.2 of [20] to obtain \({d}_{{M}_{1}}\left({T}_{n}-\overline{\nu },\overline{T }\right)\Rightarrow 0\) in \(\mathcal{R}\)*.* The convergence together theorem from Theorem 11.4.7 of [20] then implies that.

Since \({X}_{n}\) and \({W}_{\mathrm{n}}\) are functions of \({T}_{n}\)*,* and \({\acute{X}}_{n}\) and \({\acute{W}}_{n}\) are functions of \(\overline{T }\)*,* we obtain

using (3.21), (3.23), (3.24), and the continuous mapping theorem. The conclusion in (3.20) is then a consequence of (3.25) and the converse of the convergence together theorem in Theorem 11.4.8 of [20].□

For the prelimit sequence satisfying the conditions of Corollary 5, (3.22) implies that

with error that is \(o\left({n}^{1/2}\right)\) as \(n {\to} \infty \) on bounded intervals, i.e., the error is asymptotically negligible for large \(n\) after dividing by \({n}^{1/2}\). On the right-hand side, \({n}^{1/2}\overline{T }\) is the zero-mean Gaussian process with distribution determined by \(Cov\left[{n}^{1/2}\overline{T }\left(s\right),{n}^{1/2}\overline{T }\left(t\right)\right]=nbs\left(1+{c}_{s}^{2}+\gamma t\right)\) for \(0\le s\le t\). By (3.3), it is therefore the \(\psi -{\text{GMP}}\) with parameter pair \(\left({\alpha }^{*},{\beta }^{*}\right)=\left(nb\left(1+{c}_{s}^{2}\right),-nb\gamma \right)\). On the left-hand side, \({N}^{n}\) is a GPP with parameter triple \(\left({\lambda }^{n}\left(t\right),{\gamma }^{n},{\beta }^{n}\right)=\left(n{\zeta }^{n}\left(t\right),\gamma ,nb\right)\). We can therefore eliminate explicit reference to \(n\) from (3.26) for any particular \(n\) by substituting \(\lambda \left(t\right)\equiv n{\zeta }^{n}\left(t\right)\), \(\Lambda \left(t\right)\equiv n{\mathrm{ Z}}^{n}\left(t\right)\), \(\beta \equiv nb\), \(\mu \equiv n{\mu }_{n}\), and \( \overline{\overline{T}}\left(t\right)\equiv {n}^{1/2}\overline{T }\left(t\right)\). With those substitutions, (3.26) becomes

where \(N\) is then the GPP with parameter triple \(\left(\lambda \left(t\right),\gamma ,\beta \right)\), \( \overline{\overline{T}}\) is the \(\psi -{\text{GMP}}\) with parameter pair \(\left({\alpha }^{*},{\beta }^{*}\right)=\left(\beta +\beta {c}_{s}^{2},-\beta \gamma \right)\), and \(\mu \) is the service rate. The parameters \(\beta \), \(\mu \), \(\lambda \left(t\right)\) are large when the index \(n\) is large before the substitutions.

Recall that \(\Lambda \left(t\right)={\int }_{0}^{t}\lambda \left(s\right)ds\) is the mean function of \(N\) and observe that the right-hand side of (3.22) is then determined by the parameter triple \(\left(\lambda \left(t\right),\gamma ,\beta \right)\), the squared coefficient of variation \({c}_{s}^{2}\), and the service rate \(\mu \). As with approximations obtained from classical HTLTs, the approximation in (3.27) is not necessarily accurate for particular choices of those parameters, but Theorem 1 provides the qualitative criteria that \(\mu \) and \(\lambda \left(t\right)\) both should be close to \(\beta \) for the approximations to be accurate.

### The transient distribution

According to the results in Sect. 3.3, we can approximate the workload process for a *P/GI/1* queue by the reflection of a \(\psi -{\text{GMP}}\) with time-dependent drift. A \(\psi -{\text{GMP}}\) is a generalization of Brownian motion, and the transient distribution of reflected Brownian motion (RBM) with constant drift is well known; see Chapter 1 of [11], Chapter 8 of [16, 1], and [2]. The transient distribution of a reflected \(\psi -{\text{GMP}}\) with constant drift was derived in [10] and applied in [9] for \(\psi -{\text{GPPs}}\). We generalize that result for the case when the drift is time-dependent to describe the transient distribution of the reflection on an interval conditional on history up to the start of the interval. That holds when the drift is any time-dependent function in \(D\) prior to the interval but is constant on the interval. The time-dependent drift prior to the interval enters into the transient distribution on the interval because the increments of a \(\psi -{\text{GMP}}\) are dependent.

The proof uses two lemmas from Sect. 4. Lemma 1 restates a result from (30) in [9] on the transient distribution of a reflected \(\psi -{\text{GMP}}\) with constant drift. A new proof based on the proof for RBM in [11] is provided. Lemma 2 is a new result describing the transient distribution of a \(\psi -{\text{GMP}}\) with time-dependent drift conditional on its history. That result is analogous to the restart property for GPPs described in Proposition 1 of [9] and originally derived in [6]. The lemmas are applied using the memoryless property of the reflection map from Proposition 10 on page 21 of [11].

The approximation in (3.27) reduces as a special case to

where \(X\) is the net input process and \(W\) is the workload process for a P/D/1 queue with service rate \(\mu \), squared coefficient of variation \({c}_{s}^{2}\), and arrival process with parameter triple \(\left(\lambda \left(t\right),\gamma ,\beta \right),\) and where

while \( \overline{\overline{T}}\) is the \(\psi -{\text{GMP}}\) with parameter pair \(\left({\alpha }^{*},{\beta }^{*}\right)=\left(\beta +\beta {c}_{s}^{2},-\beta \gamma \right).\)

Then,

We provide an explicit expression for the cumulative distribution function (cdf) on the right-hand side.

### Theorem 4

*If* \(\acute{X}\) *and* \(\acute{W}\) *are defined as in (3.29), where* \(\lambda \left(v\right)=\lambda \left(s\right)\) *for* \(s\le v\le s+t\) *and* \(P\left(\acute{W}\left(0\right)={w}_{0}\right)=1\), *then*

*where*

*while* \(\Phi \left(t\right)\) *is the standard normal cdf, and*

###
*Proof*

Let \({\acute{W}}_{s}\left(h\right)\equiv \acute{W}\left(s+h\right),\) \({d}_{s}\acute{X}\left(h\right)\equiv \acute{X}\left(s+h\right)-\acute{X}\left(s\right)\), and \({\acute{X}}_{s}\left(h\right)\equiv \left({d}_{s}\acute{X}\left(h\right)\left|\acute{X}\left(s\right)={x}_{s}\right.\right)\) for \(0\le h\le t\). By the memoryless property of the reflection map from Proposition 10 on page 21 of [11], \({\acute{W}}_{s}\equiv \phi \left({d}_{s}\acute{X}, \mathop {\acute{W}}\limits \left( s \right)\right)\) with probability 1. Then, with probability 1,

where the next-to-last equality holds by the Markov property of \(\acute{X}\), the definition of \(\acute{W}\), and the assumption that \(P\left(\acute{W}\left(0\right)={w}_{0}\right)=1\) (which implies that \(\acute{X}\) is independent of \(\acute{W}\left(0\right)\)). By Lemma 2 in Sect. 4, \({\acute{X}}_{s}\) in the final expression of (3.34) is a \(\psi -{\text{GMP}}\) on \(\left[0,t\right]\) with parameter pair \(\left({\alpha }^{*},{\beta }_{s}^{*}\right)\) and drift \({\omega }_{s}\). The result in (3.31)–(3.33) then follows from Lemma 1 in Sect. 4 with the substitutions there of \({\alpha }^{*}=\beta \), \({\beta }^{*}={\beta }_{s}^{*}\) and \(\omega ={\omega }_{s}\) in (3.33).□

Theorem 4 may be applied when the instantaneous mean function has been estimated for the past, a forecast is needed, and the best available estimate of the mean function over the forecast horizon is the estimate that has been obtained for its value at the current time. To estimate the instantaneous mean function, a parametric form would generally need to be assumed. Corollary 4 suggests that not much generality will be lost by assuming that the arrival process is a \({\psi }^{k}-{\text{GPP}}\), for which the instantaneous mean function is piecewise constant.

We describe how Theorem 4 applies when the arrival process is a \({\psi }^{k}-{\text{GPP}}\).

### Corollary 6

*If* \(\acute{X}\,{\rm and}\,\acute{W}\) *are defined as in (3.29)**, where* \(P\left(\acute{W}\left(0\right)={w}_{0}\right)=1\) and \(\lambda \left(t\right)={\lambda }_{i}u\left(t\right)\) *for* \({t}_{i-1}\le t<{t}_{i}\) *and* \(1\le {i}\le {k}\le \infty \)*, and if* \({t}_{i-1}\le s<s+t<{t}_{i}\) *for some* \(i,\) *then* (3.31)-(3.33) *hold, where*

## Lemmas for Theorem 4

We state and prove two lemmas used in the proof of Theorem 4. The lemmas are discussed in Sect. 3.4.

A zero-mean real-valued Gaussian process \(\left\{A\left(t\right):0\le t<\mathrm{T}\right\}\) is defined in [10] to be a \(\psi -{\text{GMP}}\) with parameter pair \(\left({\alpha }^{*},{\beta }^{*}\right)\) if \(A\left(0\right)=0\) and \(Cov\left[A\left(s\right),A\left(t\right)\right]=s\left({\alpha }^{*}-{\beta }^{*}t\right) \,{\rm}\, for\, 0\le s\le t<\mathrm{T}\), where \({\alpha }^{*}>0\) and \({\infty <\beta }^{*}<\infty \). If \({\beta }^{*}>0\), then it is necessary that \(\mathrm{T}\le {\alpha }^{*}/{\beta }^{*}\); otherwise, \(\mathrm{T}\le \infty \). When \(A\) is defined in that way, the process

is called a \(\psi -{\text{GMP}}\) on \(\left[0,\right.\left.\mathrm{T}\right)\) with parameter pair \(\left({\alpha }^{*},{\beta }^{*}\right)\) and drift \(\omega \). If \({\beta }^{*}=0\), then \({X}^{*}\) is Brownian motion with \(Var\left[{X}^{*}\left(t\right)\right]={\alpha }^{*}t\) and drift \(\omega \).

The first lemma is a special case of Theorem 5 from [10]. We provide a different proof below derived from first principles and closely following the proof in [11] for the RBM case. The proof of Theorem 3 will apply the lemma when \({\beta }^{*}<0.\) The result below, which holds regardless of the sign of the parameter \({\beta }^{*}\), is therefore more general than we will require for Theorem 3. Recall that \(\phi \) is the reflection map defined in (3.13).

### Lemma 1

*If* \({X}^{*}\) *is defined as in (4.1) and* \({W}^{*}\equiv \phi \left({w}_{0},{X}^{*}\right)\)*, then*

*where* \(w\ge 0\), \(0\le h<T\)*, and* \(\Phi \left(z\right)\equiv {\left(2\pi \right)}^{-1/2}{\int }_{-\infty }^{z}exp\left(-{y}^{2}/2\right)dy\) *is the standard normal cdf.*

###
*Proof*

Case 1: \({\beta }^{*}>0.\)

Let

Then, \(B\) is standard Brownian motion because it is a zero-mean Gaussian process with \(Cov\left[B\left(s\right),B\left(t\right)\right]=s\) for \(s\le t\); see page 184 of Adler [3] for a discussion of that definition. Furthermore

using (4.1) and (4.3).

Because \(1+s{\beta }^{*}>0\) when \(s\ge 0\), it follows from (4.4) that

where \(\eta \equiv \omega {\alpha }^{*}+\left({w}_{0}-\mathrm{y}\right){\beta }^{*}\).

By (4.4)–(4.5),

Applying the change of measure theorem on page 10 of [11] followed by the Reflection Principle on pages 7–9 of [11], we obtain

Using (4.6) and (4.7),

Using the definitions from (3.15), (4.2), (4.4), (4.6), and (4.8),

Substituting (4.8) into (4.9), the integrals on the right-hand side of the final equality in (4.9) can be solved by completing the squares in the exponent; see page 13 of Harrison [11] for an example where completing the squares is applied in the RBM case. We conclude that

where \({\Phi }^{^{\prime}}\left(z\right)\equiv \left(d/dz\right)\Phi \left(z\right)\) is the standard normal pdf. Differentiating the cdf in (4.2), we confirm that it agrees with the probability density function in (4.10).

Case 2: \({\beta }^{*}<0\).

Replace the condition in (4.3) that \(t\ge 0\) with the condition that \(0\le t<T/\left({\alpha }^{*}-T{\beta }^{*}\right).\) Then, the argument of \(A\left(\cdot \right)\) in (4.3) is still constrained to the interval \(\left[0,\left.T\right)\right.\), and the term \(1+t{\beta }^{*}\) in (4.3) is still always positive. With that modification, the remainder of the proof for Case 1 holds with no additional changes.□

The second lemma describes the distribution of a \(\psi -{\text{GMP}}\) with time-dependent drift conditional on its history.

### Lemma 2

*Let*
\(\acute{X}\left(t\right)\equiv\Lambda \left(t\right)-\mu t+ \overline{\overline{T}}\left(t\right)\)
*for*
\(t\ge 0\)
*where*
\(\mu \)
*is real,*
\(\Lambda \left(t\right)={\int }_{0}^{t}\uplambda \left(v\right)dv\)
*for*
\(\uplambda \left(v\right)\)
*real and integrable, and*
\( \overline{\overline{T}}\)
*is the*
\(\psi -{\text{GMP}}\)
*with parameter pair*
\(\left({\alpha }^{*},{\beta }^{*}\right)=\left(\beta +\beta {c}_{s}^{2},-\beta \gamma \right)\)
*. If*
\(\uplambda \left(v\right)=\uplambda \left(s\right)\)
*for*
\(0\le s\le v<s+T\)
*, then*

*is a*
\(\psi -{\text{GMP}}\)
*on*
\(\left[0,\left.T\right)\right.\)
*with parameter pair*
\(\left({\alpha }^{*},{\beta }_{s}^{*}\right)\)
*and constant drift*
\({\omega }_{s}\)
*, where*

###
*Proof*

Under the assumptions,

for \(s\ge 0\) and \(0\le t<\mathrm{T}\), and

Since \(\acute{X}\) is a Gaussian process, so is \({\acute{X}}_{s}\). We substitute (4.13) and (4.14) into well-known formulas for the conditional mean and covariance of the multivariate normal distribution, for example from Sect. 6.2.2 of [19], to obtain

and

\(\mathrm{for}\,\, 0\le t\le u<\mathrm{T}\). The result that \({\acute{X}}_{s}\) is a \(\psi -{\text{GMP}}\) on \(\left[0,\right.\left.\mathrm{T}\right)\) with parameter pair \(\left({\alpha }^{*},{\beta }_{s}^{*}\right)\) and drift \({\omega }_{s}\) then follows from the definition of a \(\psi -{\text{GMP}}\) with constant drift.□

## Concluding discussion

### Extensions of GPPs

GPPs were described in [6] as a tractable generalization of NHPPs allowing for dependence between increments. According to (2.11), a GPP is defined by only a single scaler parameter beyond the instantaneous rate function that defines a NHPP. As discussed in Sect. 3.4, a GPP possesses a restart property that is useful for modeling: its future increments given its history are another GPP with modified parameters. The asymptotic approximation obtained in this paper for a GPP is even more tractable than a GPP itself, as Theorem 4 illustrates, and possesses its own restart property, as Lemma 2 shows.

Generalizations of GPPs have been considered. Section 4.1 of [13] considered a generalization where the parameters \(\beta \) and \(\gamma \) in (2.1) are themselves functions of time, but showed that the method used in that paper to obtain an exact analytic solution for the marginal distributions of a GPP’s state fails for the generalization. A generalization of a GPP considered in [4] is where the linear function of \(N\left(t-\right)\) that multiplies \(\kappa \left(t\right)\) in (1.1) is replaced by a general positive function. That paper derives several properties of the resulting process including the marginal distribution of its state and a version of the restart property.

In order to apply results on stationary GPPs from [9], the proofs of the limit theorems here rely on Proposition 2, which shows that a process is a GPP if and only if it is a time-transformation of a stationary GPP. (The time transformation must be the integral of a density function.) The proofs here therefore do not extend directly for either of the generalizations discussed above. It remains to study how limit theorems might be derived for such generalizations.

### Motivation in application

As indicated in [9], there has long been interest in systems with path-dependent behavior. It is important to consider the possibility that ALOM may not be satisfied. For example, with a queue representing the backlog of tests at a COVID-19 testing site, a small cluster of infections randomly occurring in the area of the site early in the epidemic may spread and influence subsequent infection rates. The intensity of demand for testing would then depend on prior demand, increases in demand would be self-reinforcing, and the influence of early conditions would persist. The spread of COVID-19 was assumed to have such characteristics in [5] and modeled there as a GPP; see (8) of [5] for the particular GPP intensity function used. It remains to seriously study models of queues arising in such applications.

The asymptotic approximation obtained here for the transient distribution of a *P/GI/1* queue is applicable in a critically loaded regime where the GPP’s instantaneous rate \(\lambda \left(t\right)\) does not vary too much from the service rate \(\mu \). (The function \(\kappa \left(t\right)\) in (2.1) therefore cannot differ too much from the form in (1.2) for a stationary GPP.) Although such conditions may not hold at all times in practice, the approximation developed here may be applied over any interval where such conditions do hold, as justified by the GPP’s restart property. Critically loaded intervals are particularly interesting because that is where significant queue lengths are likely and their evolution differs significantly from that of the queue’s unreflected net input process.

## References

Abate, J., Whitt, W.: Transient behavior of regulated Brownian motion, I: starting at the origin. Adv. Appl. Probab.

**19**(3), 560–598 (1987)Abate, J., Whitt, W.: Transient behavior of regulated Brownian motion, II: non-zero initial conditions. Adv. Appl. Probab.

**19**(3), 599–631 (1987)Adler, R.J.: The Geometry of Random Fields. Wiley, Chichester (1981)

Badia, F.G., Mercier, S., Sanguesa, C.: Extensions of the generalized Polya process. Method Comput Appl Prob

**21**, 1057–1085 (2019)Barraza, N.R, Pena, G., Moreno, V.: A non-homogeneous Markov early epidemic growth dynamics model.

*Chaos, Solitions & Fractals,*vol. 139: 110297, (2020).Cha, T.H.: Characterization of the generalized Polya process and its applications. Adv. Appl. Probab.

**46**(4), 1148–1171 (2014)Daley, D.J., Vere-Jones, D. An Introduction to the Theory of Point Processes: Volume I; Elementary Theorems and Methods, 2nd edn, Springer, New York (2003)

Feller, W., An Introduction to Probability Theory and its Applications, Vol. 1, 3rd edn, John Wiley, New York (1968)

Fendick, K.W., Whitt, W.: Queues with path-dependent arrival processes. J. Appl. Probab.

**58**, 484–504 (2021)Fendick, K.: Brownian motion minus the independent increments: representation and queuing application.

*Probability in the Engineering and Informational Sciences,*To appear.Harrison, J.M.: Brownian Motion and Stochastic Flow Systems. Wiley, New York (1985)

Kim, S.-H., Whitt, W.: Are call center and hospital arrivals well modeled by nonhomogeneous Poisson processes. Manuf. Serv. Oper. Manag.

**16**(3), 464–480 (2014)Konno, T.H.: On the exact solution of a generalized Polya process. Adv. Math. Phys., vol. Article ID 504267 (2010)

Koops, D., Saxena, M., Boxma, O.J., Mandjes, M.: Infinite-serve queues with Hawkes input. J. Appl. Probab.

**55**, 920–943 (2018)Mandelbaum, A., Massey, W.A.: Strong approximations for time-dependent queues. Math. Oper. Res.

**20**(1), 33–64 (1995)Newell, G.F.: Applications of Queueing Theory, 2nd edn. Chapman and Hall, New York (1982)

Pang, G., Whitt, W.: Continuity of a queueing integral representation in the M

_{1}topology. Annals of Applied Probability**1**(1), 214–237 (2010)Parthasarathy, K.R.: Probability Measures on Metric Spaces. Academic Press, New York (1967)

Puntanen, S., Styan, G.P.: Schur complements in statistics and probability. In: Schur Complement and Its Applications, Numerical Methods and Algorithms, vol. 4. Springer, pp. 163–226 (2005)

Whitt, W.: Stochastic-Process Limits. Springer, New York (2002)

Whitt, W.: Time varying queues. Que. Mod. Serv. Manag.

**1**(2), 79–164 (2018)Whitt, W., You, W.: Time-varying robust queueing. Oper. Res.

**67**(6), 1766–1782 (2019)

## Author information

### Authors and Affiliations

### Corresponding author

## Ethics declarations

### Conflict of interest

The authors declared that there is no conflict of interest.

## Additional information

### Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## Rights and permissions

## About this article

### Cite this article

Fendick, K., Whitt, W. Heavy traffic limits for queues with non-stationary path-dependent arrival processes.
*Queueing Syst* **101, **113–135 (2022). https://doi.org/10.1007/s11134-021-09728-5

Received:

Revised:

Accepted:

Published:

Issue Date:

DOI: https://doi.org/10.1007/s11134-021-09728-5

### Keywords

- Path-dependent stochastic processes
- Generalized Polya process
- Gaussian Markov process
- Diffusion approximations
- Queues
- Heavy-traffic limit

### Mathematics Subject Classification

- Primary 60K25
- Secondary 60F17
- 90B22