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

preprint2015arXivOpen access

Abstract

We investigate, under general stationary ergodic assumptions, the stability of systems of SS parallel queues in which any incoming customer joins the queue of the server having the p+1p+1-th shortest workload (p<Sp < 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 SS 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 pp servers plus a FCFS system of S−pS-p 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.