A greedy algorithm for capacity-constrained surrogate placement in CDNs

Yi Feng Chen, Yan Xiang He, Jiannong Cao

Research output: Journal article publicationJournal articleAcademic researchpeer-review

3 Citations (Scopus)


A new surrogate placement strategy, CCSP (capacity-constrained surrogate placement), is proposed to enhance the performance for content distribution networks (CDNs). CCSP aims to address surrogate placement in a manner that minimizes the communication cost while ensuring at the same time the maximization of system throughput. This work differs from the existing works on the resource allocation problem in communication networks, CCSP considers load distribution and processing capacity constraints on surrogates by modeling the underlying request-routing mechanism, thus guaranteeing a CDN to have minimum network resource consumption, maximum system throughput, and better load balancing among surrogates. An efficient greedy algorithm is developed for a simplified version of the CCSP problem in tree networks. The efficiency of the proposed algorithm is systematically analyzed through the experimental simulations.
Original languageChinese (Simplified)
Pages (from-to)146-156
Number of pages11
JournalRuan Jian Xue Bao/Journal of Software
Issue number1
Publication statusPublished - 1 Jan 2007


  • Content distribution network
  • Greedy algorithm
  • Load balancing
  • Surrogate placement

ASJC Scopus subject areas

  • Software

Cite this