Using Factorization in Analyzing D-bmap/g/1 Queues
نویسندگان
چکیده
The discrete-time batch Markovian arrival process (D-BMAP) was first defined in [2]. The D-BMAP can represent a variety of arrival processes which include, as special cases, the Bernoulli arrival process, the Markov-modulated Bernoulli process (MMBP), the discrete-time Markovian arrival process (D-MAP), and their superpositions. It is the discrete-time version of the versatile Markovian point process introduced by Neuts [28], the N-process of Ramaswami [31], and the batch Markovian arrival process of Lucantoni [25, 26]. The objective of this paper is to demonstrate how one can apply the factorization property to the derivation of the queue-length distributions of the D-BMAP/G/1 queues with complex operational behavior during the idle period. To demonstrate how this new approach works, we are going to analyze the D-BMAP/G/1 queueing system under a double threshold policy and a setup time, which becomes the basic model for many production systems. The approach in this paper is simpler than the conventional matrix analytic method (MAM) and the supplementary variable technique. The MAM was pioneered by Neuts [29]. It starts with the analysis of the imbedded Markov renewal process at departure epochs. This method is cumbersome, especially in a system with a high degree of behavioral complexities during the idle period, in that it involves manipulating the vast amount of matrices without knowing the practical meaning of the resulting matrices. Works based on MAM are many. Blondia and Casals [2] modeled a digital video communication system by D-BMAP. Hashida et al. [7] analyzed the system with switched batch Bernoulli process (SBBP) with and without priorities. Ishizaki et al. [10] analyzed the SBBP/G/1 system in which the staying time of the underlying
منابع مشابه
A factorization property for BMAP/G/1 vacation queues under variable service speed
This paper proposes a simple factorization principle that can be used efficiently and effectively to derive the vector generating function of the queue length at an arbitrary time of the BMAP/G/1/ queueing systems under variable service speed. We first prove the factorization property. Then we provide moments formula. Lastly we present some applications of the factorization principle.
متن کاملBMAP/G/1-Queues: Properties of the Fundamental-Period-Matrix G
One of the core problems in analyzing queues with batch Markovian arrival pro-cesses is the efficient computation of the fundamental-period-matrix G. In order to provide additio-nal insights into the relationsships between the various determinative matrices of those systems, we show that certain commutativity properties lead to an elegant proof of the exponential form of the matrix G, and that ...
متن کاملThe Inhomogeneous Bmap/g/∞ Queue
In queueing theory, most models are based on time-homogeneous arrival processes and service time distributions. However, in communication networks arrival rates and/or the service capacity usually vary periodically in time. In order to reflect this property accurately, it is most natural to consider inhomogeneous arrival processes in queueing models. In the present paper, the inhomogeneous BMAP...
متن کاملOn the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals
We consider finiteand infinite-capacity queues with discrete-time batch Markovian arrival processes (D-BMAP) under the assumption of the Late Arrival System with Delayed Access as well as the Early Arrival System. Using simple arguments such as the balance equation, “rate in = rate out,” we derive relationships among the stationary queue lengths at arrival, at departure, and at random epochs. S...
متن کاملConvolution Algorithms for BMAP/G/1-Queues
The equilibrium state probabilities for queues with batch Markovian arrival processes are determined in form of matrix expressions, in which the central item to be computed is the so called fundamental-period-matrix G . G appears as the solution of the non-linear matrix equation G = AνG ν Σ , or as the infinite sum over matrices Gν , which in turn are functions of the matrices Aν as has been sh...
متن کامل