Abstract
A method of showing the performance limiting effects of a product form queueing network as lines, planes, etc in a J dimensional space is given. The location of a certain critical point (Little's Law Point) in this space allows the asymptotic calculation of the normalizing constant G(K) of the network. This Little's Law point (LLP) is found by applying Little's Law to the augmented system generating function of the BCMP [1] network. The computational complexity of this algorithm is the Order (number of chains cubed * number of service centers in the system). Comparisons of numerical accuracy with other methods (Convolution, and another asymptotic method) are given.
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.
