A greedy algorithm for capacity-constrained surrogate placement in CDNs

Authors:
Yifeng Chen;Yanxiang He;Jiannong Cao;Jie Wu
Affiliations:
State Key Laboratory of Water Resources and Hydropower Engineering Science, Wuhan University, Wuhan, Hubei, China;School of Computer, Wuhan University, Wuhan, Hubei, China;Department of Computing, Hong Kong Polytechnic University, Kowloon, Hong Kong, China;Department of Computer Science & Engineering, Florida Atlantic University, Boca Raton, FL
Venue:
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Year:
2005

Citing 8
Cited 0

The cache location problem

IEEE/ACM Transactions on Networking (TON)
Exploring Content Delivery Networking

IT Professional
Optimization of Performance Gain in Content Distribution Networks with Serve Replicas

SAINT '03 Proceedings of the 2003 Symposium on Applications and the Internet
WebWave: Globally Load Balanced Fully Distributed Caching of Hot Published Documents

ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Placement of Read-Write Web Proxies in the Internet

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Constrained mirror placement on the Internet

IEEE Journal on Selected Areas in Communications
Placement problems for transparent data replication proxy services

IEEE Journal on Selected Areas in Communications
Traffic analysis of a Web proxy caching hierarchy

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

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.