Zero-Automatic Queues

Mairesse, Jean

doi:10.1007/11549970_6

Cited by 4 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These cooperations could be just between neighbours or amongst all the customers awaiting service. Zero-automatic queues [7], for example, allow neighbouring customers of a shared group of classes to interact and coalesce into a single customer.…”

Section: Sources and Sinksmentioning

confidence: 99%

PEPA Queues: Capturing Customer Behaviour in Queueing Networks

Argent-Katwala

Bradley

2007

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

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.

show abstract

Section: Sources and Sinksmentioning

confidence: 99%

PEPA Queues: Capturing Customer Behaviour in Queueing Networks

Argent-Katwala

Bradley

2007

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…A preliminary version without proofs of the present paper has appeared in the conference proceedings [8].…”

Section: Introductionmentioning

confidence: 99%