Abstract
This paper deals with a single server Markovian queue subject to maintenance of the server. A batch of customers is allowed whenever the server is idle such that each individual customer in the batch is subject to a control admission policy upon arrival. Explicit expressions are obtained for the time dependent probabilities of the system size in terms of the modified Bessel functions. The steady state analysis and key performance measures of the system are also studied. Finally, some numerical illustrations are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abate J, Whitt W (1988) Transient behaviour of the M/M/1 queue via Laplace transforms. Adv Appl Probab 20:145–178
Artalejo JR, Atencia I (2004) On the single server retrial queue with batch arrivals. Sankhaya 66:140–158
Bertsekas D, Gallager R (1987) Data networks. Prentice Hall, Englewood Cliffs
Bonomi F, Mitra D, Seery J (1995) Adaptive algorithms for feedback-based flow control in high speed wide-area ATM networks. IEEE J Sel Areas Commun 13(7):1267–1283
Burke PJ (1956) The output of a queuing system. Oper Res 4(6):699–704
Doshi BT (1986) Queueing system with vacation—a survey. Queueing Syst 1:29–66
Fuhrmann SW, Cooper RB (1985) Stochastic decomposition in the M/G/1 queue with generalized vacations. Oper Res 33:1117–1129
Gelenbe E, Pujolle G (1998) Introduction to queueing networks. Wiley, Chichester
Giambene G (2005) Queueing theory and telecommunications: networks and applications. Springer, New Delhi
Haverkort BR, Marie R, Rubino G, Trivedi K (2001) Performability modeling. Wiley, New York
Keilson J (1979) Markov chain models-rarity and exponentiality. Springer, New York
Kitaev MY, Rykov VV (1995) Controlled queueing systems. CRC Press, Boca Raton
Krishna Kumar B, Arivudainambi D (2000) Transient solution of an M/M/1 queue with catastrophes. Comput Math Appl 40(10–11):1233–1240
Krishna Kumar B, Vijayakumar A, Sophia S (2009) Transient analysis of a Markovian queue with chain sequence rates and total catastrophes. Int J Oper Res 5(4):375–391
Kumar A, Wong WS (1987) Some mean value formulas for the transient M/M/1 queue. Unpublished paper, AT and T Bell Laboratories, Holmdel, NJ
Lavenberg SS (1983) Computer performance modelling handbook. Academic Press, New York
Levy Y, Yechiali U (1975) Utilization of idle time in an M/G/1 queueing system. Manag Sci 22:202–211
Minh DL (1988) Transient solution for some exhaustive M/G/1 queues with generalized independent vacations. Eur J Oper Res 36(2):197–201
Nagarajan R, Kurose J (1992) On defining, computing and guaranteeing quality-of-service in high-speed networks. In: Proc of INFOCOM’ 92, vol 2, pp 2016–2025, Florence, Italy
Parthasarathy PR, Sudesh R (2008) Transient solution of a multiserver Poisson queue with N-policy. Comput Math Appl 55(3):550–562
Takagi H (1991) Queueing analysis: a foundation of performance evaluation, vol 1: vacation and priority systems. North-Holland, Amsterdam
Walrand J, Varaja P (2001) High-performance communication networks. Morgan Kaufmann, San Francisco
Widder DV (1946) The Laplace transform. Princeton University Press, Princeton
Yin N, Hluchyj M (1994) On closed-loop rate control for ATM cell relay networks. In: Proc of IEEE INFOCOM’ 94, pp 99–108
Zhang J, Coyle EJ (1991) The transient solution of time-dependent M/M/1 queues. IEEE Trans Inf Theory 37(6):1690–1696
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Krishna Kumar, B., Pavai Madheswari, S. & Anantha Lakshmi, S.R. Queuing system with state-dependent controlled batch arrivals and server under maintenance. TOP 19, 351–379 (2011). https://doi.org/10.1007/s11750-011-0196-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-011-0196-6
Keywords
- Markovian queue
- Control of admission
- Server maintenance
- Transient probability
- Steady state
- Waiting time
- Busy period