Paper Info
Title
Joint Server Selection and Routing for Geo-replicated Services
Abstract
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. In this paper, we argue that mapping and routing should continue to operate modularly, but cooperate towards service-wide performance and cost goals. Our main contribution is 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.
Year
DOI
Venue
2013
10.1109/UCC.2013.84
UCC
Keywords
Field
DocType
joint server selection,limited visibility,data center,algorithm converges,good performance,cost goal,user request,geo-replicated services,bandwidth cost,higher cost,worse performance,service-wide performance,distributed algorithms,bandwidth allocation,internet
Link-state routing protocol,Equal-cost multi-path routing,Multipath routing,Dynamic Source Routing,Static routing,Computer science,Policy-based routing,Destination-Sequenced Distance Vector routing,Routing domain,Computer network,Distributed computing
Conference
Citations 
PageRank 
References 
2
0.39
18
Authors
4
Name
Order
Citations
PageRank
Srinivas Narayana124931.63
Wenjie Jiang225626.60
Jennifer Rexford3143781195.34
Mung Chiang47303486.32