The stability of join-the-shortest-queue models with general input and output processes

Simple item page
dc.creatorAbramov, Vyacheslav M.
dc.date2005-05-03
dc.date2007-09-12
dc.date.accessioned2026-07-07T08:28:51Z
dc.date.available2026-07-07T08:28:51Z
dc.descriptionThe 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.
dc.description22 pages, typos corr
dc.identifierhttps://arxiv.org/abs/math/0505040
dc.identifierhttp://arxiv.org/abs/math/0505040
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/137767
dc.subjectProbability
dc.subject60K25, 90B15, 90C05
dc.titleThe stability of join-the-shortest-queue models with general input and output processes
dc.typetext

Files

Collections

arXiv