Abstract
The authors study queueing, input and output processes in a queueing system with bulk service and state dependent service delay. The input flow of customers, modulated by a semi-Markov process, is served by a single server that takes batches of a certain fixed size if available or waits until the queue accumulates enough customers for service. In the latter case, the batch taken for service is of random size dependent on the state of the system, while service duration depends both on the state of the system and on the batch size taken. The authors establish a necessary and sufficient condition for equilibrium of the system and obtain the following results: Explicit formulas for steady state distribution of the queueing process, intensity of the input and output processes, and mean values of idle and busy periods. They employ theory of semi-regenerative processes and illustrate the results by a number of examples. In one of them an optimization problem is discussed.
Similar content being viewed by others
References
L.M. Abolnikov and A.M. Dukhovny, Necessary and sufficient conditions for the ergodicity of Markov chains with transitionδ m,n (δ′ m,n ) matrix, J. Appl. Math. Simul. 1 (1987) 13–24.
E. Çinlar, Markov renewal theory, Adv. Appl. Prob. 1 (1969) 123–187.
J. Dshalalow, On modulated random measures, J. Appl. Math. Stoch. Anal. 4 (1991) 305–314.
J. Dshalalow and G. Russel, On a single-server queue with fixed accumulation level, state dependent service, and semi-Markov modulated input, submitted to Int. J. Math. and Math. Sci.
J. Dshalalow and L. Tadj, A queueing system with fixed accumulation level, random server capacity and capacity dependent servide time, to appear in J. Math, and Math. Sci.
Gihman and Skorohod,Theory of Stochastic Processes (Springer, 1974).
A.S. Tanenbaum and R. Van Renesse, Distributed operating systems, Comp. Surveys 17 (1985) 419–470.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dshalalow, J.H., Tadj, L. A queueing system with random server capacity and multiple control. Queueing Syst 14, 369–384 (1993). https://doi.org/10.1007/BF01158874
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01158874