Hierarchy-aware algorithms for CDN proxy placement in the Internet

  • Authors:
  • Harpal Singh Bassali;Krishnanand M Kamath;Rajendraprasad B Hosamani;Lixin Gao

  • Affiliations:
  • University of Massachusetts, Amherst, MA 01003, USA;University of Massachusetts, Amherst, MA 01003, USA;University of Massachusetts, Amherst, MA 01003, USA;University of Massachusetts, Amherst, MA 01003, USA

  • Venue:
  • Computer Communications
  • Year:
  • 2003

Quantified Score

Hi-index 0.24

Visualization

Abstract

The wide adoption and explosive growth of the Internet has led to increasing demand for near instantaneous response from users. Caching is an important avenue to save network bandwidth, reduce server load and the response time experienced by web clients. Content Distribution Networks (CDNs) have emerged as a powerful solution to improve the client response time and to reduce the traffic in the Internet. CDNs consist of a set of distributed proxy servers replicating the content for better performance and availability than centralized servers. The key factor in determining the effectiveness of a CDN is the placement of proxy servers. Network topology and routing policies play an important role on the effectiveness of proxy server placement. However, existing studies on proxy server placement either consider simplified topology (i.e. tree topology) or focus on a particular snapshot of Internet topology. In addition, none of the studies have taken into consideration of the routing policies imposed by Internet Service Providers (ISPs), which is crucial in determining the performance of web access. In this paper, we present heuristic algorithm for CDN proxy server placement by taking into account the hierarchical Internet structure and the routing policy constraint resulting from it. Our experimental results on the Internet topology over three years show that the heuristic algorithms adapt to the Internet growth well.