In this paper, we present (in terms of roots) a simple closed-form analysis for evaluating system-length distribution at prearrival epochs of the GI/C-MSP/1 queue. The proposed analysis is based on roots of the associated characteristic equation of the vector-generating function of system-length distribution. We also provide the steady-state system-length distribution at an arbitrary epoch by using the classical argument based on Markov renewal theory. The sojourn-time distribution has also been investigated. The prearrival epoch probabilities have been obtained using the method of roots which is an alternative approach to the matrix-geometric method and the spectral method. Numerical aspects have been tested for a variety of arrival- and service-time distributions and a sample of numerical outputs is presented. The proposed method not only gives an alternative solution to the existing methods, but it is also analytically simple, easy to implement, and computationally efficient. It is hoped that the results obtained will prove beneficial to both theoreticians and practitioners.
Multiserver queues are often encountered in telecommunication systems and have special importance in the design of ATM networks. This paper analyzes a discrete-time multiserver queueing system with batch arrivals in which the interbatch and service times are, respectively, arbitrarily and geometrically distributed. Using supplementary-variable and embedded-Markov-chain techniques, the queue is analyzed only for the early arrival system. Since the late arrival system can be discussed similarly, it is not considered here. In addition to developing relations among state probabilities at prearrival, arbitrary, and outside observer's observation epochs, the numerical evaluation of state probabilities is also discussed. It is also shown that, in the limiting case, the relations developed here tend to continuous-time counterparts. Further, the waiting-time distribution of a random customer of a batch is obtained. Finally, in some cases simulation experiments have been performed to validate our results.
In this paper we present closed-form expressions for the distribution of the virtual (actual) queueing time for the BMAP/R/1 and BMAP/D/1 queues, where `R' represents a class of distributions having rational Laplace‒Stieltjes transforms. The closed-form analysis is based on the roots of the underlying characteristic equation. Numerical aspects have been tested for a variety of arrival and service-time distributions and results are matched with those obtained using the matrix-analytic method (MAM). Further, a comparative study of computation time of the proposed method with the MAM has been carried out. Finally, we also present closed-form expressions for the distribution of the virtual (actual) system time. The proposed method is analytically quite simple and easy to implement.
25 November 2014 in Methodology and Computing in Applied Probability