Approximating closed queueing networks in semi-Markov random environments
File(s)
Accepted version
Author(s)
ZHOU, Yaqi
Sheldon, Matthew
Casale, Giuliano
Type
Conference Paper
Abstract
Modeling queueing networks in random environments is a challenging problem that finds application in routing, reliability analysis, and evaluation of systems processing bursty workloads. In this paper, we introduce a method to evaluate closed queueing networks in random environments that can deal with non-Markovian transitions among environment stages and accurately approximate time-averaged performance metrics. Our technique supports both state-independent and state-dependent
random environments, the latter allowing us to analyze chal-
lenging queueing network models with bursty service processes. Using simulation on representative case studies, we show that our technique provides low approximation errors. We further demonstrate the applicability of our result to a mobility case study demonstrating the applicability of the proposed approach.
random environments, the latter allowing us to analyze chal-
lenging queueing network models with bursty service processes. Using simulation on representative case studies, we show that our technique provides low approximation errors. We further demonstrate the applicability of our result to a mobility case study demonstrating the applicability of the proposed approach.
Date Acceptance
2024-08-29
Publisher
IEEE
Copyright Statement
Copyright This paper is embargoed until publication. Once published the author’s accepted manuscript will be made available under a CC-BY License in accordance with Imperial’s Research Publications Open Access policy (www.imperial.ac.uk/oa-policy).
License URL
Source
MASCOTS 2024
Publication Status
Accepted
Start Date
2024-10-21
Finish Date
2024-10-23
Coverage Spatial
Krakow, Poland
Rights Embargo Date
10000-01-01