A large deviation principle for join the shortest queue

Details A large deviation principle for join the shortest queue A large deviation principle for join the shortest queue

2005-12-31

arxiv.org/abs/math/0601010v1

Mathematics

Probability

14 pages

Scientific paper

We 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.

Affiliated with

Also associated with

No associations

Rating

A large deviation principle for join the shortest queue does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A large deviation principle for join the shortest queue, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A large deviation principle for join the shortest queue will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-284306