Survey of closed queueing networks with blocking
ACM Computing Surveys (CSUR)
Queueing networks with blocking
Queueing networks with blocking
A compositional approach to performance modelling
A compositional approach to performance modelling
Analysis of Queueing Networks with Blocking
Analysis of Queueing Networks with Blocking
Approximate Throughput Computation of Stochastic Marked Graphs
IEEE Transactions on Software Engineering
Closed queueing networks with finite capacity queues: approximate analysis
Proceedings of the 14th European Simulation Multiconference on Simulation and Modelling: Enablers for a Better Quality of Life
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Describing Queueing Systems with MPA
Describing Queueing Systems with MPA
| Hi-index | 0.00 |
In this paper a class of finite length Markovian queueing models is studied that, in general, does not exhibit a product form solution. Good approximations can be derived for the marginal queue size distributions in this case, and hence measures such as the average response time can be calculated. However, because no product form exists, expressions for the joint queue size distribution are much more costly to derive, hence many performance measures of interest cannot be easily computed. An approximation for the joint queue size distributions is explored here, which improves on a naive product form assumption by considering various boundary cases. The approximations are explored numerically by example.