Asymptotic expansions for closed Markovian networks with state-dependent service rates
Journal of the ACM (JACM)
Asymptotic expansion for large closed queuing networks
Journal of the ACM (JACM)
Asymptotic analysis of multiclass closed queueing networks: common bottleneck
Performance Evaluation
Asymptotic analysis of multiclass closed queueing networks: multiple bottlenecks
Performance Evaluation
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
CoMoM: class-oriented evaluation of multiclass models
ACM SIGMETRICS Performance Evaluation Review
A unified framework for the bottleneck analysis of multiclass queueing networks
Performance Evaluation
A generalized method of moments for closed queueing networks
Performance Evaluation
Exact analysis of performance models by the Method of Moments
Performance Evaluation
Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence
Mathematics of Operations Research
| Hi-index | 0.00 |
An expression for the generating function of the normalising constant is obtained for a closed, multiclass Markovian queueing network in terms of similar functions for networks with one fewer class. In this way a recursive algorithm can be implemented to calculate normalising constants, and hence, many performance measures, in terms of the normalising constant function for single class networks, which is well understood. The technique is illustrated for a simple two-class network and explains simply some interesting asymptotic properties.