Show simple item record

dc.creatorLi, C. P.en
dc.creatorPaschos, G. S.en
dc.creatorTassiulas, L.en
dc.creatorModiano, E.en
dc.description.abstractWe 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. © 2014 IFIP.en
dc.subjectStochastic systemsen
dc.subjectDynamic control policyen
dc.subjectMinimization problemsen
dc.subjectOptimal load balancingen
dc.subjectPenalty minimizationen
dc.subjectProportional fairnessen
dc.subjectStochastic settingsen
dc.subjectVideo on demanden
dc.titleDynamic overload balancing in server farmsen

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record