Approximate Solution of Queueing Networks with Simultaneous Resource Possession
by C. H. Sauer
Queueing networks are important as performance models of computer and communication systems because the performance of these systems is usually principally affected by contention for resources. Exact numerical solution of a queueing network is usually only feasible if the network has a product form solution in the sense of Jackson. An important network characteristic which apparently precludes a product form solution is simultaneous resource possession, e.g., a job holds memory and processor simultaneously. This paper extends previous methods for approximate numerical solution of queueing networks with homogeneous jobs and simultaneous resource possession to networks with heterogeneous jobs and simultaneous resource possession.