On the stability of a class of non-monotonic systems of parallel queues

From MaRDI portal
Publication:513181

DOI10.1007/S10626-016-0230-9zbMATH Open1356.93090arXiv1512.04596OpenAlexW2283487170MaRDI QIDQ513181FDOQ513181


Authors: Pascal Moyal Edit this on Wikidata


Publication date: 3 March 2017

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Abstract: We investigate, under general stationary ergodic assumptions, the stability of systems of S parallel queues in which any incoming customer joins the queue of the server having the p+1-th shortest workload (p<S), or a free server if any. This change in the allocation policy makes the analysis much more challenging with respect to the classical FCFS model with S servers, as it leads to the non-monotonicity of the underlying stochastic recursion. We provide sufficient conditions of existence of a stationary workload, which indicate a "splitting" of the system in heavy traffic, into a loss system of p servers plus a FCFS system of Sp servers. To prove this result, we show {em en route} an original sufficient condition for existence and uniqueness of a stationary workload for a multiple-server loss system.


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




Recommendations




Cites Work


Cited In (12)





This page was built for publication: On the stability of a class of non-monotonic systems of parallel queues

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