Bounding techniques for transient analysis of G-networks with catastrophes

We apply stochastic comparisons in order to bound the transient behavior of G-networks with catastrophes. These networks belong to Gelenbe's networks, with both positive and negative customers (or signals). We consider catastrophes where the signal deletes all customers in a queue. G-networks have a known product form steady-state distribution, but it is still impossible to obtain the transient distributions by a closed form. In the present paper, we propose to define smaller queueing systems providing bounds for subnetworks of the G-network with catastrophes. We apply stochastic comparisons by mapping functions to build bounding models. We derive transient performance measure bounds for applications as malware software infections. For instance, we obtain bounds for the first time of infection, or the number of times a station has been infected in a time interval. We study the tradeoff between the size of the subnetwork and the quality of the bounds with respect to parameters.

[1]  Torgny Lindvall.  Stochastic Monotonicities in Jackson Queueing Networks , 1997 .

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

[3]  T. Lindvall.  Lectures on the Coupling Method , 1992 .

[5]  N. Pekergin,et al.  Stochastic bounds on the transient behaviors of the G-networks , 2002 .

[6]  William A. Massey.  A FAMILY OF BOUNDS FOR THE TRANSIENT BEHAVIOR OF A JACKSON NETWORK , 1986 .

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

[8]  Hind Castel-Taleb,et al.  Aggregated bounding Markov processes applied to the analysis of tandem queues , 2007, VALUETOOLS.

[9]  Virginia Giorno,et al.  A note on birth–death processes with catastrophes , 2008 .

[10]  Laurent Truffet.  Reduction techniques for discrete-time Markov chains on totally ordered state space using stochastic comparisons , 2000, Journal of Applied Probability.

[11]  Erol Gelenbe.  Dealing with software viruses: A biological paradigm , 2007, Inf. Secur. Tech. Rep..

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

[13]  H. Castel-Taleb,et al.  Aggregated bounding Markov processes applied to the analysis of tandem queues , 2007, Valuetools 2007.

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

[15]  B. Krishna Kumar,et al.  Transient solution of an M/M/1 queue with catastrophes , 2000 .

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

[17]  T. Kamae,et al.  Stochastic Inequalities on Partially Ordered Spaces , 1977 .

[18]  Moshe Shaked,et al.  Stochastic orders and their applications , 1994 .

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

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

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

[22]  Hind Castel-Taleb,et al.  Bounding Aggregations for Transient and Stationary Performance Analysis of Subnetworks , 2012, Comput. J..

[23]  Gunter Bolch,et al.  Queueing Networks and Markov Chains , 2005 .

[24]  M. Doisy,et al.  A coupling technique for stochastic comparison of functions of Markov Processes , 2000, Adv. Decis. Sci..

[25]  A. Müller,et al.  Comparison Methods for Stochastic Models and Risks , 2002 .

[26]  Hind Castel-Taleb,et al.  Stochastic comparisons applied to G-Networks with catastrophes , 2010, ISCIS.

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