Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/8350
Title: A greedy algorithm for capacity-constrained surrogate placement in CDNs
Authors: Chen, YF
He, YX
Cao, JN 
Keywords: Content distribution network
Greedy algorithm
Load balancing
Surrogate placement
Issue Date: 2007
Publisher: 科學出版社
Source: 軟件學報 (Journal of software), 2007, v. 18, no. 1, p. 146-156 How to cite?
Journal: 軟件學報 (Journal of software) 
Abstract: 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.
URI: http://hdl.handle.net/10397/8350
ISSN: 1000-9825
DOI: 10.1360/jos180146
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

3
Last Week
0
Last month
0
Citations as of Aug 18, 2017

Page view(s)

34
Last Week
3
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



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