Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-23T22:37:42.709Z Has data issue: false hasContentIssue false
  • English
  • Français

Insensitivity and product-form decomposability of reallocatable GSMP

Part of: Markov processes Special processes

Published online by Cambridge University Press:  01 July 2016

Masakiyo Miyazawa
Masakiyo Miyazawa*
Affiliation:
Science University of Tokyo
*
∗Postal address: Department of Information Science, Science University of Tokyo, Noda, Chiba 278, Japan.
Get access Rights & Permissions [Opens in a new window]

Abstract

A stochastic process, called reallocatable GSMP (RGSMP for short), is introduced in order to study insensitivity of its stationary distribution. RGSMP extends GSMP with interruptions, and is applicable to a wide range of queues, from the standard models such as BCMP and Kelly's network queues to new ones such as their modifications with interruptions and Serfozo's (1989) non-product form network queues, and can be used to study their insensitivity in a unified way. We prove that RGSMP supplemented by the remaining lifetimes is product-form decomposable, i.e. its stationary distribution splits into independent components if and only if a version of the local balance equations hold, which implies insensitivity of the RGSMP scheme in a certain extended sense. Various examples of insensitive queues are given, which include new results. Our proofs are based on the characterization of a stationary distribution for SCJP (self-clocking jump process) of Miyazawa (1991).

Keywords

INTERRUPTIONSSYMMETRIC QUEUENETWORK QUEUENEGATIVE CUSTOMERSTATE DEPENDENT ROUTINGSTATIONARY DISTRIBUTION

MSC classification

Primary: 60K25: Queueing theory
Secondary: 60J75: Jump processes
Type
Research Article
Information
Advances in Applied Probability , Volume 25 , Issue 2 , June 1993 , pp. 415 - 437
Copyright
Copyright © Applied Probability Trust 1993 

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

References

Baccelli, F. and Bremaud, P. (1987) Palm Probabilities and Stationary Queues. Lecture Notes in Statistics 41, Springer-Verlag, Berlin.CrossRefGoogle Scholar
Barbour, A. D. (1982) Generalized semi-Markov schemes and open queueing networks. J. Appl. Prob. 19, 469–474.CrossRefGoogle Scholar
Baskett, F., Chandy, K. M., Muntz, R. R. and Palacios, F. G. (1975) Open, closed and mixed networks of queues with different classes of customers. J. Assoc. Comput. Mach. 22, 248–260.CrossRefGoogle Scholar
Chandy, K. and Martin, J. (1983) A characterization of product form queueing networks. J. Assoc. Comput. Mach. 24, 250–263.CrossRefGoogle Scholar
Chandy, K. M., Howard, J. H. Jr. and Towsley, D. F. (1977) Product form and local balance in queueing networks. J. Assoc. Comput. Mach. 24, 250–263.CrossRefGoogle Scholar
Feller, W. (1971) An Introduction to Probability Theory and Its Applications , Vol II, 2nd edn. Wiley, New York.Google Scholar
Franken, P., König, D., Arndt, U. and Schmidt, V. (1982) Queues and Point Processes. Wiley, Chichester.Google Scholar
Gelenbe, E. (1991). Product-form queueing networks with negative and positive customers. J. Appl. Prob. 28, 656–663.CrossRefGoogle Scholar
Henderson, W. (1983) Insensitivity and reversed Markov processes. Adv. Appl. Prob. 15, 752–768.CrossRefGoogle Scholar
Henderson, W. and Taylor, P. (1989) Insensitivity of processes with interruptions. J. Appl. Prob. 26, 242–258.CrossRefGoogle Scholar
Jansen, U. and König, D. (1980) Insensitivity and steady state probabilities in product form for queueing networks. EIK 16, 385–397.Google Scholar
Kelly, F. P. (1976) Networks of queues. Adv. Appl. Prob. 8, 416–432.CrossRefGoogle Scholar
Kelly, F. P. (1979) Reversibility and Stochastic Networks. Wiley, New York.Google Scholar
Matthes, K. (1962) Zur Theorie der Bedienungsprozesse. Trans. 3rd Prague Conf. on Information Theor. Statist. Decision Functions, Random Processes , Prague.Google Scholar
Miyazawa, M. (1983) The derivation of invariance relations in complex queueing systems with stationary inputs. Adv. Appl. Prob. 15, 874–885.CrossRefGoogle Scholar
Miyazawa, M. (1991) The characterization of the stationary distributions of the supplemented self-clocking jump process. Math. Operat. Res. 16, 547–565.CrossRefGoogle Scholar
Miyazawa, M. (1992) On the system queue length distributions of LCFS-P queues with arbitrary acceptance and restarting policies. J. Appl. Prob. 29, 430–440.CrossRefGoogle Scholar
Rumsewicz, M. and Henderson, W. (1989) Insensitivity with age-dependent routing, Adv. Appl. Prob. 21, 398–408.CrossRefGoogle Scholar
Schassberger, R. (1977a) Insensitivity of steady state distributions of generalized semi-Markov processes. Part I. Ann. Prob. 5, 87–99.CrossRefGoogle Scholar
Schassberger, R. (1977b) Insensitivity of steady state distributions of generalized semi-Markov processes. Part II. Ann. Prob. 6, 85–93.Google Scholar
Schassberger, R. (1978) Insensitivity of steady-state distributions of generalized semi-Markov processes with speeds. Adv. Appl. Prob. 10, 836–851.CrossRefGoogle Scholar
Schassberger, R. (1986) Two remarks on insensitive stochastic models. Adv. Appl. Prob. 18, 791–814.CrossRefGoogle Scholar
Serfozo, R. F. (1989) Markovian network processes with system-dependent transition rates. QUESTA 5, 5–36.Google Scholar
Taylor, P. G. (1987) Aspects of insensitivity in stochastic processes. Doctoral thesis, University of Adelaide, South Australia.Google Scholar
Walrand, J. (1988) Queueing Networks. Prentice-Hall, Englewood Cliffs, NJ.Google Scholar