Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Horner's rule for the evaluation of general closed queueing networks
Communications of the ACM
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
A Clustering Approximation Technique for Queueing Network Models with a Large Number of Chains
IEEE Transactions on Computers
Simple Relationships Among Moments of Queue Lengths in Product form Queueing Networks
IEEE Transactions on Computers
An exact solution method for the general class of closed separable queueing networks
SIGMETRICS '79 Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems
Survey of analytic queueing network models of computer systems
SIGMETRICS '79 Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems
The solution of separable queueing network models using mean value analysis
SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The impact of certain parameter estimation errors in queueing network models
PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
A critical overview of computer performance evaluation
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Approximate techniques for modeling the performance of complex systems
Computer Languages
Flow control in message-switched communications networks
Computer Communications
| Hi-index | 0.01 |
Research into queuing networks and their applications to computer systems is in a state of prosperity. The object of this paper is to discuss the computational aspect of separable queuing networks. Separable networks constitute that class of models for which a solution can be computed efficiently for fairly large problems. Open networks do not pose any computational problem. It is the case of closed networks where the subject of numerical algorithms becomes an issue. In this paper, we shall take a fresh look at closed queuing networks, which we introduce as conditioned solution of suitably chosen open networks. This view will provide a probabilistic interpretation of what is normally called the normalization constant. Computational algorithms, then, result in a systematic way.