Computational algorithms for product form queueing networks

Chandy, K. Mani; Sauer, Charles H.

doi:10.1145/359015.359020

Cited by 100 publications

(30 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When a customer changes its class we talk about class switching. Note that, in this paper, we use the concept of class in a local sense as in Chandy and Sauer (1980) rather in the global one used in Baskett et al (1975). Classes form a temporary partition of the customers while chains are a permanent partition.…”

Section: The Bcmp Theoremmentioning

confidence: 99%

Applying BCMP multi-class queueing networks for the performance evaluation of hierarchical and modular software systems

Balsamo

Rossi

Marin

2015

IJCAET

View full text Add to dashboard Cite

Queueing networks with multiple classes of customers play a fundamental role for evaluating the performance of both software and hardware architectures. The main strength of product-form models, in particular of BCMP queueing networks, is that they combine a flexible formalism with efficient analysis techniques and solution algorithms. In this paper we provide an algorithm that starting from a high-level description of a system, and from the definition of its components in terms of interacting sub-systems, computes a multiple-class and multiple-chain BCMP queueing network. We believe that the strength of this approach is twofold. First, the modeller deals with simplified models, which are defined in a modular and hierarchical way. Hence, we can carry on sensitivity analysis that may easily include structural changes (and not only on the time parameters). Second, maintaining the product-form property allows one to derive the average system performance indices very efficiently. The paper also discusses the application of the algorithm for the performance evaluation of Web Sites with modular architectures, such as those based on Content Management Systems.

show abstract

Section: The Bcmp Theoremmentioning

confidence: 99%

Applying BCMP multi-class queueing networks for the performance evaluation of hierarchical and modular software systems

Balsamo

Rossi

Marin

2015

IJCAET

View full text Add to dashboard Cite

show abstract

“…It is important to remember that the MVA and convolution algorithms have very different numerical properties [17]. In particular, MVA is numerically stable for models with only fixed rate and infinite server queues; this is true also when extreme parameter values are considered.…”

Section: Queueing Networkmentioning

confidence: 99%

“…When exact solutions are not known, results can still be validated by computing them with different algorithms. For example, the MVA and convolution algorithms can be applied to the same network, and they must provide the same results (apart for deviations due to numerical inaccuracies [17]). As another example, a M/M/1/K queue is a special case of an M/M/m/K queue with m = 1 servers.…”

Section: Validationmentioning

confidence: 99%

The qnetworks Toolbox: A Software Package for Queueing Networks Analysis

Marzolla

2010

Analytical and Stochastic Modeling Techniques and Applications

View full text Add to dashboard Cite

Abstract. Queueing Networks (QNs) are a useful performance modelling notation. They can be used to describe many kinds of systems, and efficient solution techniques have been developed for some classes of QN models. Despite the fact that QNs have been extensively studied, very few software packages for QN analysis are available today. In this paper we describe the qnetworks toolbox, a free software package for QN analysis for GNU Octave. qnetworks provides implementations of solution algorithms for single station queueing systems as well as for product and some non product form QN models. Exact, approximate and bound analysis can be performed. Additional utility functions and algorithms for Markov Chains analysis are also included. The qnetworks package is available as free and open source software, allowing users to study, modify and extend the code. This makes qnetworks a viable teaching tool.

show abstract

“…The three algorithms Recal, MVA by Chain and DAC are efficient for a small number of service centers and many closed chains. Details on the algorithms can be found in literature [18,43,21,35].…”

Section: Multichain Modelsmentioning

confidence: 99%

Product Form Queueing Networks

Balsamo

2000

Performance Evaluation: Origins and Directions

View full text Add to dashboard Cite

Computational algorithms for product form queueing networks

Cited by 100 publications

References 12 publications

Applying BCMP multi-class queueing networks for the performance evaluation of hierarchical and modular software systems

Applying BCMP multi-class queueing networks for the performance evaluation of hierarchical and modular software systems

The qnetworks Toolbox: A Software Package for Queueing Networks Analysis

Product Form Queueing Networks

Contact Info

Product

Resources

About