A greedy algorithm for capacity-constrained surrogate placement in CDNs

Yifeng Chen, Yanxiang He, Jiannong Cao, Jie Wu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

1 Citation (Scopus)

Abstract

One major factor that heavily affects the performance of a content distribution network (CDN) is placement of the surrogates. Previous works take a network-centric approach and consider only the network traffic. In this paper, we propose solutions to optimal surrogate placement, taking into consideration both network latency and capacity constraints on the surrogates. For CDNs with a tree topology, an efficient and effective greedy algorithm is proposed which minimizes network traffic while at the same time maximizing system throughput. Simulation results show that the greedy algorithm is far better than the existing optimal placement scheme that makes decisions based solely on network traffic. This suggests that capacity constraints on surrogates or server bottlenecks should be considered when determining surrogate placement, especially when the capacities of CDN servers are limited.
Original languageEnglish
Title of host publicationNetwork and Parallel Computing - IFIP International Conference, NPC 2005, Proceedings
Pages180-188
Number of pages9
Publication statusPublished - 1 Dec 2005
EventIFIP International Conference on Network and Parallel Computing, NPC 2005 - Beijing, China
Duration: 30 Nov 20053 Dec 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3779 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceIFIP International Conference on Network and Parallel Computing, NPC 2005
CountryChina
CityBeijing
Period30/11/053/12/05

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this