Abstract
Two methods are presented for estimating performance derivatives from simulation of multi-class queueing networks for sensitivity analysis. The methods use approximate subnetwork aggregation to reduce the problem to a single-class derivative estimation problem with which a modified infinitesimal perturbation analysis algorithm is used. The modified algorithm treats a subnetwork as though it had been aggregated, but is actually applied to the original (non-aggregated) network. The two approaches to aggregation considered represent two extensions of the idea of a Norton equivalent to non-product-form networks, one based on an exact result, the other heuristic. These are of interest beyond the particular application considered here.
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.
