A Characterization of Product-Form Queuing Networks
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.
© 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.