SearcharxivSearch

arXiv · 1412.2321

On Transitory Queueing

Abstract

We introduce a framework and develop a theory of transitory queueing models. These are models that are not only non-stationary and time-varying but also have other features such as the queueing system operates over finite time, or only a finite population arrives. Such models are relevant in many real-world settings, from queues at post-offces, DMV, concert halls and stadia to out-patient departments at hospitals. We develop fluid and diffusion limits for a large class of transitory queueing models. We then introduce three specific models that fit within this framework, namely, the Delta(i)/GI/1 model, the conditioned G/GI/1 model, and an arrival model of scheduled traffic with epoch uncertainty. We show that asymptotically these models are distributionally equivalent, i.e., they have the same fluid and diffusion limits. We note that our framework provides the first ever way of analyzing the standard G/GI/1 model when we condition on the number of arrivals. In obtaining these results, we provide generalizations and extensions of the Glivenko-Cantelli and Donskers Theorem for empirical processes with triangular arrays. Our analysis uses the population acceleration technique that we introduce and develop. This may be useful in analysis of other non-stationary and non-ergodic queuing models.

Explore related subjects

Keep this discovery

BibTeXRIS

Harsha Honnappa, Rahul Jain, Amy R. Ward. 2014-12-07. On Transitory Queueing. https://arxiv.org/abs/1412.2321

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR