Load Balancing via Random Local Search in Closed and Open systems

Details Load Balancing via Random Local Search in Closed and Open systems Load Balancing via Random Local Search in Closed and Open systems

2010-02-23

arxiv.org/abs/1002.4314v2

Computer Science

Networking and Internet Architecture

Accepted to Sigmetrics 2010

Scientific paper

In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may switch server independently at random instants of time in an attempt to improve their service rate. This approach to load balancing contrasts with traditional approaches where clients make smart server selections upon arrival (e.g., Join-the-Shortest-Queue policy and variants thereof). Load resampling is particularly relevant in scenarios where clients cannot predict the load of a server before being actually attached to it. An important example is in wireless spectrum sharing where clients try to share a set of frequency bands in a distributed manner.

Affiliated with

Also associated with

No associations

Rating

Load Balancing via Random Local Search in Closed and Open systems 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 Load Balancing via Random Local Search in Closed and Open systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Load Balancing via Random Local Search in Closed and Open systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-170188