Novel solutions for closed queueing networks with load-dependent stations
File(s)CasHarWai.pdf (306.26 KB)
Accepted version
Author(s)
Casale, Giuliano
Harrison, Peter
Wai Hong, Ong
Type
Conference Paper
Abstract
Load-dependent closed queueing networks are difficult toapproximate since their analysis requires to consider state-dependent service demands. Commonly employed evaluationtechniques, such as mean-value analysis, are not equallyefficient in the load-dependent setting, where mean queue-lengths are insufficient alone to recursively determine themodel equilibrium performance.In this paper, we contribute to addressing this problem byobtaining novel solutions for the normalizing constant of stateprobabilities in the load-dependent setting. For single-classload-dependent models, we provide the first explicit exactformula for the normalizing constant that applies to modelswith arbitrary load-dependent rates, while retainingO(1)complexity with respect to the total population size. Fromthis result, we derive two novel integral forms for the normal-izing constant in multiclass load-dependent models, whichinvolve integration in the real and complex domains. Thepaper also illustrates through experiments the computationalgains and accuracy of the obtained expressions.
Date Issued
2019-12-01
Date Acceptance
2019-06-01
Citation
2019, 47
Publisher
ACM
Volume
47
Copyright Statement
Copyright is held by author/owner(s).
Sponsor
Commission of the European Communities
Identifier
https://dl.acm.org/doi/10.1145/3374888.3374900
Grant Number
825040
Source
Workshop on MAthematical performance Modeling and Analysis (MAMA)
Subjects
Networking & Telecommunications
Publication Status
Published
Start Date
2019-06-28
Finish Date
2019-06-28
Coverage Spatial
Phoenix, Arizona, USA
Date Publish Online
2019-12-01