Inhalt des Dokuments
|Srinivas Narayana, PhD student, Princeton University |
|Friday, December 6, 2013, 10.15-11 a.m., building Marchstraße 23, room MAR 4.051|
The performance and costs of geo-replicated online services depend on which data centers handle user requests, and which wide-area paths carry traffic. To provide good performance at reasonable cost, service providers adapt the mapping of user requests to data centers (e.g., through DNS), and routing of responses back to users (i.e., through multi-homed route control).
Mapping and routing are typically managed independently, with mapping having limited visibility into routing decisions, response path latencies, and bandwidth costs. However, poor visibility and uncoordinated decision-making can lead to worse performance and higher costs when compared to a joint decision. We argue that mapping and routing should continue to operate modularly, but cooperate towards service-wide performance and cost goals. In this talk, we present a distributed algorithm to steer cooperating, yet functionally separate, mapping and routing provably towards a globally optimal operating point. Trace-based evaluations on an operational CDN show that the algorithm converges to within 1% of optimum in 3-6 iterations. Time permitting, I'll also present additional results from trace evaluations on when joint optimization is helpful.
This is joint work with Joe Wenjie Jiang, Jennifer Rexford and Mung Chiang from Princeton University.
ContactDr. Stefan Schmid, Deutsche Telekom Innovation Laboratories and Fachgebiet INET