G-networks with synchronised arrivals

We consider G-networks in which customers arrive simultaneously in several queues. We denote this new signal as synchronised arrivals. Under some conditions on the arrivals on the boundary of the state space, and the ergodicity condition, we prove that these networks have a product-form steady-state distribution. We show the link between this new signal and the positive signals introduced by Chao, Miyazawa and Pinedo.

[1]  Erol Gelenbe,et al.  G-Networks with resets , 2002 .

[2]  Jane Hillston,et al.  A compositional approach to performance modelling , 1996 .

[3]  Jean-Michel Foumeau.  Closed G-networks with Resets: product form solution , 2007 .

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

[5]  Jean-Michel Fourneau,et al.  Stochastic Automata Networks with Master/Slave Synchronization: Product Form and Tensor , 2009, ASMTA.

[6]  Peter G. Harrison.  Compositional reversed Markov processes, with applications to G-networks , 2004, Perform. Evaluation.

[7]  Erol Gelenbe,et al.  Analysis and Synthesis of Computer Systems , 1980 .

[8]  Peter G. Harrison,et al.  Product-forms and functional rates , 2009, Perform. Evaluation.

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

[10]  Jean-Michel Fourneau.  Closed G-networks with Resets: product form solution , 2007, Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007).

[11]  R. Kellogg,et al.  Pathways to solutions, fixed points, and equilibria , 1983 .

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

[13]  Erol Gelenbe,et al.  Analysis and Synthesis of Computer Systems: Texts) , 2010 .

[14]  Jean Mairesse,et al.  Zero-Automatic Networks , 2008, Discret. Event Dyn. Syst..

[15]  Rs Stainton,et al.  Pathways to solutions , 1984 .

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

[17]  Jean Mairesse,et al.  Zero-Automatic Queues , 2005, EPEW/WS-FM.

[18]  Jean-Michel Fourneau,et al.  An algebraic condition for product form in stochastic automata networks without synchronizations , 2008, Perform. Evaluation.

[19]  Peter G. Harrison,et al.  A unifying approach to product-forms in networks with finite capacity constraints , 2010, SIGMETRICS '10.

[20]  Peter G. Harrison,et al.  Turning back time in Markovian process algebra , 2003, Theor. Comput. Sci..

[21]  L. Flatto,et al.  Two parallel queues created by arrivals with two demands. II , 1984 .

[22]  Michael Pinedo,et al.  Queueing networks - customers, signals and product form solutions , 1999, Wiley-Interscience series in systems and optimization.

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

[24]  William A. Massey,et al.  Stochastic ordering for Markov processes on partially ordered spaces with applications to queueing networks , 1991 .

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

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

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

[28]  Ben Atkinson,et al.  Queuing Networks: Customers, Signals and Product Form Solutions , 2001, J. Oper. Res. Soc..

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