Drafting Behind Akamai (Travelocity-Based Detouring)
Ao-Jan Su, David R. Choffnes, Alekzandar Kuzmanovic and Fabián E. Bustamante
In Proc. of ACM SIGCOMM 2006, September 2006.
EECS Department
Northwestern University
Evanston, IL 60201, USA
This email address is being protected from spambots. You need JavaScript enabled to view it.
, This email address is being protected from spambots. You need JavaScript enabled to view it.
, This email address is being protected from spambots. You need JavaScript enabled to view it.
, This email address is being protected from spambots. You need JavaScript enabled to view it.
Abstract
To enhance web browsing experiences, content distribution networks (CDNs) move web content closer to clients by caching copies of web objects on thousands of servers worldwide. Additionally, to minimize client download times, such systems perform extensive network and server measurements, and use them to redirect clients to different servers over short time scales. In this paper, we explore techniques for inferring and exploiting network measurements performed by the largest CDN, Akamai; our objective is to locate and utilize quality Internet paths without performing extensive path probing or monitoring.
Our contributions are threefold. First, we conduct a broad measurement study of Akamai's CDN. We probe Akamai's network from 140 PlanetLab vantage points for two months. We find that Akamai redirection times, while slightly higher than advertised, are sufficiently low to be useful for network control. Second, we empirically show that Akamai redirections overwhelmingly correlate with network latencies on the paths between clients and the Akamai servers. Finally, we illustrate how large-scale overlay networks can exploit Akamai redirections to identify the best detouring nodes for one-hop source routing. Our research shows that in more than 50%of investigated scenarios, it is better to route through the nodes recommended by Akamai, than to use the direct paths. Because this is not the case for the rest of the scenarios, we develop low overhead pruning algorithms that avoid Akamai-driven paths when they are not beneficial.
