Abstract
We consider a queueing network of symmetric Gqueues with customers and signals. Each queue has one or several servers. The service time is exponential. After its service completion, a customer moves to another queue and may become a signal. When the signal enters a queue, it changes the class of the customer in service if there is any. We prove that the steady state distribution for such a network of queues has a product form solution.
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
Artalejo, J.R.: G-networks: a versatile approach for work removal in queueing networks. European J. Op. Res. 126, 233–249 (2000)
Baskett, F., Chandy, K., Muntz, R.R., Palacios, F.G.: Open, closed and mixed networks of queues with different classes of customers. Journal ACM 22(2), 248–260 (1975)
Chao, X., Miyazawa, M., Pinedo, M.: Queueing Networks: Customers, Signals and Product Form Solutions. J. Wiley, Chichester (1999)
Dao-Thi, T.-H., Mairesse, J.: Zero-Automatic Networks. Discrete Event Dynamic Systems 18(4), 499–536 (2008)
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., Suros, R.: G-networks with multiple classes of positive and negative customers. Theoretical Computer Science 155, 141–156 (1996)
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., Schassberger, R.: Stability of G-Networks. Probability in the Engineering and Informational Sciences 6, 271–276 (1992)
Gelenbe, E.: G-networks with instantaneous customer movement. Journal of Applied Probability 30(3), 742–748 (1993)
Gelenbe, E.: G-Networks with signals and batch removal. Probability in the Engineering and Informational Sciences 7, 335–342 (1993)
Gelenbe, E.: G-networks: An unifying model for queueing networks and neural networks. Annals of Operations Research 48(1-4), 433–461 (1994)
Gelenbe, E.: The first decade of G-networks. European J. Op. Res. 126(2), 231–232 (2000)
Gelenbe, E., Lent, R., Xu, Z.: Design and performance of cognitive packet networks. Performance Evaluation 46(2), 155–176 (2001)
Gelenbe, E., Fourneau, J.M.: G-networks with resets. Performance Evaluation 49(1/4), 179–191 (2002)
Gelenbe, E., Lent, R.: Power-aware ad hoc cognitive packet networks. Ad Hoc Networks 2(3), 205–216 (2004)
Kelly, F.: Reversibility and Stochastic Networks. Wiley, New-York (1979)
Mohamed, S., Rubino, G., Varela, M.: Performance evaluation of real-time speech through a packet network: a random neural networks-based approach. Performance Evaluation 57(2), 141–161 (2004)
Rubino, G., Tirilly, P., Varela, M.: Evaluating Users’ Satisfaction in Packet Networks Using Random Neural Networks. In: Kollias, S.D., Stafylopatis, A., Duch, W., Oja, E. (eds.) ICANN 2006. LNCS, vol. 4131, pp. 303–312. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dao-Thi, TH., Fourneau, JM., Tran, MA. (2010). Networks of Symmetric Multi-class Queues with Signals Changing Classes. In: Al-Begain, K., Fiems, D., Knottenbelt, W.J. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2010. Lecture Notes in Computer Science, vol 6148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13568-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-13568-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13567-5
Online ISBN: 978-3-642-13568-2
eBook Packages: Computer ScienceComputer Science (R0)