Dynamic overload balancing in server farms
Author(s)Paschos, Georgios S.; Tassiulas, Leandros; Li, Chih Ping; Modiano, Eytan H
MetadataShow full item record
We consider the problem of optimal load balancing in a server farm under overload conditions. A convex penalty minimization problem is studied to optimize queue overflow rates at the servers. We introduce a new class of α-fair penalty functions, and show that the cases of α = 0, 1, ∞ correspond to minimum sum penalty, penalty proportional fairness, and min-max fairness, respectively. These functions are useful to maximize the time to first buffer overflow and minimize the recovery time from temporary overload. In addition, we show that any policy that solves an overload minimization problem with strictly increasing penalty functions must be throughput optimal. A dynamic control policy is developed to solve the overload minimization problem in a stochastic setting. This policy generalizes the well-known join-the-shortest-queue (JSQ) policy and uses intelligent job tagging to optimize queue overflow rates without the knowledge of traffic arrival rates.
DepartmentMassachusetts Institute of Technology. Department of Aeronautics and Astronautics
2014 IFIP Networking Conference
Institute of Electrical and Electronics Engineers (IEEE)
Li, Chih-ping, et al. "Dynamic Overload Balancing in Server Farms." 2014 IFIP Networking Conference, 2-4 June 2014, Trondheim, Norway, IEEE, 2014, pp. 1–9.
Author's final manuscript