Computing Publications

Publications Home » PEPA queues

PEPA queues

Ashok Argent-Katwala

National Workshop Paper
Process Algebra and Stochastically Timed Activities 2005
September, 2005
Abstract

Queueing theory is a well-established and natural discipline for describing many complex systems. However, in systems which have both complex server and customer behaviour, modelling the precise movement of customers between service centres can be awkward.

We augment ordinary queueing networks with customers and servers specified in the popular stochastic process algebra, PEPA. We use PEPA to represent the local behaviour of the customers and the service centres, and simple mechanisms from queueing theory to describe the migration of customers between queues.

The PEPA queues formalism is presented with an automatic translation directly into PEPA, giving access to the array of tools available to analyse systems.

Keywords
AESOP
Process Algebra
Stochastic Modelling
GZipped Postscript of full publication (135 kilobytes)
(need help viewing GZipped Postscript files?)
BibTEX file for the publication
N.B.
Conditions for downloading publications from this site.
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.