RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks
Journal of the ACM (JACM)
Numerical recipes in C: the art of scientific computing
Numerical recipes in C: the art of scientific computing
Calculating joint queue-length distributions in product-form queuing networks
Journal of the ACM (JACM)
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
| Hi-index | 0.00 |
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.