Abstract
An approximation of mean value analysis is presented for queueing networks containing multiple server stations. The approximation is based on the estimation of the conditional marginal probabilities used by the mean residence time formula in mean value analysis. A comparison against classical mean value analysis allows us to determine the accuracy of our algorithm. In all investigated network models, the approximate results vary from the exact results by less than four percent on the average. This approximation method has all the advantages of classical mean value analysis; specifically, it is easy to implement and has a very short run time.
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.
