Published April 1983
| public
Journal Article
A Characterization of Product-Form Queuing Networks
- Creators
- Chandy, K. M.
- Martin, A. J.
Chicago
An error occurred while generating the citation.
Abstract
Queuing network models have proved effective in the design and analysis of computing systems. The class of queuing network models having product-form solutions is amenable to efficient, general solution techniques. The purpose of this paper is to characterize such queuing systems. With this characterization it will be easy to determine whether the product-form algorithms can be used to analyze a system.
Additional Information
© 1983 ACM. This work was supported by the National Science Foundation under Grant MCS 81-01911. The phrase "distinguished class" was suggested by G. E. Lindzey, Jr. The word "balanced" and the balanced lemma were suggested by a referee. Helpful comments from both referees and from M. S. Goheen improved the paper.Additional details
- Eprint ID
- 92224
- Resolver ID
- CaltechAUTHORS:20190111-145202534
- NSF
- MCS 81-01911
- Created
-
2019-01-12Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field