A Continuous State Space Approximation for PEPA Queues
نویسندگان
چکیده
PEPA Queues is a formalism that augments queueing networks with customers that have behavioural characteristics, as defined by PEPA components. PEPA Queues suffer from the traditional state-space explosion that affects both closed queueing networks and PEPA models. We discuss a possible solution to this with a continuous state-space approximation that allows us to derive an underlying mathematical model based on ordinary differential equations from a PEPA Queues model.
منابع مشابه
Continuous approximation of PEPA models and Petri nets
Modelling very large systems that consist of many similar components can lead to state space explosion. Continuous approximation can avoid this. In the stochastic process algebra PEPA, models with large numbers of identical components can be approximated in a continuous fashion by a set of coupled ordinary differential equations (ODEs). Similarly, timed continuous Petri nets can be used to appr...
متن کاملFundamental Results on Fluid Approximations of Stochastic Process Algebra Models
In order to avoid the state space explosion problem encountered in the quantitative analysis of large scale PEPA models, a fluid approximation approach has recently been proposed, which results in a set of ordinary differential equations (ODEs) to approximate the underlying continuous time Markov chain (CTMC). This paper presents a mapping semantics from PEPA to ODEs based on a numerical repres...
متن کاملAnalysing distributed Internet worm attacks using continuous state-space approximation of process algebra models
Internet worms are classically described using SIR models and simulations, to capture the massive dynamics of the system. Here we are able to generate a differential equation-based model of infection based solely on the underlying process description of the infection agent model. Thus, rather than craft a differential equation model directly, we derive this representation automatically from a h...
متن کاملPEPA Queues: Capturing Customer Behaviour in Queueing Networks
Queueing network formalisms are very good at describing the spatial movement of customers, but typically poor at describing how customers change as they move through the network. We present the PEPA Queues formalism, which uses the popular stochastic process algebra PEPA to represent the individual state and behaviour of customers and servers. We offer a formal semantics for PEPA Queues, plus a...
متن کاملScalable Analysis of Stochastic Process Algebra Models
The performance modelling of large-scale systems using discrete-state approaches is fundamentally hampered by the well-known problem of state-space explosion, which causes exponential growth of the reachable state space as a function of the number of the components which constitute the model. Because they are mapped onto continuous-time Markov chains (CTMCs), models described in the stochastic ...
متن کامل