Distributed Load Management in Anycast-based CDNs
Abhishek Sinha, Pradeepkumar Mani, Jie Liu, Ashley Flavel, David A., Maltz

TL;DR
This paper develops a distributed load management framework for Anycast-based CDNs, proposing a convex optimization approach with FastControl packets and analyzing a practical greedy heuristic for stability and performance.
Contribution
It introduces a novel convex optimization-based distributed algorithm for load management in Anycast CDNs and analyzes a real-world heuristic for operational insights.
Findings
The convex optimization algorithm effectively balances loads without external control channels.
The greedy heuristic's stability and operational properties are analytically characterized.
Trace-driven simulations compare the performance and complexity of both algorithms.
Abstract
Anycast is an internet addressing protocol where multiple hosts share the same IP-address. A popular architecture for modern Content Distribution Networks (CDNs) for geo-replicated HTTP-services consists of multiple layers of proxy nodes for service and co-located DNS-servers for load-balancing on different proxies. Both the proxies and the DNS-servers use anycast addressing, which offers simplicity of design and high availability of service at the cost of partial loss of routing control. Due to the very nature of anycast, load-management decisions by a co-located DNS-server also affects loads at nearby proxies in the network. This makes the problem of distributed load management highly challenging. In this paper, we propose an analytical framework to formulate and solve the load-management problem in this context. We consider two distinct algorithms. In the first half of the paper, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
