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)
Mean-Value Analysis of Closed Multichain Queuing Networks
Journal of the ACM (JACM)
The Operational Analysis of Queueing Network Models
ACM Computing Surveys (CSUR)
A model of shared DASD and multipathing
Communications of the ACM
A comparison of numerical techniques in Markov modeling
Communications of the ACM
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
A Method for Obtaining Approximate Solutions to Closed Queueing Networks with General Service Times
Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
A Study of Flows in Queueing Networks and an Approximate Method for Solution
Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance 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
Characterizing service time and response time distributions in queueing network models of computer systems.
Iterative analysis of networks of queues
Iterative analysis of networks of queues
Modeling I/O systems with dynamic path selection, and general transmission networks
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Extensions and computational aspects of an iterative method
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Approximate Analysis of Load Dependent General Queueing Networks
IEEE Transactions on Software Engineering
A maximum entropy queue length distribution for the G/G/1 finite capacity queue
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Higher-order distributional properties in closed queueing networks
Performance Evaluation
| Hi-index | 0.00 |
We will propose a new, iterative method for approximately analyzing closed networks of queues with nonexponential service time distributions and FCFS scheduling. Our method is based on the Principle of Maximum Entropy and produces results which, first, are consistent with the fundamental Work Rate Theorem and, second, are exact for separable networks of queues. Considering accuracy and execution time characteristics, our method offers a viable alternative to Marie's homogeneous approximation method.