Optimization of Performance Gain in Content Distribution Networks with Serve Replicas

  • Authors:
  • Yingjie Li;Ming T. Liu

  • Affiliations:
  • -;-

  • Venue:
  • SAINT '03 Proceedings of the 2003 Symposium on Applications and the Internet
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Server replica placement of Content DistributionNetworks (CDNs) addresses the problem of properlyplacing a set of replicas among a set of candidate sites tooptimize system performance gain. Previous studies onserver replica placement problem have focused oncomparing the performances of different replica placementstrategies. However, the growth of the optimalperformance gain with the increase of server replicas hasrarely been studied. Moreover no research has been doneto study the effects of client's content demand anddistribution patterns on the growth of performance gain.In this paper, these problems have been addressed indetail. The server replica placement problem is modeledas the well-known Minimum p-median problem and solvedby a heuristic algorithm. A trace-driven simulation isperformed and the relationship between the performancegain growth and the replica size is established. Aparametric study is performed to study the effect of contentdemand pattern a on the performance gain growth. Asimple scheme of narrowing down the candidate sites isproposed to speed up the computation.