Routing-Aware Partitioning of the Internet Address Space for Server Ranking in CDNs
Gonca Gursun

TL;DR
This paper presents a scalable framework for clustering clients in CDNs based on routing similarity, enabling efficient server ranking by reducing the need for extensive path monitoring.
Contribution
It introduces routing-based clustering metrics and methods to identify representative clients, improving CDN server selection efficiency at large scale.
Findings
Strong correlation between routing similarity and server choice
Effective clustering reduces path monitoring requirements
Method improves CDN performance and scalability
Abstract
The goal of Content Delivery Networks (CDNs) is to serve content to end-users with high performance. In order to do that, a CDN measures the latency on the paths from its servers to users and then selects a best available server for each user. For large CDNs, monitoring paths from thousands of servers to millions of users is a challenging task due to its size. In this paper, we address this problem and propose a framework to scale the task of path monitoring. Simply stated, the goal of our framework is clustering IP addresses (clients) such that in each cluster the choice of best available server is same (or similar). Then, finding a best available server for one client in a given cluster will be sufficient to assign that server to the rest of the clients in the cluster. To achieve this goal, first we introduce two distance metrics to compute how similar the server choices of any…
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.
