论文信息 - The load‐distance balancing problem

The load‐distance balancing problem

Problems dealing with assignment of clients to servers have been widely studied. However, they usually do not model the fact that the delay incurred by a client is a function of both the distance to the assigned server and the load on this server, under a given assignment. We study a problem referred to as the load‐distance balancing (LDB) problem, where the objective is assigning a set of clients to a set of given servers. Each client suffers a delay, that is, the sum of the network delay (which is proportional to the distance to its server) and the congestion delay at this server, a nondecreasing function of the number of clients assigned to the server.

[1] Bhaba R. Sarker,et al. Discrete location theory , 1991 .

[2] Said Salhi,et al. Discrete Location Theory , 1991 .

[3] James B. Orlin. A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..

[4] Judit Bar-Ilan,et al. How to Allocate Network Centers , 1993, J. Algorithms.

[5] U. Feige. A threshold of ln n for approximating set cover , 1998, JACM.

[6] Samir Khuller,et al. The Capacitated K-Center Problem , 2000, SIAM J. Discret. Math..

[7] Mohammad Mahdian,et al. Universal Facility Location , 2003, ESA.

[8] V. Mirrokni,et al. The facility location problem with general cost functions , 2003, Networks.

[9] Tim Roughgarden,et al. The Price of Stability for Network Design with Fair Cost Allocation , 2004, FOCS.

[10] Jin Chen,et al. Locality aware dynamic load management for massively multiplayer games , 2005, PPoPP.

[11] Ian F. Akyildiz,et al. Wireless mesh networks: a survey , 2005, Comput. Networks.

[12] Jens Vygen. From stars to comets: Improved local search for universal facility location , 2007, Oper. Res. Lett..

[13] Idit Keidar,et al. Scalable Load-Distance Balancing , 2007, DISC.

[14] Samir Khuller,et al. Energy efficient scheduling via partial shutdown , 2009, SODA '10.