Multiple class G-networks with iterated deletions
Performance Evaluation
Multiclass G-Networks of Processor Sharing Queues with Resets
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
Complex synchronizations in Markovian models: a tensor-based proof of product form
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
A numerical algorithm for the solution of product-form models with infinite state spaces
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
An initiative for a classified bibliography on G-networks
Performance Evaluation
Markovian queueing network with complex synchronizations: Product form and tensor
Performance Evaluation
Bibliography on G-networks, negative customers and applications
Mathematical and Computer Modelling: An International Journal
Analysis of stochastic Petri nets with signals
Performance Evaluation
| Hi-index | 0.00 |
We have shown in [5,4,3] that G-networks with synchronized partial flushing still have a product form steady-state distribution. These networks may have very complex dynamics where an arbitrary number of customers leave an arbitrary number of queues at the same time. The network flow equation are non linear and the usual approaches to solve them fail. We present here a new numerical algorithm which is based on a transform of the G-network to a classical G-network with triggers. We show that the flow equation are transformed by a classical elimination procedure. This new result puts more emphasis on the importance of flow equations following the approach recently proposed by Gelenbe in [2].