A Discrete Time (a. c, d) Policy Bulk Service Queue with State Dependent Service Rates

10.6186/IJIMS.2011.22.3.8

C. Baburaj

(a, c, d)policy ； Discrete time queues ； state dependent service rates batch service ； geometric distribution ； steady state distribution ； expected queue length

International Journal of Information and Management Sciences

22：3（2011 / 09 / 01）

311 - 326

英文

This paper presents a discrete time bulk service queue under the policy (a, c, d) with state dependent service rates. The inter-arrival times are assumed to be independent and geometrically distributed. The customers are served by a single server under the policy (a, c, d) with state dependent service rates. In this model the server begins service only when there are at least c units in the queue and he serves a maximum of d units in a batch. The server continue to serve even when the queue size is less than c but not less than a secondary limit a after a service completion epoch, but with a different service rate. If after a service completion epoch the queue size is less than a, the server becomes idle. The service times are also assumed to be independent and geometrically distributed. The steady state probabilities and some performance measures of the model are computed.

1. Baduraj, C.(2010).A discrete time (a, c, d) policy bulk service queue.International Journal of Information and Management Sciences,21(4),469-480.
   連結：
2. Baduraj, C.(1999).A single and batch services M/M/1 queue with a control on the batch size.International Journal of Information and Management Sciences,10(4),15-22.
3. Baduraj, C.,Surendranath, T. M.(2005).An M/M/1 bulk service queue under the policy (a,c,d).Int. J. Agricult. Stat,1(1 and 2),27-33.
4. Bruneel, H.(1993).Performance of discrete-time queueing systems.Comput. Oper. Res.,20,303-320.
5. Bruneel, H.,Kim, B.(1993).Discrete-time Models for Communication Systems Including ATM.Kluwer Academic Publisher.
6. Chaudhry, M. L.,Chang, S. H.(2003).Analysis of the discrete-time bulk-service queue Geo = GY = 1 = n+B.Oper. Res. Lett.,2003
7. Chaudhry, M. L.,Templeton, J. G. C.(1983).A First Course in Bulk Queues.New York:John Wiley and Sons.
8. Choi, B. D.,Choi, D. I.,Lee, Y.,Sung, D. K.(1998).Priority queueing system with .xed-length packet-train arrivals.IEE Proceedings-Communications,145(5),331-336.
9. Dshalalow, J. H.(1997).Frontiers in Queueing.Boca Raton, Florida:CRC Press.
10. Goswamy, V.,Samanata, S. K.(1999).Discrete-time single and batch service queues with accessibility to the batches.International al Journal of Information and Management Sciences,20,27-38.
11. Gupta, U. C.,Goswami, V.(2002).Performance analysis of .nite bu. Er discrete-time queue with bulk service.Comput. Oper. Res.,29,1331-1341.
12. Lee, Y.(2001).Discrete-time GeoX/G/1 queue with preemptive resume priority.Math. Comput. Modelling,34,243-250.
13. Lee, Y.,Choi, B. D.(2001).Queueing system with multiple delay and loss priorities for ATM networks.Inform. Sci.,138(1-4),7-29.
14. Takagi, H.(1993).Queueing Analysis Vol. 3: Discrete-time systems.Amsterdam:North-Holland.

1. Rameshkumar, E.,Jeyakumar, S.(2017).Performance Analysis and Cost Optimization of Non-Markovian Bulk Queue with 'p'- Entering Discipline during Multiple Adaptive Vacations.International Journal of Information and Management Sciences,28(2),99-111.