A large deviation principle for join the shortest queue

Simple item page
dc.creatorPuhalskii, Anatolii A.
dc.creatorVladimirov, Alexander A.
dc.date2005-12-31
dc.date.accessioned2026-07-07T06:58:26Z
dc.date.available2026-07-07T06:58:26Z
dc.descriptionWe consider a join-the-shortest-queue model which is as follows. There are $K$ single FIFO servers and $M$ arrival processes. The customers from a given arrival process can be served only by servers from a certain subset of all servers. The actual destination is the server with the smallest weighted queue length. The arrival processes are assumed to obey a large deviation principle while the service is exponential. A large deviation principle is established for the queue-length process. The action functional is expressed in terms of solutions to mathematical programming problems. The large deviation limit point is identified as a weak solution to a system of idempotent equations. Uniqueness of the weak solution is proved by establishing trajectorial uniqueness.
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/math/0601010
dc.identifierhttp://arxiv.org/abs/math/0601010
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/107354
dc.subjectProbability
dc.subject60F10, 60K25
dc.titleA large deviation principle for join the shortest queue
dc.typetext

Files

Collections

arXiv