Skip to main content

Networks of Symmetric Multi-class Queues with Signals Changing Classes

  • Conference paper
Analytical and Stochastic Modeling Techniques and Applications (ASMTA 2010)

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Artalejo, J.R.: G-networks: a versatile approach for work removal in queueing networks. European J. Op. Res. 126, 233–249 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. 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)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chao, X., Miyazawa, M., Pinedo, M.: Queueing Networks: Customers, Signals and Product Form Solutions. J. Wiley, Chichester (1999)

    MATH  Google Scholar 

  4. Dao-Thi, T.-H., Mairesse, J.: Zero-Automatic Networks. Discrete Event Dynamic Systems 18(4), 499–536 (2008)

    Article  MATH  MathSciNet  Google Scholar 

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

  6. Fourneau, J.M., Gelenbe, E., Suros, R.: G-networks with multiple classes of positive and negative customers. Theoretical Computer Science 155, 141–156 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  7. Gelenbe, E.: Random neural Networks with Negative and Positive Signals and Product Form Solution. Neural Computation 1(4), 502–510 (1990)

    Article  Google Scholar 

  8. Gelenbe, E.: Product form queueing networks with negative and positive customers. Journal of Applied Probability 28, 656–663 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  9. Gelenbe, E., Schassberger, R.: Stability of G-Networks. Probability in the Engineering and Informational Sciences 6, 271–276 (1992)

    Article  MATH  Google Scholar 

  10. Gelenbe, E.: G-networks with instantaneous customer movement. Journal of Applied Probability 30(3), 742–748 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  11. Gelenbe, E.: G-Networks with signals and batch removal. Probability in the Engineering and Informational Sciences 7, 335–342 (1993)

    Article  Google Scholar 

  12. Gelenbe, E.: G-networks: An unifying model for queueing networks and neural networks. Annals of Operations Research 48(1-4), 433–461 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  13. Gelenbe, E.: The first decade of G-networks. European J. Op. Res. 126(2), 231–232 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  14. Gelenbe, E., Lent, R., Xu, Z.: Design and performance of cognitive packet networks. Performance Evaluation 46(2), 155–176 (2001)

    Article  MATH  Google Scholar 

  15. Gelenbe, E., Fourneau, J.M.: G-networks with resets. Performance Evaluation 49(1/4), 179–191 (2002)

    Article  MATH  Google Scholar 

  16. Gelenbe, E., Lent, R.: Power-aware ad hoc cognitive packet networks. Ad Hoc Networks 2(3), 205–216 (2004)

    Article  Google Scholar 

  17. Kelly, F.: Reversibility and Stochastic Networks. Wiley, New-York (1979)

    MATH  Google Scholar 

  18. 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)

    Article  Google Scholar 

  19. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics