TY - GEN
T1 - Distributed wide-area traffic management for cloud services
AU - Narayana, Srinivas
AU - Jiang, Joe Wenjie
AU - Rexford, Jennifer L.
AU - Chiang, Mung
PY - 2012
Y1 - 2012
N2 - The performance of interactive cloud services depends heavily on which data centers handle client requests, and which wide-area paths carry traffic. While making these decisions, cloud service providers also need to weigh operational considerations like electricity and bandwidth costs, and balancing server loads across replicas. We argue that selecting data centers and network routes independently, as is common in today's services, can lead to much lower performance or higher costs than a coordinated decision. However, fine-grained joint control of two large distributed systems - e.g., DNS-based replica-mapping and data center multi-homed routing - can be administratively challenging. In this paper, we introduce the design of a system that jointly optimizes replica-mapping and multi-homed routing, while retaining the functional separation that exists between them today. We show how to construct a provably optimal distributed solution implemented through local computations and message exchanges between the mapping and routing systems.
AB - The performance of interactive cloud services depends heavily on which data centers handle client requests, and which wide-area paths carry traffic. While making these decisions, cloud service providers also need to weigh operational considerations like electricity and bandwidth costs, and balancing server loads across replicas. We argue that selecting data centers and network routes independently, as is common in today's services, can lead to much lower performance or higher costs than a coordinated decision. However, fine-grained joint control of two large distributed systems - e.g., DNS-based replica-mapping and data center multi-homed routing - can be administratively challenging. In this paper, we introduce the design of a system that jointly optimizes replica-mapping and multi-homed routing, while retaining the functional separation that exists between them today. We show how to construct a provably optimal distributed solution implemented through local computations and message exchanges between the mapping and routing systems.
KW - joint optimization
KW - multi-homed routing
KW - request mapping
UR - http://www.scopus.com/inward/record.url?scp=84864653107&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84864653107&partnerID=8YFLogxK
U2 - 10.1145/2254756.2254817
DO - 10.1145/2254756.2254817
M3 - Conference contribution
AN - SCOPUS:84864653107
SN - 9781450310970
T3 - Performance Evaluation Review
SP - 409
EP - 410
BT - SIGMETRICS/Performance 2012 - Proceedings of the 2012 ACM SIGMETRICS/Performance, Joint International Conference on Measurement and Modeling of Computer Systems
T2 - 12th Joint International Conference on Measurement and Modeling of Computer Systems, ACM SIGMETRICS/Performance 2012
Y2 - 11 June 2012 through 15 June 2012
ER -