Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-10T13:48:59.654Z Has data issue: false hasContentIssue false
  • English
  • Français

Two sufficient properties for the insensitivity of a class of queueing models

Published online by Cambridge University Press:  14 July 2016

Moshe Haviv
Moshe Haviv*
Affiliation:
Hebrew University of Jerusalem
*
∗ Postal address: Department of Statistics, The Hebrew University, 91905 Jerusalem, Israel.
Get access Rights & Permissions [Opens in a new window]

Abstract

For indivisible strong work-conserving queueing models with a Poisson arrival process, each of the following two properties is a sufficient condition for insensitivity. (1) The completed workload of a job receiving service is independent of the number of jobs in the system. (2) Independently of the completed workloads of the jobs in the system, they all are equally likely to be in service. For models which additionally belong to the class described by two families of parameters each of these properties is also necessary for insensitivity.

Keywords

WORK-CONSERVINGWORKLOADINDIVISIBILITYPOISSON ARRIVALS
Type
Research Papers
Information
Journal of Applied Probability , Volume 28 , Issue 3 , September 1991 , pp. 664 - 672
Copyright
Copyright © Applied Probability Trust 1991 

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.)

Footnotes

The research leading to this paper was done while the author was at the Faculty of Commerce and Business Administration, University of British Columbia.

References

[1] Chandy, K. M., Howard, J. H. and Towsley, D. R. (1977) Product form and local balance in queueing networks. J. Assoc. Comput. Mach. 24, 250–263.Google Scholar
[2] Disney, R. L. and König, D. (1985) Queueing networks: A survey of their random processes. SIAM Rev. 27, 335–403.Google Scholar
[3] Haviv, M. (1987) On the dependence between the queue length and the service time in a FCFS queueing system. Unpublished.Google Scholar
[4] Hordijk, A. (1984) Insensitivity for stochastic networks. In Mathematical Computer Performance and Reliability, ed. Iazeolla, G., Courtois, P. J. and Hordijk, A. Elsevier, North-Holland, Amsterdam.Google Scholar
[5] Kelly, F. P. (1979) Reversibility and Stochastic Networks. Wiley, Chichester.Google Scholar
[6] Ross, S. M. (1983) Stochastic Processes. Wiley, New York.Google Scholar
[7] Schassberger, R. (1977) Insensitivity of steady-state distributions of generalized semi-Markov processes. Part 1. Ann. Prob. 5, 87–89.Google Scholar
[8] Schassberger, R. (1977) Insensitivity of steady-state distributions of generalized semi-Markov processes. Part 2. Ann. Prob. 6, 85–93.Google Scholar
[9] Walrand, J. (1988) An Introduction to Queueing Networks. Prentice Hall, Englewood Cliffs, NJ.Google Scholar