Stability of load balancing algorithms in dynamic adversarial systems

In the dynamic load balancing problem, we seek to keep the job load roughly evenly distributed among the processors of a given network. The arrival and departure of jobs is modeled by an adversary restricted in its power. Muthukrishnan and Rajaraman (1998) gave a clean characterization of a restriction on the adversary that can be considered the natural analogue of a cut condition. They proved that a simple local balancing algorithm proposed by Aiello et. al. (1993) is stable against such an adversary if the insertion rate is restricted to a (1 - ) fraction of the cut

• Type: Conference
• Year: 2002
• Where: STOC
• Authors: Elliot Anshelevich, David Kempe, Jon M. Kleinberg
• Keywords: Algorithms, Clean Characterization, Load Balancing Problem, Simple Local Balancing, STOC 2002