Computing the Steady-State Distribution of G-networks with Synchronized Partial Flushing
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 .
KeywordsProduct Form Service Rate Negative Customer Network Transformation Product Form Solution
Unable to display preview. Download preview PDF.
- 1.Fourneau, J.M.: Computing the steady-state distribution of networks with positive and negative customers. In: 13th IMACS World Congress on Computation and Applied Mathematics, Dublin (1991)Google Scholar
- 5.Fourneau, J.M., Pekergin, N., Verchère, D.: Reseaux généralisées avec synchronisations cycliques. RAIRO-RO 32(3), 353–372 (1998)Google Scholar