ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Performance Evaluation
Volume 64, Issue 1, January 2007, Pages 1-19
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (513 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.peva.2006.01.001    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2006 Elsevier Ltd All rights reserved.

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

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

U.C. Guptaa, Corresponding Author Contact Information, E-mail The Corresponding Author, S.K. Samantaa, E-mail The Corresponding Author, R.K. Sharmab, E-mail The Corresponding Author and M.L. Chaudhryc, E-mail The Corresponding Author

aDepartment of Mathematics, Indian Institute of Technology, Kharagpur-721302, India

bDepartment of Mathematics, Indian Institute of Technology, New Delhi-110016, India

cDepartment of Mathematics and Computer Science, Royal Military College of Canada, P.O. Box 17000, STN Forces, Kingston Ont., Canada K7K 7B4


Received 18 October 2003; 
revised 21 December 2005. 
Available online 10 February 2006.

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






Corresponding Author Contact InformationCorresponding author. Tel.: +91 3222 283654; fax: +91 3222 155303.

Performance Evaluation
Volume 64, Issue 1, January 2007, Pages 1-19
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.