SearcharxivSearch

arXiv · 1801.09607

Second Order Asymptotic Properties for the Tail Probability of the Number of Customers in the M/G/1 Retrial Queue

Abstract

When an explicit expression for a probability distribution function $F(x)$ can not be found, asymptotic properties of the tail probability function $\bar{F}(x)=1-F(x)$ are very valuable, since they provide approximations or bounds for system performance, and approaches for computing probability distribution. In this paper, we study tail asymptotic properties for the number of the customers in the $M/G/1$ retrial queueing system. For queueing systems, studies on asymptotic tails have mainly concentrated on the first order asymptotic behavior. To best our knowledge, there is no second order tail asymptotic analysis for retrial queueing models with heavy-tailed service time. Second order asymptotic expansions provide the refined asymptotic results from the first order approximation, and are often more difficult to obtain as expected. The main contribution of this paper is the second order asymptotic analysis for the $M/G/1$ retrial queue.

Explore related subjects

Keep this discovery

BibTeXRIS

Bin Liu, Yiqiang Q. Zhao. 2018-01-29. Second Order Asymptotic Properties for the Tail Probability of the Number of Customers in the M/G/1 Retrial Queue. https://arxiv.org/abs/1801.09607

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