Loading…
Computing queue length distributions in MAP/ G/1/ N queue under single and multiple vacation
This paper studies a single server queue with finite waiting room in which the server takes vacation(s) whenever the system becomes empty and we consider both single and multiple vacation(s). Whereas the input process is a Markovian Arrival Process (MAP), the service and vacation times are arbitrari...
Saved in:
Published in: | Applied mathematics and computation 2006-03, Vol.174 (2), p.1498-1525 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This paper studies a single server queue with finite waiting room in which the server takes vacation(s) whenever the system becomes empty and we consider both single and multiple vacation(s). Whereas the input process is a Markovian Arrival Process (MAP), the service and vacation times are arbitrarily distributed. The distributions of number of customers in the queue at service completion, vacation termination, departure, arbitrary and pre-arrival epochs have been obtained. Computational procedure has been given when the service- and vacation-time distributions are of phase type (PH-distribution). |
---|---|
ISSN: | 0096-3003 1873-5649 |
DOI: | 10.1016/j.amc.2005.07.001 |