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

  • Authors:
  • U. C. Gupta;S. K. Samanta;R. K. Sharma;M. L. Chaudhry

  • Affiliations:
  • Department of Mathematics, Indian Institute of Technology, Kharagpur-721302, India;Department of Mathematics, Indian Institute of Technology, Kharagpur-721302, India;Department of Mathematics, Indian Institute of Technology, New Delhi-110016, India;Department of Mathematics and Computer Science, Royal Military College of Canada, P.O. Box 17000, STN Forces, Kingston Ont., Canada K7K 7B4

  • Venue:
  • Performance Evaluation
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.