Abstract

In this paper, a class of closed queueing networks is modelled in the Markovian process algebra PEPA and solved using the classical mean value analysis. This approach is attractive as it negates the need to derive the entire state space, and so certain metrics from large models can be obtained with little computational effort. The class of models considered includes models that are not obviously classical closed queueing models. This paper extends previous results by deriving exact solutions for models with multiple copies of queue stations. Due to the cost of deriving an exact solution, a simplifying approximation is derived, which is shown to be highly accurate when the population is large. The approach is illustrated with three examples.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call