The infinite-buffer single server queue with a variant of multiple vacation policy and batch Markovian arrival process

被引:16
|
作者
Banik, A. D. [1 ]
机构
[1] Tata Inst Fundamental Res, Sch Technol & Comp Sci, Bombay 400005, Maharashtra, India
关键词
Infinite-buffer queue; Batch Markovian arrival process; Variant of multiple vacation policy; Single server; BMAP/G/1; QUEUE; LENGTH; TIME;
D O I
10.1016/j.apm.2008.10.021
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
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. (C) 2008 Elsevier Inc. All rights reserved.
引用
收藏
页码:3025 / 3039
页数:15
相关论文
共 50 条