In this paper, it is studied about finite buffer bulk service queue M/G (a,b) /1 with multiple vacations and some analytical results, relations among queue length distributions, computations of state probabilities at various epochs are included.

In this paper, a bulk arrival general bulk service queueing model delayed service with restricted vacation policy, variant arrival rate and setup time is considered. The server starts the service only if at least ‘a’ customers are waiting in the queue, and renders the service according to the general bulk service rule with minimum of ‘a’ customers and maximum of ‘b’ customers, then the server w...

A general framework is developed for analyzing a wide class of vehicle dispatching strategies for bulk arrival, bulk service queues. A simple derivation of the queue length transform for the imbedded Markov chain is provided and a new computational procedure is developed for finding the moments of the queue length distribution. Extensive computational tests are reported which demonstrate that t...

In this paper we present eecient and practical extensions of the randomized Parallel Priority Queue (PPQ) algorithms of Ranade et al., and eecient randomized and deterministic algorithms for the problem of list contraction on the Bulk-Synchronous Parallel (BSP) model. We also present an experimental study of their performance. We show that our algorithms are communication eecient and achieve sm...

The abstract Cauchy problem for the non-stationary bulk queue M(t)|M[k, B]|1 Abstract We derived state probability equations describing the queue M (t)| M [k, B]|1 and formulated as an abstract Cauchy problem to investigate by means of the semi-group theory of bounded linear operators in functional analysis. With regard to the abstract Cauchy problem of this queue, we determined the eigenfuncti...

In this paper, we analyze a bulk input Geom/Geom/1 queue with single working vacation. Using the matrix analysis method, highly complicated PGF of the stationary queue size is firstly derived, from which we got the stochastic decomposition result for the PGF of the stationary queue size. It is important that we find the biparameter addition theorems of the conditional negative binomial distribu...

In commonly used approaches for the discrete-time bulk service queue, the stationary queue length distribution follows from the roots inside or outside the unit circle of a characteristic equation. We present analytic representations of these roots in the form of sample values of periodic functions with analytically given Fourier series coefficients, making these approaches more transparent and...