The infinite-buffer single server queue with a variant of multiple vacation policy and batch Markovian arrival process |
| |
Authors: | A.D. Banik |
| |
Affiliation: | School of Technology and Computer Science, Tata Institute of Fundamental Research, Homi Bhaba Road, Navy Nagar, Colaba, Mumbai, Maharashtra 400005, India |
| |
Abstract: | We consider an infinite-buffer single server queue where arrivals occur according to a batch Markovian arrival process (BMAP). The server serves until system emptied and after that server takes a vacation. The server will take a maximum number H of vacations until either he finds at least one customer in the queue or the server has exhaustively taken all the vacations. We obtain queue length distributions at various epochs such as, service completion/vacation termination, pre-arrival, arbitrary, departure, etc. Some important performance measures, like mean queue lengths and mean waiting times, etc. have been obtained. Several other vacation queueing models like, single and multiple vacation model, queues with exceptional first vacation time, etc. can be considered as special cases of our model. |
| |
Keywords: | Infinite-buffer queue Batch Markovian arrival process Variant of multiple vacation policy Single server |
本文献已被 ScienceDirect 等数据库收录! |
|