Sciweavers

EOR
2007

Analysis of the queue-length distribution for the discrete-time batch-service Geo

13 years 4 months ago
Analysis of the queue-length distribution for the discrete-time batch-service Geo
In this paper, we consider a discrete-time finite-capacity queue with Bernoulli arrivals and batch services. In this queue, the single server has a variable service capacity and serves the customers only when the number of customers in system is at least a certain threshold value. For this queue, we first obtain the queue-length distribution just after a service completion, using the embedded Markov chain technique. Then we establish a relationship between the queue-length distribution just after a service completion and that at a random epoch, using elementary ‘ratin=rate-out’ arguments. Based on this relationship, we obtain the queue-length distribution at a random (as well as at an arrival) epoch, from which important performance measures of practical interest, such as the mean queue length, the mean waiting time, and the loss probability, are also obtained. Sample numerical examples are presented at the end.
Xeung W. Yi, Nam K. Kim, Bong K. Yoon, Kyung C. Ch
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where EOR
Authors Xeung W. Yi, Nam K. Kim, Bong K. Yoon, Kyung C. Chae
Comments (0)