Affiliation:
1. Hewlett-Packard Laboratories, Palo Alto, CA
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Reference35 articles.
1. A model of shared DASD and multipathing
2. Modeling I/O systems with dynamic path selection, and general transmission networks
3. Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
4. Bobrowski C. The Principle of Maximum Entropy in 5om~ Computer Systems Modelling Problems. MSc. Thesis Univ. Toronto Toronto Ont. (1983). Bobrowski C. The Principle of Maximum Entropy in 5om~ Computer Systems Modelling Problems. MSc. Thesis Univ. Toronto Toronto Ont. (1983).
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献