The Load Distance Balancing Problem. Eddie Bortnikov (Yahoo!) Samir Khuller (Maryland) Yishay Mansour (Google) Seffi Naor (Technion). The Load-Distance Balancing Problem. Given n clients and k servers s 1 , s 2 ,…s k we need to assign each client to a server.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Eddie Bortnikov (Yahoo!)
Samir Khuller (Maryland)
Yishay Mansour (Google)
Seffi Naor (Technion)
Cost(i) = Distance(i,sj) + Delay(j,Lj)
Delay(j,Lj) is a FUNCTION of the number of clients Lj assigned to sj.
OBJECTIVE: Min Max Cost(i)
In other words, we need to pick exactly N/m subsets from S, to cover each element once.