Hostname: page-component-89b8bd64d-r6c6k Total loading time: 0 Render date: 2026-05-07T23:51:14.028Z Has data issue: false hasContentIssue false
  • English
  • Français

Insensitivity in queueing systems

Published online by Cambridge University Press:  01 July 2016

David Y. Burman
David Y. Burman*
Affiliation:
Bell Laboratories
*
∗ Postal address: Bell Laboratories, Crawfords Corner Road, Holmdel, NJ07733, U.S.A.
Get access Rights & Permissions [Opens in a new window]

Abstract

It is well known that the stationary distribution of the number of busy servers in the Erlang blocking system (M/G/c/c) depends on the service-time distribution only through its mean. This insensitivity property is shared by several other queueing systems. In this paper, we give simple sufficient conditions for determining if this insensitivity property holds for general queueing systems and related stochastic models. The conditions involve determining whether the solution of the stationary Markovian flow equations also solves certain restricted flow equations. The proof that these conditions are sufficient is direct and elementary.

Keywords

GENERALIZED SEMI-MARKOV PROCESSESINSENSITIVITYLOCAL BALANCEPRODUCT PROPERTY

Information

Type
Research Article
Information
Advances in Applied Probability , Volume 13 , Issue 4 , December 1981 , pp. 846 - 859
Copyright
Copyright © Applied Probability Trust 1981 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Barbour, A. D. (1976) Networks of queues and the method of stages. Adv. Appl. Prob. 8, 584–591.CrossRefGoogle Scholar
Baskett, F. (1970) Mathematical Models of Multiprogrammed System. Ph.D. Dissertation, Comptr. Ctr. Rep. TSN-17, Comptr. Sci. Dept., University of Texas at Austin.Google Scholar
Brumelle, S. L. (1978) A generalization of Erlang's loss system to state dependent arrival and service rates. Math. Operat. Res. 3, 10–16.CrossRefGoogle Scholar
Burman, D. Y. (1978) An Analytic Approach to Diffusion Approximations in Queueing. Ph.D. Dissertation, Math. Dept., New York University, N.Y. Google Scholar
Burman, D. Y. (1980) An analytic approach to queueing processes. Bell Laboratories Technical Paper.Google Scholar
Chaiken, J. M. and Ignall, E. (1972) An extension of Erlang's formulas which distinguishes individual servers. J. Appl. Prob. 9, 192–197.Google Scholar
Chandy, K. M. (1972) The analysis and solutions for general queueing networks. Proc. Sixth Annual Princeton Conf. on Inform. Sci. and Systems, Princeton U., Princeton, N.J., 219–224.Google Scholar
Çinlar, E. (1975) An Introduction to Stochastic Processes. Prentice-Hall, Englewood Cliffs, N.J. Google Scholar
Dynkin, E. B. (1965) Markov Processes, Vol. 1, Springer-Verlag, Berlin.Google Scholar
Hordijk, A. and Schassberger, R. (1975) Weak convergence theorems for generalized semi-Markov processes. Tech. Report, Dept of Math. and Stat., University of Calgary, Alberta, Canada.Google Scholar
Jansen, U., König, D. and Nawrotzki, K. (1978) A criteria of insensitivity for a class of queueing systems with random marked point processes. Tech. Report, Sektion Mathematik, Bergakademie Freiberg.Google Scholar
Kelly, F. P. (1976) Networks of queues. Adv. Appl. Prob. 8, 416–432.Google Scholar
Kingman, J. F. C. (1969) Markov population processes. J. Appl. Prob. 6, 1–18.CrossRefGoogle Scholar
Kleinrock, L. (1976) Queueing Systems, Vol. 2. Wiley, New York.Google Scholar
König, D., Matthes, K. and Nawrotzki, K. (1967) Verallgemeinerungen der Erlangschen und Engrettschen Formeln. Akademie-Verlag, Berlin.Google Scholar
Ross, S. M. (1970) Applied Probability Models with Optimization Applications. Holden-Day, San Francisco.Google Scholar
Schassberger, R. (1976) On the equilibrium distribution of a class of finite-state generalized semi-Markov process. Math. Operat. Res. 1, 395–406.CrossRefGoogle Scholar
Schassberger, R. (1977) Insensitivity of steady-state distribution of generalized semi-Markov process—Part I. Ann. Prob. 5, 87–99.Google Scholar
Schassberger, R. (1978a) Insensitivity of steady-state distributions of generalized semi-Markov processes. Part II. Ann. Prob. 6, 85–93.Google Scholar
Schassberger, R. (1978b) Insensitivity of steady-state distributions of generalized semi-Markov process with speeds. Adv. Appl. Prob. 10, 836–851.Google Scholar
Schassberger, R. (1978c) Insensitivity of stationary probabilities in networks of queues. Adv. Appl. Prob. 10, 906–912.Google Scholar
Sevastyanov, B. A. (1957) An ergodic theory for Markov processes and its application to a telephone system with refusals. Theory Prob. Appl. 2, 104–112.Google Scholar
Syski, R. (1960) Introduction to Congestion Theory in Telephone Systems. Oliver and Boyd, Edinburgh.Google Scholar
Takács, L. (1969) On Erlang's formula. Ann. Math. Statist. 40, 71–78.Google Scholar
Whitt, W. (1980) Continuity of generalized semi-Markov processes. MathOperat. Res. 5, 494–501.Google Scholar
Whittle, P. (1968) Equilibrium distributions for an open migration process. J. Appl. Prob. 5, 567–571.Google Scholar