PEPA Queues: Capturing Customer Behaviour in Queueing Networks

被引：1
|
作者：
Argent-Katwala, Ashok [1 ]
Bradley, Jeremy T. [1 ]
机构：
[1] Imperial Coll London, Dept Comp, London, England
来源：
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2007年 / 190卷 / 03期
基金：
英国工程与自然科学研究理事会;
关键词：
Stochastic process algebra; PEPA; Queueing networks;
D O I：
10.1016/j.entcs.2007.07.002
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：3 / 25
页数：23
相关论文
共 50 条
12345