Insensitivity and product-form decomposability of reallocatable GSMP
- 1 June 1993
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 25 (2) , 415-437
- https://doi.org/10.2307/1427660
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
This publication has 16 references indexed in Scilit:
- The Characterization of the Stationary Distribution of the Supplemented Self-Clocking Jump ProcessMathematics of Operations Research, 1991
- Product-form queueing networks with negative and positive customersJournal of Applied Probability, 1991
- Insensitivity of processes with interruptionsJournal of Applied Probability, 1989
- Insensitivity with age-dependent routingAdvances in Applied Probability, 1989
- The derivation of invariance relations in complex queueing systems with stationary inputsAdvances in Applied Probability, 1983
- Insensitivity and reversed Markov processesAdvances in Applied Probability, 1983
- Product Form and Local Balance in Queueing NetworksJournal of the ACM, 1977
- Insensitivity of Steady-State Distributions of Generalized Semi-Markov Processes. Part IThe Annals of Probability, 1977
- Networks of queuesAdvances in Applied Probability, 1976
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975