Abstract
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].
This research is partially supported by project SMS, programme ANR non thématique 2005.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Fourneau, J.M., Gelenbe, E.: Flow Equivalence and Stochastic Equivalence in G-Networks. Computational Management Science 1(2), 179–192 (2004)
Fourneau, J.M., Kloul, L., Quessette, F.: Multiple Class Generalized Networks with iterated deletions. Performance Evaluation 42, 1–20 (2000)
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)
Fourneau, J.M., Pekergin, N., Verchère, D.: Reseaux généralisées avec synchronisations cycliques. RAIRO-RO 32(3), 353–372 (1998)
Gelenbe, E.: Random neural networks with negative and positive signals and product form solution. Neural Computation 1(4), 502–510 (1990)
Gelenbe, E.: Product form queueing networks with negative and positive customers. Journal of Applied Probability 28, 656–663 (1991)
Gelenbe, E.: G-networks with triggered customer movement. Journal of Applied Probability 30, 742–748 (1993)
Gelenbe, E.: G-networks with signals and batch removals. Probability in the Engineering and Informational Sciences 7, 335–342 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fourneau, J.M., Quessette, F. (2006). Computing the Steady-State Distribution of G-networks with Synchronized Partial Flushing. In: Levi, A., Savaş, E., Yenigün, H., Balcısoy, S., Saygın, Y. (eds) Computer and Information Sciences – ISCIS 2006. ISCIS 2006. Lecture Notes in Computer Science, vol 4263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11902140_92
Download citation
DOI: https://doi.org/10.1007/11902140_92
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47242-1
Online ISBN: 978-3-540-47243-8
eBook Packages: Computer ScienceComputer Science (R0)