SearcharxivSearch

arXiv · 2005.13942

Analysis of an infinite-buffer batch-size-dependent service queue with discrete-time Markovian arrival process: D-$MAP/G_n^{(a,b)}/1$

Abstract

Discrete-time queueing models find huge applications as they are used in modeling queueing systems arising in digital platforms like telecommunication systems, computer networks, etc. In this paper, we analyze an infinite-buffer queueing model with discrete Markovian arrival process. The units on arrival are served in batches by a single server according to the general bulk-service rule, and the service time follows general distribution with service rate depending on the size of the batch being served. We mathematically formulate the model using the supplementary variable technique and obtain the vector generating function at the departure epoch. The generating function is in turn used to extract the joint distribution of queue and server content in terms of the roots of the characteristic equation. Further, we develop the relationship between the distribution at the departure epoch and the distribution at arbitrary, pre-arrival and outside observer's epoch, which is used to obtain the latter ones. We evaluate some essential performance measures of the system and also discuss the computing process extensively which is demonstrated by a few numerical examples.

Explore related subjects

Keep this discovery

BibTeXRIS

U. C. Gupta, Nitin Kumar, S. Pradhan, F. P. Barbhuiya. 2020-05-28. Analysis of an infinite-buffer batch-size-dependent service queue with discrete-time Markovian arrival process: D-$MAP/G_n^{(a,b)}/1$. https://doi.org/10.1051/ro/2021054

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