G-Networks: Development of the Theory of Multiplicative Networks

This is a review on G-networks, which are the generalization of the Jackson and BCMP networks, for which the multi-dimensional stationary distribution of the network state probabilities is also represented in product form. The G-networks primarily differ from the Jackson and BCMP networks in that they additionally contain a flow of the so-called negative customers and/or triggers. Negative customers and triggers are not served. When a negative customer arrives at a network node, one or a batch of positive (ordinary) customers is killed (annihilated, displaced), whereas a trigger displaces a positive customer from the node to some other node. For applied mathematicians, G-networks are of great interest for extending the multiplicative theory of queueing networks and for practical specialists in modeling computing systems and networks and biophysical neural networks for solving pattern recognition and other problems.

[1]  Richard F. Serfozo,et al.  Markov network processes with string transitions , 1998 .

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

[3]  Onno Boxma,et al.  A Note on Negative Customers, GI/G/1 Workload and Risk Processes , 1996 .

[4]  Peter G. Harrison,et al.  The M/G/1 queue with negative customers , 1996, Advances in Applied Probability.

[5]  Boris Gnedenko,et al.  Introduction to queueing theory , 1968 .

[6]  Shaler Stidham,et al.  Cost Models for Stochastic Clearing Systems , 1977, Oper. Res..

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

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

[9]  T. S. Dovzhenok.  Invariance of the Stationary Distribution of Networks with Bypasses and “Negative” Customers , 2002 .

[10]  Peter G. Harrison.  The MM CPP/GE/c G-Queue: Sojourn Time Distribution , 2002, Queueing Syst. Theory Appl..

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

[12]  J.R. Artalejo,et al.  G-networks: A versatile approach for work removal in queueing networks , 2000, Eur. J. Oper. Res..

[13]  James R. Jackson,et al.  Jobshop-Like Queueing Systems , 2004, Manag. Sci..

[14]  Kisu Kim,et al.  A generalized cost model for stochastic clearing systems , 1993, Comput. Oper. Res..

[15]  P. P. Bocharov.  On Queueing Networks with Signals , 2002 .

[16]  Xiuli Chao,et al.  Networks of Queues with Customers, Signals and Arbitrary Service Time Distributions , 1995, Oper. Res..

[17]  J. Ben Atkinson,et al.  An Introduction to Queueing Networks , 1988 .

[18]  A. Gómez-Corral,et al.  Generalized birth and death processes with applications to queues with repeated attempts and negative arrivals , 1998 .

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

[20]  Peter G. Taylor,et al.  STATE-DEPENDENT SIGNALLING IN QUEUEING NETWORKS , 1994 .

[21]  Erol Gelenbe.  Réseaux neuronaux aléatoires stables , 1990 .

[22]  Erol Gelenbe,et al.  Learning in the Recurrent Random Neural Network , 1992, Neural Computation.

[23]  Richard J. Boucherie,et al.  Local balance in queueing networks with positive and negative customers , 1994, Ann. Oper. Res..

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

[25]  Xiuli Chao,et al.  A result on networks of queues with customer coalescence and state-dependent signaling , 1998 .

[26]  Guy Pujolle,et al.  Product form in discrete-time queueing networks: new issues , 1995, MASCOTS '95. Proceedings of the Third International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[27]  Peter G. Harrison,et al.  SOJOURN TIMES IN SINGLE-SERVER QUEUES WITH NEGATIVE CUSTOMERS , 1993 .

[28]  P. Moran,et al.  Reversibility and Stochastic Networks , 1980 .

[29]  Michael Pinedo,et al.  On Queueing Networks with Signals and History-Dependent Routing , 1995, Probability in the Engineering and Informational Sciences.

[30]  F. G. Foster.  On the Stochastic Matrices Associated with Certain Queuing Processes , 1953 .

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

[32]  Erol Gelenbe,et al.  Stability of the Random Neural Network Model , 1990, Neural Computation.

[33]  Karl Sigman,et al.  Generalizing the Pollaczek-Khintchine Formula to Account for Arbitrary Work Removal , 1996, Probability in the Engineering and Informational Sciences.

[34]  Erol Gelenbe,et al.  Minimum Graph Covering with the Random Neural Network Model , 1992 .

[35]  Jean C. Walrand,et al.  A probabilistic look at networks of quasireversible queues , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

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

[37]  Peter G. Harrison,et al.  A Markov modulated multi-server queue with negative customers – The MM CPP/GE/c/L G-queue , 2001, Acta Informatica.

[38]  Jesus R. Artalejo,et al.  Computation of the limiting distribution in queueing systems with repeated attempts and disasters , 1999, RAIRO Oper. Res..

[39]  Xiuli Chao,et al.  A Note on Queueing Networks with Signals and Random Triggering Times , 1994, Probability in the Engineering and Informational Sciences.

[40]  Andrew S. Noetzel.  A Generalized Queueing Discipline for Product Form Network Solutions , 1979, JACM.

[41]  Shaler Stidham,et al.  Semi-Stationary Clearing Processes. , 1978 .

[42]  Nico M. van Dijk.  Queueing networks and product forms - a systems approach , 1993, Wiley-Interscience series in systems and optimization.

[43]  Simon S. Lam,et al.  Queuing Networks with Population Size Constraints , 1977, IBM J. Res. Dev..

[44]  A. Gómez-Corral,et al.  On a tandem G-network with blocking , 2002, Advances in Applied Probability.

[45]  Onno Boxma,et al.  The workload in the M/G/1 queue with work removal , 1995 .

[46]  Masakiyo Miyazawa,et al.  Markov network processes with product form stationary distributions , 1998, Queueing Syst. Theory Appl..

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

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

[49]  Karl Sigman,et al.  A Pollaczek–Khintchine formula for M/G/1 queues with disasters , 1996, Journal of Applied Probability.

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

[51]  P. P Bocharov,et al.  Retrial queueing system with several input flows , 2001 .

[52]  P. P. Bocharov,et al.  A Queueing Network with Random-Delay Signals , 2002 .

[53]  Peter G. Harrison,et al.  Response time distributions in tandem G-networks , 1995, Journal of Applied Probability.

[54]  Jesús R. Artalejo,et al.  Stochastic analysis of the departure and quasi-input processes in a versatile single-server queue , 1996 .

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

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

[57]  Jesús R. Artalejo,et al.  Analysis of a stochastic clearing system with repeated attempts , 1998 .

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

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

[60]  E. Gelende.  Réseaux stochastiques ouverts avec clients négatifs et positifs, et réseaux neuronaux , 1989 .

[61]  Jean C. Walrand,et al.  An introduction to queueing networks , 1989, Prentice Hall International editions.

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

[63]  J. R. Artalejo,et al.  On a single server queue with negative arrivals and request repeated , 1999 .

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

[65]  Xiuli Chao,et al.  A queueing network model with catastrophes and product form solution , 1995, Oper. Res. Lett..

[66]  Onno J. Boxma,et al.  Wiener-Hopf analysis of an M/G/1 queue with negative customers and of a related class of random walks , 1996, Queueing Syst. Theory Appl..

[67]  Jesús R. Artalejo,et al.  Performance analysis of a single-server queue with repeated attempts , 1999 .

[68]  Erol Gelenbe,et al.  G-networks with multiple classes of signals and positive customers , 1998, Eur. J. Oper. Res..