TY - GEN
T1 - DONAR
T2 - 7th International Conference on Autonomic Computing, SIGCOMM 2010
AU - Wendell, Patrick
AU - Jiang, Joe Wenjie
AU - Freedman, Michael Joseph
AU - Rexford, Jennifer L.
PY - 2010
Y1 - 2010
N2 - Geo-replicated services need an effective way to direct client requests to a particular location, based on performance, load, and cost. This paper presents DONAR, a distributed system that can offload the burden of replica selection, while providing these services with a sufficiently expressive interface for specifying mapping policies. Most existing approaches for replica selection rely on either central coordination (which has reliability, security, and scalability limitations) or distributed heuristics (which lead to suboptimal request distributions, or even instability). In contrast, the distributed mapping nodes in DONAR run a simple, efficient algorithm to coordinate their replica-selection decisions for clients. The protocol solves an optimization problem that jointly considers both client performance and server load, allowing us to show that the distributed algorithm is stable and effective. Experiments with our DONAR prototype - providing replica selection for CoralCDN and the Measurement Lab - demonstrate that our algorithm performs well "in the wild." Our prototype supports DNS- and HTTP-based redirection, IP anycast, and a secure update protocol, and can handle many customer services with diverse policy objectives.
AB - Geo-replicated services need an effective way to direct client requests to a particular location, based on performance, load, and cost. This paper presents DONAR, a distributed system that can offload the burden of replica selection, while providing these services with a sufficiently expressive interface for specifying mapping policies. Most existing approaches for replica selection rely on either central coordination (which has reliability, security, and scalability limitations) or distributed heuristics (which lead to suboptimal request distributions, or even instability). In contrast, the distributed mapping nodes in DONAR run a simple, efficient algorithm to coordinate their replica-selection decisions for clients. The protocol solves an optimization problem that jointly considers both client performance and server load, allowing us to show that the distributed algorithm is stable and effective. Experiments with our DONAR prototype - providing replica selection for CoralCDN and the Measurement Lab - demonstrate that our algorithm performs well "in the wild." Our prototype supports DNS- and HTTP-based redirection, IP anycast, and a secure update protocol, and can handle many customer services with diverse policy objectives.
KW - DNS
KW - distributed optimization
KW - geo-locality
KW - load balancing
KW - replica selection
UR - http://www.scopus.com/inward/record.url?scp=78149301795&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78149301795&partnerID=8YFLogxK
U2 - 10.1145/1851182.1851211
DO - 10.1145/1851182.1851211
M3 - Conference contribution
AN - SCOPUS:78149301795
SN - 9781450302012
T3 - SIGCOMM'10 - Proceedings of the SIGCOMM 2010 Conference
SP - 231
EP - 242
BT - SIGCOMM'10 - Proceedings of the SIGCOMM 2010 Conference
Y2 - 30 August 2010 through 3 September 2010
ER -