Advertisement

G-Networks: Multiple Classes of Positive Customers, Signals, and Product Form Results

  • Erol Gelenbe
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2459)

Abstract

The purpose of this tutorial presentation is to introduce G-Networks, or Gelenbe Networks, which are product form queueing networks which include normal or positive customers, as well as negative customers which destroy other customers, and triggers which displace other customers from one queue to another. We derive the balance equations for these models in the context of multiple customer classes, show the product form results, and exhibit the traffic equations which — in this case, contrary to BCMP and Jackson networks — are non-linear. This leads to interesting issues of existence and uniqueness of the steady-state solution. Gelenbe Network can be used to model large scale computer systems and networks in which signaling functions represented by negative customers and triggers are used to achieve flow and congestion control.

References

  1. 1.
    Kemmeny, J.G., Snell, J.L. “Finite Markov Chains”, Von Nostrand, Princeton, 1965.Google Scholar
  2. 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, Vol. 22, No 2, pp 248–260, April 1975.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Gelenbe E. “Random neural networks with negative and positive signals and product form solution”, Neural Computation, Vol. 1, No. 4, pp 502–510, 1989.CrossRefGoogle Scholar
  4. 4.
    Gelenbe E. “Product form queueing networks with negative and positive customers”, Journal of Applied Probability, Vol. 28, pp 656–663, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Gelenbe E., Glynn P., Sigmann K. “Queues with negative customers”, Journal of Applied Probability, Vol. 28, pp 245–250, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Fourneau J.M. “Computing the steady-state distribution of networks with positive and negative customers”, Proc. 13-th IMACS World Congress on Computation and Applied Mathematics, Dublin, 1991.Google Scholar
  7. 7.
    E. Gelenbe, S. Tucci “Performances d’un système informatique dupliqué”, Comptes-Rendus Acad. Sci., t 312, Série II, pp. 27–30, 1991.Google Scholar
  8. 8.
    Gelenbe E., Schassberger R. “Stability of G-Networks”, Probability in the Engineering and Informational Sciences, Vol. 6, pp 271–276, 1992.zbMATHGoogle Scholar
  9. 9.
    Fourneau, J.M., Gelenbe, E. “Multiple class G-networks,” Conference of the ORSA Technical Committee on Computer Science, Williamsburg, VA, Balci, O. (Ed.), Pergamon, 1992.Google Scholar
  10. 10.
    Atalay, V., Gelenbe, E. “Parallel algorithm for colour texture generation using the random neural network model”, International Journal of Pattern Recognition and Artificial Intelligence, Vol. 6, No. 2 & 3, pp 437–446, 1992.CrossRefGoogle Scholar
  11. 11.
    Miyazawa, M. “ Insensitivity and product form decomposability of reallocatable GSMP”, Advancesin Applied Probability, Vol. 25, No. 2, pp 415–437, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Henderson, W. “ Queueing networks with negative customers and negative queue lengths”, Journal of Applied Probability, Vol. 30, No. 3, 1993.Google Scholar
  13. 13.
    Gelenbe E. “G-Networks with triggered customer movement”, Journal of Applied Probability, Vol. 30, No. 3, pp 742–748, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Gelenbe E., “G-Networks with signals and batch removal”, Probability in the Engineering and Informational Sciences, Vol. 7, pp 335–342, 1993.Google Scholar
  15. 15.
    Chao, X., Pinedo, M. “On generalized networks of queues with positive and negative arrivals”, Probability in the Engineering and Informational Sciences, Vol. 7, pp 301–334, 1993.CrossRefGoogle Scholar
  16. 16.
    Henderson, W., Northcote, B.S., Taylor, P.G. “Geometric equilibrium distributions for queues with interactive batch departures,” Annals of Operations R esearch, Vol. 48, No. 1—4, 1994.Google Scholar
  17. 17.
    Henderson, W., Northcote, B.S., Taylor, P.G. “Networks of customer queues and resource queues”, Proc. International Teletraffic Congress 14, Labetoulle, J. and Roberts, J. (Eds.), pp 853–864, Elsevier, 1994.Google Scholar
  18. 18.
    Gelenbe, E. “G-networks: an unifying model for neural and queueing networks”, Annals of Operations Research, Vol. 48, No. 1–4, pp 433–461, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Chao, X., Pinedo, M. “Product form queueing networks with batch services, signals, and product form solutions”, Operations Research Letters, Vol. 17, pp 237–242, 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    J.M. Fourneau, E. Gelenbe, R. Suros “G-networks with multiple classes of positive and negative customers,” Theoretical Computer Science, Vol. 155, pp. 141–156, 1996.zbMATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Gelenbe, E., Labed A. “G-networks with multiple classes of customers and triggers”, to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Erol Gelenbe
    • 1
  1. 1.School of Electrical Engineering and Computer ScienceUniversity of Central FloridaOrlando

Personalised recommendations