The stability of join-the-shortest-queue models with general input and output processes
From MaRDI portal
Publication:6475463
arXivmath/0505040MaRDI QIDQ6475463FDOQ6475463
Authors: Vyacheslav Abramov 
Publication date: 2 May 2005
Abstract: The paper establishes necessary and sufficient conditions for stability of different join-the-shortest-queue models including load-balanced networks with general input and output processes. It is shown, that the necessary and sufficient condition for stability of load-balanced networks is associated with the solution of a linear programming problem precisely formulated in the paper. It is proved, that if the minimum of the objective function of that linear programming problem is less than 1, then the associated load-balanced network is stable.
Linear programming (90C05) Queueing theory (aspects of probability theory) (60K25) Stochastic network models in operations research (90B15)
This page was built for publication: The stability of join-the-shortest-queue models with general input and output processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6475463)
