Discrete time analysis of MAP/PH/1 vacation queue with gated time‐limited service
- 137 Downloads
We analyse a single‐server queue in which the server goes through alternating periods of vacation and work. In each work period, the server attends to the queue for no more than a fixed length of time, T. The system is a gated one in which the server, during any visit, does not attend to customers which were not in the system before its visit. As soon as all the customers within the gate have been served or the time limit has been reached (whichever occurs first) the server goes on a vacation. The server does not wait in the queue if the system is empty at its arrival for a visit. For this system the resulting Markov chain, of the queue length and some auxiliary variables, is level‐dependent. We use special techniques to carry out the steady state analysis of the system and show that when the information regarding the number of customers in the gate is not critical we are able to reduce this problem to a level‐independent Markov chain problem with large number of boundary states. For this modified system we use a hybrid method which combines matrix‐geometric method for the level‐independent part of the system with special solution method for the large complex boundary which is level‐dependent.
Unable to display preview. Download preview PDF.
- C. Blondia, A discrete-time batch Markovian arrival process as B-ISDN traffic model, Belg. J. Oper. Res. Statist. Comput. Sci. 32(3,4) (1992) 3-23.Google Scholar
- L. Bright and P.G. Taylor, Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes, Stochastic Models 11(3) (1995) 497-525.Google Scholar
- B.T. Doshi, Single server queues with vacations, in: Stochastic Analysis of Computer and Communications Systems, ed. H. Takagi (1990).Google Scholar
- D.M. Lucantoni, New results on the single server queue with a batch Markovian arrival process, Stochastic Models 7 (1991) 1-46.Google Scholar
- S.K. Matendo, A single-server queue with server vacations and a batch Markovian arrival process, Cahiers du C.E.R.O 35(1–2) (1993) 87-114.Google Scholar
- M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models — An Algorithmic Approach (Johns Hopkins Univ. Press, Baltimore, MD, 1981).Google Scholar
- V. Ramaswami and P.G. Taylor, Some properties of the rate operators in level dependent quasi-birth-and-death processes with a countable number of phases, Stochastic Models 12(1) (1996) 143-164.Google Scholar
- K. Sriram, Dynamic bandwidth allocation and congestion control schemes for voice and data multiplexing in wideband packet technology, in: Proc. of IEEE ICC '90, Atlanta, GA (1990) pp. 1003-1009.Google Scholar