RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks
Journal of the ACM (JACM)
Simple Relationships Among Moments of Queue Lengths in Product form Queueing Networks
IEEE Transactions on Computers
Mean-Value Analysis of Closed Multichain Queuing Networks
Journal of the ACM (JACM)
Simple Relationships Among Moments of Queue Lengths in Product form Queueing Networks
IEEE Transactions on Computers
Calculating joint queue-length distributions in product-form queuing networks
Journal of the ACM (JACM)
A calculus of variations approach to file allocation problems in computer systems
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The mathematics of product form queuing networks
ACM Computing Surveys (CSUR)
Towards a polynomial-time randomized algorithm for closed product-form networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Mean value analysis of re-entrant line with batch machines and multi-class jobs
Computers and Operations Research
Product Form Queueing Networks
Performance Evaluation: Origins and Directions
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Constructing predictable applications for military ad-hoc wireless networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
A generalized method of moments for closed queueing networks
Performance Evaluation
Exact analysis of performance models by the Method of Moments
Performance Evaluation
Hi-index | 14.98 |
A computational algorithm is developed for closed multichain product-form queueing networks. For networks that consist of only single-server fixed rate and infinite-server service centers, it involves only mean performance measures. The algorithm, called mean value analysis by chain (MVAC), is based on a recursion that is quite different in form from the recursion used in the well-known mean value analysis (MVA) algorithm and has quite different computational and storage costs. For networks with few service centers and many chains, MVAC typically has much lower costs than MVA, although it becomes more costly than MVA as the number of service centers increases. The MVAC recursion is similar in structure to a recursion involving normalizing constants that was derived by A.E. Conway and N.D. Georganas (1986). That recursion formed the basis for their recursion by chain (RECAL) algorithm for computing the normalizing constant and from it the mean performance measures. The computational and storage costs for MVAC are shown to be similar to those for RECAL.