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

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.

[1]  Erol Gelenbe.  G-Networks with Signals and Batch Removal , 1993 .

[2]  E. Gelenbe.  Product-form queueing networks with negative and positive customers , 1991 .

[3]  Erol Gelenbe,et al.  Multiple class G-Networks , 1992, Computer Science and Operations Research.

[4]  Peter G. Taylor,et al.  Geometric equilibrium distributions for queues with interactive batch departures , 1994, Ann. Oper. Res..

[5]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[6]  Michael Pinedo,et al.  Networks of queues with batch services, signals and product form solutions , 1995, Oper. Res. Lett..

[7]  Erol Gelenbe,et al.  Random Neural Networks with Negative and Positive Signals and Product Form Solution , 1989, Neural Computation.

[8]  Erol Gelenbe,et al.  G-networks: a unifying model for neural and queueing networks , 1993, MASCOTS.

[9]  Erol Gelenbe,et al.  G-Networks with Multiple Classes of Negative and Positive Customers , 1996, Theor. Comput. Sci..

[10]  Erol Gelenbe,et al.  Queues with negative arrivals , 1991, Journal of Applied Probability.

[11]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[12]  E. Gelenbe.  G-networks by triggered customer movement , 1993 .

[13]  Erol Gelenbe,et al.  Parallel Algorithm for Colour Texture Generation Using the Random Neural Network Model , 1992, Int. J. Pattern Recognit. Artif. Intell..

[14]  E. Gelenbe,et al.  Performances d'un système informatique dupliqué , 1991 .

[15]  Peter G. Taylor,et al.  Networks of customer queues and resource queues , 1994 .

[16]  Erol Gelenbe,et al.  Stability of Product Form G-Networks , 1992 .

[17]  W. Henderson.  Queueing networks by negative customers and negative queue lengths , 1993 .

[18]  M. Miyazawa.  Insensitivity and product-form decomposability of reallocatable GSMP , 1993 .

[19]  Michael Pinedo,et al.  On Generalized Networks of Queues with Positive and Negative Arrivals , 1993, Probability in the Engineering and Informational Sciences.