TY - GEN
T1 - Joint request mapping and response routing for geo-distributed cloud services
AU - Xu, Hong
AU - Li, Baochun
PY - 2013
Y1 - 2013
N2 - Many cloud services are running on geographically distributed datacenters for better reliability and performance. We consider the emerging problem of joint request mapping and response routing with distributed datacenters in this paper. We formulate the problem as a general workload management optimization. A utility function is used to capture various performance goals, and the location diversity of electricity and bandwidth costs are realistically modeled. To solve the large-scale optimization, we develop a distributed algorithm based on the alternating direction method of multipliers (ADMM). Following a decomposition-coordination approach, our algorithm allows for a parallel implementation in a datacenter where each server solves a small sub-problem. The solutions are coordinated to find an optimal solution to the global problem. Our algorithm converges to near optimum within tens of iterations, and is insensitive to step sizes. We empirically evaluate our algorithm based on real-world workload traces and latency measurements, and demonstrate its effectiveness compared to conventional methods. © 2013 IEEE.
AB - Many cloud services are running on geographically distributed datacenters for better reliability and performance. We consider the emerging problem of joint request mapping and response routing with distributed datacenters in this paper. We formulate the problem as a general workload management optimization. A utility function is used to capture various performance goals, and the location diversity of electricity and bandwidth costs are realistically modeled. To solve the large-scale optimization, we develop a distributed algorithm based on the alternating direction method of multipliers (ADMM). Following a decomposition-coordination approach, our algorithm allows for a parallel implementation in a datacenter where each server solves a small sub-problem. The solutions are coordinated to find an optimal solution to the global problem. Our algorithm converges to near optimum within tens of iterations, and is insensitive to step sizes. We empirically evaluate our algorithm based on real-world workload traces and latency measurements, and demonstrate its effectiveness compared to conventional methods. © 2013 IEEE.
UR - https://www.scopus.com/pages/publications/84883083121
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84883083121&origin=recordpage
U2 - 10.1109/INFCOM.2013.6566873
DO - 10.1109/INFCOM.2013.6566873
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9781467359467
SP - 854
EP - 862
BT - Proceedings - IEEE INFOCOM
T2 - 32nd IEEE Conference on Computer Communications (IEEE INFOCOM 2013)
Y2 - 14 April 2013 through 19 April 2013
ER -