By Topic

Optimization algorithms for proxy server placement in content distribution networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jun Wu ; Dept. of Comput. Sci., City Univ. of New York, New York, NY, USA ; Ravindran, K.

Popular Web sites receive an enormous share of Internet traffic. These sites have a competitive motivation to offer better service to their clients at lower cost. One of the solutions is to using content distribution network (CDN). When we design a CDN we need to find proxy server placement to provide its clients with the best available performance while consuming as little resource as possible. This is an optimization problem. Among the solutions greedy algorithm yields better result with low computational cost. The drawback is that it is easy to trap in the local optimum. We propose genetic algorithm to solve this problem. We mathematically model the optimization problem and then give details about how to apply genetic algorithm to proxy server placement problem. Simulation results for a simple topology are presented for both greedy algorithm and genetic algorithm.

Published in:

Integrated Network Management-Workshops, 2009. IM '09. IFIP/IEEE International Symposium on

Date of Conference:

1-5 June 2009