Copyright © 2006 Elsevier Ltd All rights reserved.
Discrete-time single-server finite-buffer queues under discrete Markovian arrival process with vacations
Received 18 October 2003;
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.
Keywords: Discrete-time Markovian arrival process (D-MAP); Finite buffer; Multiple vacations; Queue; Single vacation
Article Outline
- 1. Introduction
- 2. Assumptions and notations
- 3. Basic equations and analysis
- 3.1. Queue-length distributions at various epochs
- 3.1.1. Queue-length distribution at departure epoch
- 3.1.2. Queue-length distribution at service completion and vacation termination epochs
- 3.1.3. Queue-length distribution at an arbitrary epoch
- 3.1.4. Queue-length distribution at prearrival epoch
- 3.2. Waiting time analysis
- 4. Numerical results
- 5. Conclusion
- Acknowledgements
- References
- Vitae






E-mail Article
Add to my Quick Links

Cited By in Scopus (1)







