Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
479088 | European Journal of Operational Research | 2007 | 19 Pages |
Abstract
This paper analyzes a single-server finite-buffer vacation (single and multiple) queue wherein the input process follows a discrete-time batch Markovian arrival process (D-BMAP). The service and vacation times are generally distributed and their durations are integral multiples of a slot duration. We obtain the state probabilities at service completion, vacation termination, arbitrary, and prearrival epochs. The loss probabilities of the first-, an arbitrary- and the last-customer in a batch, and other performance measures along with numerical aspects have been discussed. The analysis of actual waiting time of these customers in an accepted batch is also carried out.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
S.K. Samanta, U.C. Gupta, R.K. Sharma,