ID the last two decades there has been special interest in queueing networks with a product form solution. These have been widely used as models of computer systems and communication networks. Two new computational algorithms for product form networks are presented. A comprehensive treatment of these algorithms and the two important existing algorithms, convolution and mean value analysis, is given.
IBMQueueing networks are important as performance models of computer and communication systems.Exact numerical solution of a queueing network is usually only feasible if the network has a product form solution in the sense of Jackson. Product form networks allow a rich variety of forms of statedependent behavior. However, efficient computational algorithms have not been developed for several of the allowed forms of state-dependent behavior. This paper develops the two most important computational algorithms. Convolution and Mean Value Analysis, to apply to forms of state-dependent behavior allowed in product form networks. It is demonstrated that these two algorithms are of equal generality, contrary to common belief.
In the last two decades there has been special interest in queueing
networks
with a
product form
solution. These have been widely used as models of computer systems and communication networks. Two new computational algorithms for product form networks are presented. A comprehensive treatment of these algorithms and the two important existing algorithms, convolution and mean value analysis, is given.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.