ABSTRACT
We consider a two dimensional reflected random walk on the nonnegative integer quadrant. This random walk is assumed to be skip free in the direction to the boundary, and referred to as a double M/G/1-type process. We are interested in tail asymptotic behavior of its stationary distribution, provided it exists. Assuming the arriving batch size distributions have light tails, we derive supremum for rough decay rates of the marginal stationary distributions in the coordinate directions. We then apply these results to a batch arrival Jackson network with two nodes. It is shown that the stochastic upper bound of Miyazawa and Taylor [4] is not tight except for a special case.
- A. A. Borovkov and A. A. Mogul'skii (2001) Large deviations for Markov chains in the positive quadrant, Russian Math. Surveys 56, 803--916.Google ScholarCross Ref
- W. L. Feller (1971) An Introduction to Probability Theory and Its Applications, 2nd edition, John Wiley&Sons, New York.Google Scholar
- M. Miyazawa (2009) Tail decay rates in double QBD processes and related reflected random walks, to appear in Mathematics of Operations Research. Google ScholarDigital Library
- M. Miyazawa and P. G. Taylor (1997) A geometric product-form distribution for a queueing network with non-standard batch arrivals and batch transfers. Adv. Appl. Prob. 29, 523--544Google ScholarCross Ref
- The tail asymptotic behavior of the stationary distribution of a double M/G/1 process and their applications to a batch arrival Jackson network
Recommendations
The M/G/1 Queue with Finite Workload Capacity
We consider the M/G/1 queueing system in which customers whose admission to the system would increase the workload beyond a prespecified finite capacity limit are not accepted. Various results on the distribution of the workload are derived; in ...
Tail asymptotics for the retrial queue with non-preemptive priority
AbstractStochastic networks with complex structures are key modelling tools for many important applications. In this paper, we consider a specific type of network: retrial queueing systems with priority. This type of queueing system is important in ...
Stationary distributions and optimal control of queues with batch Markovian arrival process under multiple adaptive vacations
We consider an infinite-buffer single server queue with batch Markovian arrival process (BMAP) and exhaustive service discipline under multiple adaptive vacation policy. That is, the server serves until system emptied and after that server takes a ...
Comments