PEPA Queues: Capturing Customer Behaviour in Queueing Networks | Zendy

Ashok Argent-Katwala | Zendy; Jeremy T. Bradley | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

PEPA Queues: Capturing Customer Behaviour in Queueing Networks

Author(s) -

Ashok Argent-Katwala,

Jeremy T. Bradley

Publication year - 2007

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2007.07.002

Subject(s) - computer science , queueing theory , formalism (music) , rotation formalisms in three dimensions , process calculus , queue , server , theoretical computer science , layered queueing network , distributed computing , computer network , mathematics , art , musical , geometry , visual arts

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 direct translation to PEPA, allowing access to the existing tools for analysing PEPA models. Finally, we use the ipc/DNAmaca tool-chain to provide passage-time analysis of a dual Web server example

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research