Queuing Network Models with State-Dependent Routing
- 1 April 1980
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 27 (2) , 323-337
- https://doi.org/10.1145/322186.322196
Abstract
A model of a closed queuing network within which customer routing between queues may depend on the state of the network is presented. The routing functions allowed may be rational functions of the queue lengths of various downstream queues which reside within special subnetworks called p-subnetworks. If a network with no state-dependent routing has a product-form joint equilibrium distribution of the queue lengths, then the introduction of these routing functions will preserve the product form of the equilibrium distribution. An example to illustrate the applicability of the model to the problem of analyzing a load balancing strategy is presented. It is also indicated how the parametric analysis of a network with routing functions can be simplified through the analysis of a simpler “equivalent” network.Keywords
This publication has 10 references indexed in Scilit:
- Product Form and Local Balance in Queueing NetworksJournal of the ACM, 1977
- A Minimum Delay Routing Algorithm Using Distributed ComputationIEEE Transactions on Communications, 1977
- Networks of queues and the method of stagesAdvances in Applied Probability, 1976
- Networks of queuesAdvances in Applied Probability, 1976
- On quadratic adaptive routing algorithmsCommunications of the ACM, 1976
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Approximate Analysis of General Queuing NetworksIBM Journal of Research and Development, 1975
- Computational algorithms for closed queueing networks with exponential serversCommunications of the ACM, 1973
- Markov population processesJournal of Applied Probability, 1969
- Equilibrium distributions for an open migration processJournal of Applied Probability, 1968