DONAR: Decentralized server selection for cloud services

103Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2010 ACM.

Cite

CITATION STYLE

APA

Wendell, P., Jiang, J. W., Freedman, M. J., & Rexford, J. (2010). DONAR: Decentralized server selection for cloud services. In SIGCOMM’10 - Proceedings of the SIGCOMM 2010 Conference (pp. 231–242). Association for Computing Machinery. https://doi.org/10.1145/1851182.1851211

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free