Abstract
We will propose a new, iterative method for approximately analyzing closed networks of queues with nonexponential service time distributions and FCFS scheduling. Our method is based on the Principle of Maximum Entropy and produces results which, first, are consistent with the fundamental Work Rate Theorem and, second, are exact for separable networks of queues. Considering accuracy and execution time characteristics, our method offers a viable alternative to Marie's homogeneous approximation method.
Sign-in/Register to access full text options 
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.
