TY  - CHAP
SP  - 183
AV  - none
N2  - This paper presents a process-algebraic interpretation of the Layered Queueing Network model. The semantics of layered multi-class servers, resource contention, multiplicity of threads and processors are mapped into a model described in the stochastic process algebra PEPA. The accuracy of the translation is validated through a case study of a distributed computer system and the numerical results are used to discuss the relative strengths and weaknesses of the different forms of analysis available in both approaches, i.e., simulation, mean-value analysis, and differential approximation.
Y1  - 2010///
UR  - http://dx.doi.org/10.1145/1712605.1712634
TI  - Relating layered queueing networks and process algebra models
T2  - Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering - WOSP/SIPEW '10
PB  - ACM
ID  - eprints2573
EP  - 194
SN  - 978-1-60558-563-5
A1  - Tribastone, Mirco
ER  -