Drum Models Using an Iterative Solution for Closed Queueing Networks.

摘要

An algorithm by Buzen to find the normalizing constant and marginal probabilities in a closed queueing network is generalized to the model of Muntz and Baskett. A technique involving the iterative solution of a closed queueing network to implement queue dependent completion time distributions is presented. An accurate model of a paging drum for queueing networks is given as an example. (Author)