eprintid: 2557
rev_number: 8
eprint_status: archive
userid: 6
dir: disk0/00/00/25/57
datestamp: 2015-02-06 11:16:22
lastmod: 2015-02-06 11:16:22
status_changed: 2015-02-06 11:16:22
type: conference_item
metadata_visibility: show
creators_name: Casale, Giuliano
creators_name: Tribastone, Mirco
creators_id: 
creators_id: mirco.tribastone@imtlucca.it
title: Process-algebraic modelling of priority queueing networks
ispublished: unpub
subjects: QA75
divisions: CSA
full_text_status: public
pres_type: paper
abstract: We consider a closed multiclass queueing network model in which each class receives a different
priority level and jobs with lower priority are served only if there are no higher-priority jobs in the
queue. Such systems do not enjoy a product form solution, thus their analysis is typically carried out
through approximate mean value analysis (AMVA) techniques. We formalise the problem in PEPA in
a way amenable to differential analysis. Experimental results show that our approach is competitive
with simulation and AMVA methods.
date: 2010-09
pagerange: 1-6
event_title: 9th Workshop on Process Algebra and Stochastically Timed Activities (PASTA)
event_location: London, UK
event_dates: September 2010
event_type: workshop
refereed: FALSE
citation:   Casale, Giuliano and Tribastone, Mirco  Process-algebraic modelling of priority queueing networks.  In: 9th Workshop on Process Algebra and Stochastically Timed Activities (PASTA), September 2010, London, UK pp. 1-6.      (Unpublished)   (2010)  
document_url: http://eprints.imtlucca.it/2557/1/pasta2010.pdf