Product-Forms in Multi-Way Synchronizations

A new algorithm is given to find product-form solutions for the joint equilibrium probabilities in a class of synchronized Markov processes.This is based on, and proved by, multiple applications of the Reversed CompoundAgent Theorem (RCAT) and can describe multi-way synchronizations (seen as chains of pairwise synchronizations) that occur in a prescribed order. The length of the sequence is unbounded but finite with probability 1. Several applications are given to illustrate the methodology, which include various modes of resets in queueing networks with negative customers. In particular, it is shown that there is a type of reset that can propagate further transitions in a chain actively. Furthermore, a number of completely new product-form models, for example, where the transitions in a chain are non-homogeneous, are given.

[1]  Boris G. Pittel,et al.  Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis , 1979, Math. Oper. Res..

[2]  Marco Ajmone Marsan,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984, TOCS.

[3]  Maria Grazia Vigliotti,et al.  A general result for deriving product-form solutions in markovian models , 2010, WOSP/SIPEW '10.

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

[5]  Brigitte Plateau.  On the stochastic structure of parallelism and synchronization models for distributed algorithms , 1985, SIGMETRICS 1985.

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

[7]  Samuel Rota Bulò,et al.  A general algorithm to compute the steady-state solution of product-form cooperating Markov chains , 2009, 2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems.

[8]  Simonetta Balsamo,et al.  Queueing Networks , 2007, SFM.

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

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

[11]  Simonetta Balsamo,et al.  A Numerical Algorithm for the Decomposition of Cooperating Structured Markov Processes , 2012, 2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

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

[13]  Catherine Rosenberg,et al.  Queues with slowly varying arrival and service processes , 1990 .

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

[15]  Peter G. Harrison,et al.  Deriving the rate equations characterising product-form models and application to propagating synchronisations , 2012, 6th International ICST Conference on Performance Evaluation Methodologies and Tools.

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

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

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

[19]  Richard J. Boucherie,et al.  Queueing networks : a fundamental approach , 2011 .

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

[21]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[22]  Peter Buchholz.  Product Form Approximations for Communicating Markov Processes , 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

[23]  Erol Gelenbe,et al.  Flow equivalence and stochastic equivalence in G-networks , 2004, Comput. Manag. Sci..

[24]  Erol Gelenbe,et al.  Product form networks with negative and positive customers , 1991 .

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

[26]  Jean-Michel Fourneau,et al.  Computing the Steady-State Distribution of G-networks with Synchronized Partial Flushing , 2006, ISCIS.

[27]  Peter G. Harrison,et al.  Separable equilibrium state probabilities via time reversal in Markovian process algebra , 2005, Theor. Comput. Sci..

[28]  Thomas G. Robertazzi,et al.  Markovian Petri Net Protocols with Product Form Solution , 1991, Perform. Evaluation.

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

[30]  Peter G. Harrison,et al.  Methodological construction of product-form stochastic Petri nets for performance evaluation , 2012, J. Syst. Softw..

[31]  Stephen S. Lavenberg,et al.  Computer Performance Modeling Handbook , 1983, Int. CMG Conference.

[32]  Ian F. Akyildiz,et al.  Exact Product Form Solution for Queueing Networks with Blocking , 1987, IEEE Transactions on Computers.

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

[34]  Peter G. Harrison,et al.  Reversed processes, product forms and a non-product form☆ , 2004 .

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