A Numerical Approach to Stability of Multiclass Queueing Networks

From MaRDI portal
Publication:4566892

DOI10.1109/TAC.2017.2699126zbMATH Open1390.93638arXiv1606.07294OpenAlexW3101302923MaRDI QIDQ4566892FDOQ4566892

Haralambie Leahu, Ana-Maria Oprescu, M. R. H. Mandjes

Publication date: 27 June 2018

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Abstract: The Multi-class Queueing Network (McQN) arises as a natural multi-class extension of the traditional (single-class) Jackson network. In a single-class network subcriticality (i.e. subunitary nominal workload at every station) entails stability, but this is no longer sufficient when jobs/customers of different classes (i.e. with different service requirements and/or routing scheme) visit the same server; therefore, analytical conditions for stability of McQNs are lacking, in general. In this note we design a numerical (simulation-based) method for determining the stability region of a McQN, in terms of arrival rate(s). Our method exploits certain (stochastic) monotonicity properties enjoyed by the associated Markovian queue-configuration process. Stochastic monotonicity is a quite common feature of queueing models and can be easily established in the single-class framework (Jackson networks); recently, also for a wide class of McQNs, including first-come-first-serve (FCFS) networks, monotonicity properties have been established. Here, we provide a minimal set of conditions under which the method performs correctly. Eventually, we illustrate the use of our numerical method by presenting a set of numerical experiments, covering both single and multi-class networks.


Full work available at URL: https://arxiv.org/abs/1606.07294







Cited In (10)





This page was built for publication: A Numerical Approach to Stability of Multiclass Queueing Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566892)