Stability of Join the Shortest Queue Networks

Details Stability of Join the Shortest Queue Networks Stability of Join the Shortest Queue Networks

2010-10-08

arxiv.org/abs/1010.1749v1

Mathematics

Probability

66 pages

Scientific paper

Join the shortest queue (JSQ) refers to networks whose incoming jobs are assigned to the shortest queue from among a randomly chosen subset of the queues in the system. After completion of service at the queue, a job leaves the network. We show that, for all non- idling service disciplines and for general interarrival and service time distributions, such networks are stable when they are subcritical. We then obtain uniform bounds on the tails of the marginal distributions of the equilibria for families of such networks; these bounds are employed to show relative compactness of the marginal distributions. We also present a family of subcritical JSQ networks whose workloads in equilibrium are much larger than for the corresponding networks where each incoming job is assigned randomly to a queue. Part of this work generalizes results in Foss and Chernova [12], which applied fluid limits to study networks with the FIFO discipline. Here, we apply an appropriate Lyapunov function.

Affiliated with

Also associated with

No associations

Rating

Stability of Join the Shortest Queue Networks 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 Stability of Join the Shortest Queue Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stability of Join the Shortest Queue Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-486952