Abstract
The paper analyzes the class of product-form queueing network models with cyclic topology and blocking. For this class of networks, the concept of a dual network was introduced in [9]. First we derive a set of properties about the primal and dual performance indices. Then on the basis of the dual network, we are able to define an MVA algorithm to evaluate the mean performance indices of a cyclic network with blocking. The computational time complexity of the algorithm is polynomial in the number of nodes and number of jobs of the network. Finally, we define an equivalence relation for the class of product-form queueing networks with blocking, based on the dual network. This equivalence relation can be used to derive some properties of the equivalent networks, related to the performance indices, which simplify the application of the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I.F. Akyildiz and H. von Brand, Computational algorithms for networks of queues with rejection blocking, Acta Inform. 26(1989)559 - 576.
M.H. Ammar and S.B. Gershwin, Equivalence relations in queueing models of fork/join with blocking, Perform. Eval. 10(1989)233 - 245.
S. Balsamo, Properties and analysis of queueing network models with finite capacities, in: Performance Evaluation of Computer and Communication Systems, Lecture Notes in Computer Science 729, Springer, 1994.
S. Balsamo and M.C. Clò, State distribution at arrival times for closed queueing networks with blocking, Technical Report TR-35/92, Dip. Informatica, Univ. Pisa, 1992.
S. Balsamo and V. De Nitto Personè, A survey of product-form queueing networks with blocking and their equivalences, Ann. of Oper. Res. 48(1994)31 - 61.
S. Balsamo and L. Donatiello, On the cycle time distribution in a two-stage cyclic network with blocking, IEEE Trans. on Softw. Eng. 15(1989)1206 - 1216.
J.P. Buzen, Computational algorithms for closed queueing networks with exponential servers, Comm. ACM 16(1973)527 - 531.
Y. Dallery, Z. Liu and D. Towsley, Equivalence, reversibility, symmetry and concavity properties in fork-join queueing networks with blocking, J. ACM 41(1994)903 - 942.
W.J. Gordon and G.F. Newell, Cyclic queueing systems with restricted queues, Oper. Res. 15(1967) 266 - 277.
S.S. Lavenberg and M. Reiser, Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers, J. Appl. Prob. 17(1980)1048 - 1061.
R.O. Onvural, Survey of closed queueing networks with blocking, ACM Comp. Surv. 22(1990) 83 - 121.
H. Perros, Queueing Networks with Blocking, Oxford, 1994.
M. Reiser and S.S. Lavenberg, Mean Value Analysis of closed multichain queueing networks, J. ACM 27(1980)313 - 322.
K.C. Sevcik and I. Mitrani, The distribution of queuing network states at input and output instants, J. ACM 28(1981)358 - 371.
Rights and permissions
About this article
Cite this article
Claudia Clò, M. MVA for product-form cyclic queueing networks with blocking. Annals of Operations Research 79, 83–96 (1998). https://doi.org/10.1023/A:1018995326844
Issue Date:
DOI: https://doi.org/10.1023/A:1018995326844