Lattice paths combinatorics applied to transient queue length distribution of C\(_2/\)M/1 queues and busy period analysis of bulk queues C\(_2^b/\)M/1 (Q5957837): Difference between revisions

In the introduction the authors appreciate that a great number of explicit transient solutions of Markovian queues have been derived using analytic combinatorial and lattice path \((\text{LP})\) approaches, e.g. Saaty (1961), Kanwar Sen and Gupta (1993, 1994, 1996, 1998) and others. Lacantoni et al. (1994) and Logothetis et al. (1996) developed numerical computational algorithm for batch Markovian arrival processes (BMAP)/G/1 queues with infinite and finite waiting spaces, respectively. Recently the authors, on approximating the general distribution by \(k\)-phase Cox distribution \(C_k\) that has Markovian property (Cox 1955), obtained transient solutions for both busy period and queue length distribution of M/G/1 system in explicit form, via lattice paths combinatorial analysis. In Section 2, the authors treat the LP approach for C\(_2\)/M/1 system. Section 3 is devoted to the discretized C\(_2\)/M/1. In Section 4 the queue length distribution for the continuous C\(_2\)/M/1 model is derived as a limiting case. In Section 5 the study is extended to the queue \(\text{C}^b_2/\text{M}/1\) and in Section 6 some particular cases have been mentioned. In Section 7, busy period probability for the discretized \(\text{C}^b_2/\text{M}/1\) model has been numerically computed. For other details see the authors' references.