Abstract
A diffusion model is developed for a class of queues with Poisson arrivals and general services, both of which are state-dependent. This class covers many practical queueing systems with multiple servers, finite waiting spaces, finite sources, discouraged arrivals and more. For each of these systems, a large number of diffusion models have been developed individually. Our diffusion model unifies and refines those previous models. The main focus is on the steady-state distribution of the number of customers in system. The discrete process of the number of customers is approximated by a continuous diffusion process with piece wise-constant infinitesimal parameters defined on a closed interval in the non-negative real line. A conservation law together with a consistent discretization generate an approximate formula for the steady-state distribution, which is more accurate than the previous models.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benson, F. and Cox, D.R. The productivity of machines requiring attention at random intervals. Journal of the Royal Statistical Society, Series B 1951; 13: 65–82
Biswas, S.K. and Sunaga, T. Diffusion approximation method for the solution of two-stage cyclic queueing problems. Memoirs of the Faculty of Engineering, Kyushu University 1981; 41: 17–32
Bunday, B.D. and Scraton, R.E. The G/M/r machine interference model. European Journal of Operational Research 1980; 4: 399–40
Cooper, R.B. Introduction to Queueing Theory. 2nd Ed., New York: North-Holland, 1981
Feller, W. Diffusion processes in one dimension. Transactions of the American Mathematical Society 1954; 77: 1–31
Franken, P., König, D., Arndt, U. and Schmidt, V. Queues and Point Processes. Berlin: Akademie-Verlag, 1981
Halachmi, B. and Franta, W.R. A diffusion approximate solution to the G/G/k queueing system. Computers and Operations Research 1977; 4: 37–46
Jain, M. and Sharma, G.C. Diffusion approximation for the GI/G/r machine interference problem with spare machines. Indian Journal of Technology 1986; 24: 568–572
Kimura, T. Diffusion approximation for an M/G/m queue. Operations Research 1983; 31: 304–321
Kimura, T. A unifying diffusion model for state-dependent queues. Optimization 1987; 18: 265–283
Kimura, T. An M/M/s-consistent diffusion model for the GI/G/s queue. Queueing Systems 1995; 19: 377–397
Kimura, T. Optimal buffer design of an M/G/s queue with finite capacity. Stochastic Models 1996; 12: 165–180
Kimura. T. A consistent diffusion approximation for finite-capacity multi-server queues. In Stochastic Models in Engineering, Technology and Management, Proceedings of the First Western Pacific/Third Australia-Japan Workshop, R.J. Wilson, S. Osaki and M.J. Faddy (eds.), pp. 305–314, Christchurch, New Zealand, 1999
Kimura. T. Equivalence relations in the approximations for the M/G/s/s+r queue. Mathematical and Computer Modelling 2000; 31: 215–224
Pujolle, G. Files d’attente avec dépendence de l’état et application à un système de communication multilignes. Research Report 1978; No. 315, IRIA Laboria
Rao, S.S. Queueing models with balking, reneging and interruptions. Operations Research 1965; 13: 596–608
Sunaga, T., Biswas, S.K. and Nishida, N. An approximation method using continuous models for queueing problems. II (multi-server finite queue). Journal of the Operations Research Society of Japan 1982; 25: 113–128
Whitt, W. Refining diffusion approximations for queues. Operations Research Letters 1982; 1: 165–169
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kimura, T. (2002). Refining Diffusion Models for State-Dependent Queues. In: Kozan, E., Ohuchi, A. (eds) Operations Research/Management Science at Work. International Series in Operations Research & Management Science, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0819-9_25
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0819-9_25
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5254-9
Online ISBN: 978-1-4615-0819-9
eBook Packages: Springer Book Archive