Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Product Form and Local Balance in Queueing Networks
Journal of the ACM (JACM)
On quadratic adaptive routing algorithms
Communications of the ACM
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
Local Balance Models of Computer Systems
Local Balance Models of Computer Systems
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Dynamic Remapping of Parallel Computations with Varying Resource Demands
IEEE Transactions on Computers
Approximate Analysis of Load Dependent General Queueing Networks
IEEE Transactions on Software Engineering
Optimal Dynamic Remapping of Data Parallel Computations
IEEE Transactions on Computers
Central Server Models with Multiple Job Classes, State Dependent Routing, and Rejection Blocking
IEEE Transactions on Software Engineering
The mathematics of product form queuing networks
ACM Computing Surveys (CSUR)
Monte Carlo summation and integration applied to multiclass queuing networks
Journal of the ACM (JACM)
Solving product form stochastic networks with Monte Carlo summation
WSC' 90 Proceedings of the 22nd conference on Winter simulation
Computational algorithms for state-dependent queueing networks
ACM Transactions on Computer Systems (TOCS)
Invariance of the Stationary Distribution of Networks with Bypasses and “Negative” Customers
Automation and Remote Control
Product Form Queueing Networks
Performance Evaluation: Origins and Directions
IBM contributions to computer performance modeling
IBM Journal of Research and Development
Approximate solution of queueing networks with simultaneous resource possession
IBM Journal of Research and Development
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Queuing network of scale free topology: on modelling large scale network
The Journal of Supercomputing
| Hi-index | 0.01 |
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.