Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2006, Article ID 53570, 15 pages

Algorithmic analysis of the maximum level length in general-block two-dimensional Markov processes

1Department of Statistics and Operations Research, Faculty of Mathematics, Complutense University of Madrid, Madrid 28040, Spain
2Department of Industrial and Manufacturing Engineering and Business, Kettering University, Flint 48439, MI, USA

Received 28 February 2005; Revised 11 May 2005; Accepted 20 June 2005

Copyright © 2006 Jesus R. Artalejo and Srinivas R. Chakravarthy. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Two-dimensional continuous-time Markov chains (CTMCs) are useful tools for studying stochastic models such as queueing, inventory, and production systems. Of particular interest in this paper is the distribution of the maximal level visited in a busy period because this descriptor provides an excellent measure of the system congestion. We present an algorithmic analysis for the computation of its distribution which is valid for Markov chains with general-block structure. For a multiserver batch arrival queue with retrials and negative arrivals, we exploit the underlying internal block structure and present numerical examples that reveal some interesting facts of the system.