Abstract
In queueing network models the complexity of the model can be reduced by aggregating stations. This amounts to obtaining the throughput of the flow-equivalent station for the subnetwork of stations to be aggregated. When the subnetwork has a separable solution, aggregation can be carried out using the Chandy-Herzog-Woo theorem. The throughput of the subnetwork can be expressed explicitly in terms of its parameters when the stations are balanced (have equal utilizations). This expression for throughput can be used as an approximation when the stations are relatively unbalanced. The basic expression can be modified to increase the accuracy of the approximation. A generating function approach was used to obtain upper bounds on the relative error due to the basic approximation and its modifications. Provided that the relative error bound is tolerable, a set of unbalanced stations can be replaced by a single aggregate station or a set of balanced stations. Finally, we propose a methodology to simplify the queueing network model of a large-scale multiprogrammed computer, which makes use of the previous aggregation results.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
