Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/9291
Title: A greedy algorithm for capacity-constrained surrogate placement in CDNs
Authors: Chen, Y
He, Y
Cao, J 
Wu, J
Issue Date: 2005
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2005, v. 3779 LNCS, p. 180-188 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
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.
Description: IFIP International Conference on Network and Parallel Computing, NPC 2005, Beijing, 30 November-3 December 2005
URI: http://hdl.handle.net/10397/9291
ISBN: 354029810X
9783540298106
ISSN: 0302-9743
EISSN: 1611-3349
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

1
Last Week
0
Last month
Citations as of Dec 4, 2017

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Dec 3, 2017

Page view(s)

42
Last Week
2
Last month
Checked on Dec 10, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.