eprintid: 2573
rev_number: 6
eprint_status: archive
userid: 6
dir: disk0/00/00/25/73
datestamp: 2015-02-09 09:22:38
lastmod: 2015-02-09 09:22:38
status_changed: 2015-02-09 09:22:38
type: book_section
metadata_visibility: show
creators_name: Tribastone, Mirco
creators_id: mirco.tribastone@imtlucca.it
title: Relating layered queueing networks and process algebra models
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: 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.
date: 2010
publisher: ACM
pagerange: 183-194
id_number: doi:10.1145/1712605.1712634
refereed: TRUE
isbn: 978-1-60558-563-5
book_title: Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering - WOSP/SIPEW '10
official_url: http://dx.doi.org/10.1145/1712605.1712634
citation:   Tribastone, Mirco  Relating layered queueing networks and process algebra models.   In:  Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering - WOSP/SIPEW '10.   ACM, pp. 183-194.  ISBN 978-1-60558-563-5      (2010)