Computing the Steady-State Distribution of G-networks with Synchronized Partial Flushing

  • J. M. Fourneau
  • F. Quessette
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4263)


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].


Product Form Service Rate Negative Customer Network Transformation Product Form Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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
  2. 2.
    Fourneau, J.M., Gelenbe, E.: Flow Equivalence and Stochastic Equivalence in G-Networks. Computational Management Science 1(2), 179–192 (2004)MATHCrossRefGoogle Scholar
  3. 3.
    Fourneau, J.M., Kloul, L., Quessette, F.: Multiple Class Generalized Networks with iterated deletions. Performance Evaluation 42, 1–20 (2000)MATHCrossRefGoogle Scholar
  4. 4.
    Fourneau, J.M., Kloul, L., Verchère, D.: Multiple Class G-Networks with list oriented deletions. European Journal on Operation Research 126, 250–272 (2000)MATHCrossRefGoogle Scholar
  5. 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
  6. 6.
    Gelenbe, E.: Random neural networks with negative and positive signals and product form solution. Neural Computation 1(4), 502–510 (1990)CrossRefGoogle Scholar
  7. 7.
    Gelenbe, E.: Product form queueing networks with negative and positive customers. Journal of Applied Probability 28, 656–663 (1991)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Gelenbe, E.: G-networks with triggered customer movement. Journal of Applied Probability 30, 742–748 (1993)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Gelenbe, E.: G-networks with signals and batch removals. Probability in the Engineering and Informational Sciences 7, 335–342 (1993)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • J. M. Fourneau
    • 1
  • F. Quessette
    • 1
  1. 1.PRiSM, Université de Versailles St-Quentin en YvelinesVersaillesFrance

Personalised recommendations