Skip to main content

Joint Server Selection and Routing for Geo-replicated Services

Author(s): Narayana, Srinivas; Jiang, Wenjie; Rexford, Jennifer; Chiang, Mung

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1nv82
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNarayana, Srinivas-
dc.contributor.authorJiang, Wenjie-
dc.contributor.authorRexford, Jennifer-
dc.contributor.authorChiang, Mung-
dc.date.accessioned2021-10-08T19:49:19Z-
dc.date.available2021-10-08T19:49:19Z-
dc.date.issued2013en_US
dc.identifier.citationNarayana, Srinivas, Wenjie Jiang, Jennifer Rexford, and Mung Chiang. "Joint Server Selection and Routing for Geo-replicated Services." In IEEE/ACM 6th International Conference on Utility and Cloud Computing (2013): pp. 423-428. doi:10.1109/UCC.2013.84en_US
dc.identifier.urihttps://www.cs.princeton.edu/~jrex/papers/jointopt-dcc13.pdf-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1nv82-
dc.description.abstractThe 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.en_US
dc.format.extent423 - 428en_US
dc.language.isoen_USen_US
dc.relation.ispartofIEEE/ACM 6th International Conference on Utility and Cloud Computingen_US
dc.rightsAuthor's manuscripten_US
dc.titleJoint Server Selection and Routing for Geo-replicated Servicesen_US
dc.typeConference Articleen_US
dc.identifier.doi10.1109/UCC.2013.84-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceedingen_US

Files in This Item:
File Description SizeFormat 
JointServerSelect.pdf964.47 kBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.