Monotone Queuing Networks and Time Parallel Simulation

We show how we can make more efficient the time parallel simulation of some queueing networks. We had previously introduced some improvements of two classical time parallel simulation approaches: the precomputation of states at specific time instants and the fix-up computations. We have proved that we can obtain more parallelism using monotonicity on input sequences or on the initial states of the simulation parts and obtain quickly a bound of the sample-path. Here we apply the fixed up computations approach to the time parallel simulation of queueing networks with general service times and complex routing disciplines. This approach is based on the theory of monotone models of simulation. We establish that our models are monotone and we show how we obtain proved upper or lower bounds of the sample-path of the simulation and bounds of some estimates as well.

[1]  Richard M. Fujimoto,et al.  Parallel simulation of statistical multiplexers , 1995, Discret. Event Dyn. Syst..

[2]  R.M. Fujimoto,et al.  Parallel and distributed simulation systems , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[3]  J.-M. Vincent.  Perfect Simulation of Queueing Networks with Blocking and Rejection , 2005 .

[4]  Damla Turgut,et al.  Challenges and benefits of time-parallel simulation of wireless ad hoc networks , 2006, valuetools '06.

[5]  Sigrún Andradóttir,et al.  Time-segmentation parallel simulation of networks of queues with loss or communication blocking , 1995, TOMC.

[6]  Albert G. Greenberg,et al.  ICASE MASSIVELY PARALLEL ALGORITHMS FOR TRACE-DRIVEN CACHE SIMULATIONS , 1991 .

[7]  Jean-Michel Fourneau,et al.  Networks of Symmetric Multi-class Queues with Signals Changing Classes , 2010, ASMTA.

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

[9]  Jean-Michel Fourneau,et al.  Improving Time Parallel Simulation for Monotone Systems , 2009, 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications.

[10]  Sigrún Andradóttir,et al.  Parallel simulation of transfer lines by time segmentation , 2004, Eur. J. Oper. Res..

[11]  Jean-Michel Fourneau,et al.  An Algorithmic Approach to Stochastic Bounds , 2002, Performance.

[12]  P. Rousseeuw,et al.  Wiley Series in Probability and Mathematical Statistics , 2005 .

[13]  宮沢 政清,et al.  P. Bremaud 著, Markov Chains, (Gibbs fields, Monte Carlo simulation and Queues), Springer-Verlag, 1999年 , 2000 .

[14]  Jean-Marc Vincent,et al.  Perfect simulation of index based routing queueing networks , 2006, PERV.

[15]  Richard M. Fujimoto,et al.  Parallel and Distribution Simulation Systems , 1999 .

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

[17]  Jean-Marc Vincent,et al.  Different Monotonicity Definitions in Stochastic Modelling , 2009, ASMTA.

[18]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

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

[20]  Damla Turgut,et al.  Speedup-Precision Tradeoffs in Time-Parallel Simulation of Wireless Ad hoc Networks , 2006, 2006 Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications.

[21]  J. Propp,et al.  Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996 .

[22]  Albert G. Greenberg,et al.  Algorithms for unboundedly parallel simulations , 1991, TOCS.

[23]  Jean-Michel Fourneau,et al.  An open tool to compute stochastic bounds on steady-state distributions and rewards , 2003, 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003..

[24]  P. Glasserman,et al.  Monotone Structure in Discrete-Event Systems , 1994 .

[25]  Hagit Attiya,et al.  Wiley Series on Parallel and Distributed Computing , 2004, SCADA Security: Machine Learning Concepts for Intrusion Detection and Prevention.

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