Abstract
We consider a queueing network of symmetric Gqueues with customers and signals. Since the seminal papers by Gelenbe in the early nineties [7, 9, 10], Generalized networks of queues have received consid- erable attention. But most papers assume to obtain product form that the service times follow exponential distributions. Here we propose a new generalisation of this model with Phase type service times. We also as- sume a new type of signal. When the signal enters a queue, it changes the phase of the customer in service when there is any. As usual after its service completion, a customer moves to another queue and may become a signal. The steady-state distribution for such a network of queues has a product form solution.
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
F. Baskett, K. Chandy, R.R. Muntz, and F.G. Palacios, Open, closed and mixed networks of queues with different classes of customers. Journal ACM, Vol. 22, No 2, pp 248–260, 1975.
X. Chao, Networks of Queues with customers, signals and arbitrary service. Oper- ation Research, V 43, 1995, N3, pp 537–544.
X. Chao, M. Miyazawa M. Pinedo, Queueing Networks: Customers, Signals and Product Form Solutions. J. Wiley, 1999.
J.M. Fourneau, Computing the steady-state distribution of networks with positive and negative customers. 13th IMACS World Congress on Computation and Applied Mathematics, Dublin, 1991.
J.M. Fourneau, E. Gelenbe, and R. Suros G-networks with multiple classes of positive and negative customers. Theoretical Computer Science, Vol. 155, pp 141–156, 1996.
E. Gelenbe, Random neural Networks with Negative and Positive Signals and Product Form Solution. Neural Computation, Vol. 1, No 4, pp 502–510, 1990.
E. Gelenbe, Product form queueing networks with negative and positive customers. Journal of Applied Probability, Vol. 28, pp 656–663, 1991.
E. Gelenbe, and R. Schassberger, Stability of G-Networks. Probability in the Engineering and Informational Sciences, Vol. 6, pp 271–276, 1992.
E. Gelenbe G-networks with instantaneous customer movement. Journal of Applied Probability, Vol. 30, No 3, pp 742–748, 1993.
E. Gelenbe G-Networks with signals and batch removal. Probability in the Engineering and Informational Sciences, Vol. 7, pp 335–342, 1993.
E. Gelenbe G-networks: An unifying model for queueing networks and neural networks. Annals of Operations Research, Vol. 48, No. 1–4, pp 433–461, 1994.
E. Gelenbe, R. Lent and Z. Xu, Design and performance of cognitive packet networks. Performance Evaluation, Vol. 46, No 2–3, pp 155–176, 2001.
E. Gelenbe and J.M. Fourneau, G-networks with resets. Performance Evaluation, Vol. 49, No 1/4, pp 179–191, 2002.
E. Gelenbe and R. Lent, Power-aware ad hoc cognitive packet networks. Ad Hoc Networks, Vol. 2,No 3, pp 205–216, 2004.
F. Kelly. Reversibility and Stochastic Networks. Wiley, New-York, 1979.
M.A. Tran and T. Bonald, On Kelly Networks with Shuffing. Queueing Systems, Vol. 59, pp 53–61, 2008.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media B.V.
About this paper
Cite this paper
Dao-Thi, TH., Fourneau, JM., Tran, MA. (2011). Multiple Class Symmetric G-networks with Phase Type. In: Gelenbe, E., Lent, R., Sakellari, G., Sacan, A., Toroslu, H., Yazici, A. (eds) Computer and Information Sciences. Lecture Notes in Electrical Engineering, vol 62. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-9794-1_10
Download citation
DOI: https://doi.org/10.1007/978-90-481-9794-1_10
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-9793-4
Online ISBN: 978-90-481-9794-1
eBook Packages: EngineeringEngineering (R0)