Discrete-time single-server finite-buffer queues under discrete Markovian arrival process with vacations

摘要

This paper treats a discrete-time single-server finite-buffer exhaustive (single- and multiple-) vacation queueing system with discrete-time Markovian arrival process (D-MAP). The service and vacation times are generally distributed random variables and their durations are integral multiples of a slot duration. We obtain the queue-length distributions at departure, service completion, vacation termination, arbitrary and prearrival epochs. Several performance measures such as probability of blocking, average queue-length and the fraction of time the server is busy have been discussed. Finally, the analysis of actual waiting time under the first-come-first-served discipline is also carried out.