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]. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Fourneau, J. M., & Quessette, F. (2006). Computing the steady-state distribution of G-networks with synchronized partial flushing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4263 LNCS, pp. 887–896). Springer Verlag. https://doi.org/10.1007/11902140_92
Mendeley helps you to discover research relevant for your work.