On the relations between BCMP queueing networks and product form solution stochastic petri nets

Author(s):  
G. Balbo ◽  
S.C. Bruell ◽  
M. Sereno
1998 ◽  
Vol 35 (2) ◽  
pp. 473-481 ◽  
Author(s):  
Richard J. Boucherie ◽  
Matteo Sereno

The traffic equations are the basis for the exact analysis of product form queueing networks, and the approximate analysis of non-product form queueing networks. Conditions characterising the structure of the network that guarantees the existence of a solution for the traffic equations are therefore of great importance. This note shows that the new condition stating that each transition is covered by a minimal closed support T-invariant, is necessary and sufficient for the existence of a solution for the traffic equations for batch routing queueing networks and stochastic Petri nets.


1998 ◽  
Vol 35 (02) ◽  
pp. 473-481
Author(s):  
Richard J. Boucherie ◽  
Matteo Sereno

The traffic equations are the basis for the exact analysis of product form queueing networks, and the approximate analysis of non-product form queueing networks. Conditions characterising the structure of the network that guarantees the existence of a solution for the traffic equations are therefore of great importance. This note shows that the new condition stating that each transition is covered by a minimal closed support T-invariant, is necessary and sufficient for the existence of a solution for the traffic equations for batch routing queueing networks and stochastic Petri nets.


Sign in / Sign up

Export Citation Format

Share Document