An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Flash crowds and denial of service attacks: characterization and implications for CDNs and web sites
Proceedings of the 11th international conference on World Wide Web
Squirrel: a decentralized peer-to-peer web cache
Proceedings of the twenty-first annual symposium on Principles of distributed computing
A Precise and Efficient Evaluation of the Proximity Between Web Clients and Their Local DNS Servers
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Request Redirection Algorithms for Distributed Web Systems
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Dynamic Load Balancing in Geographically Distributed Heterogeneous Web Servers
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
On the responsiveness of DNS-based network control
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Dynamic connectivity management with an intelligent route service control point
Proceedings of the 2006 SIGCOMM workshop on Internet network management
A measurement-based deployment proposal for IP anycast
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Democratizing content publication with coral
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Enabling service adaptability with versatile anycast: Research Articles
Concurrency and Computation: Practice & Experience
I tube, you tube, everybody tubes: analyzing the world's largest user generated content video system
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Wresting control from BGP: scalable fine-grained route control
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
Anycast-aware transport for content delivery networks
Proceedings of the 18th international conference on World wide web
Measurement informed route selection
PAM'07 Proceedings of the 8th international conference on Passive and active network measurement
The scalability of swarming peer-to-peer content delivery
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Optimizing cost and performance for content multihoming
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Optimizing cost and performance for content multihoming
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Hi-index | 0.00 |
IP Anycast has many attractive features for any service that involve the replication of multiple instances across the Internet. IP Anycast allows multiple instances of the same service to be “naturally” discovered, and requests for this service to be delivered to the closest instance. However, while briefly considered as an enabler for content delivery networks (CDNs) when they first emerged, IP Anycast was deemed infeasible in that environment. The main reasons for this decision were the lack of load awareness of IP Anycast and unwanted side effects of Internet routing changes on the IP Anycast mechanism. In this article we re-evaluate IP Anycast for CDNs by proposing a load-aware IP Anycast CDN architecture. Our architecture is prompted by recent developments in route control technology, as well as better understanding of the behavior of IP Anycast in operational settings. Our architecture makes use of route control mechanisms to take server and network load into account to realize load-aware Anycast. We show that the resulting redirection requirements can be formulated as a Generalized Assignment Problem and present practical algorithms that address these requirements while at the same time limiting connection disruptions that plague regular IP Anycast. We evaluate our algorithms through trace based simulation using traces obtained from a production CDN network.