Designing cost-effective content distribution networks
Designing cost-effective content distribution networks
In this paper, we present a novel technique for the problem of designing a Content Distribution Network (CDN), which is a technology used to efficiently distribute electronic content throughout an existing IP network. Our design proposal consists of jointly deciding on (i) the number and placement of proxy servers on a given set of potential nodes, (ii) replicating content on the proxy servers, and (iii) routing the requests for the content to a suitable proxy server such that the total cost of distribution is minimized. We model the problem using a nonlinear integer programming formulation. The novelty of the proposed formulation lies in simultaneously addressing three interdependent problems in this context as well as explicitly representing the distribution structure of a CDN through the objective function. We offer a linearization for the model, develop an exact solution procedure based on Benders’ decomposition and also utilize a variant of this procedure to accelerate the algorithm. In addition, we provide a fast and efficient heuristic that can be used to obtain near-optimal solutions to the problem. Finally, the paper concludes with computational results showing the performance of the decomposition procedure and the heuristic algorithm on randomly generated Internet topologies
content distribution network, benders’ decomposition, integer programming, exact solution
2436-2449
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Oguz, O.
7a6b6f2e-59fc-4b28-aa31-465a44468523
Ouveysi, I.
776da949-6f7d-484c-a613-58c3bbfeee58
August 2007
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Oguz, O.
7a6b6f2e-59fc-4b28-aa31-465a44468523
Ouveysi, I.
776da949-6f7d-484c-a613-58c3bbfeee58
Bektas, T., Oguz, O. and Ouveysi, I.
(2007)
Designing cost-effective content distribution networks.
Computers and Operations Research, 34 (8), .
(doi:10.1016/j.cor.2005.09.013).
Abstract
In this paper, we present a novel technique for the problem of designing a Content Distribution Network (CDN), which is a technology used to efficiently distribute electronic content throughout an existing IP network. Our design proposal consists of jointly deciding on (i) the number and placement of proxy servers on a given set of potential nodes, (ii) replicating content on the proxy servers, and (iii) routing the requests for the content to a suitable proxy server such that the total cost of distribution is minimized. We model the problem using a nonlinear integer programming formulation. The novelty of the proposed formulation lies in simultaneously addressing three interdependent problems in this context as well as explicitly representing the distribution structure of a CDN through the objective function. We offer a linearization for the model, develop an exact solution procedure based on Benders’ decomposition and also utilize a variant of this procedure to accelerate the algorithm. In addition, we provide a fast and efficient heuristic that can be used to obtain near-optimal solutions to the problem. Finally, the paper concludes with computational results showing the performance of the decomposition procedure and the heuristic algorithm on randomly generated Internet topologies
This record has no associated files available for download.
More information
Published date: August 2007
Keywords:
content distribution network, benders’ decomposition, integer programming, exact solution
Organisations:
Management
Identifiers
Local EPrints ID: 47684
URI: http://eprints.soton.ac.uk/id/eprint/47684
ISSN: 0305-0548
PURE UUID: 3edf6c72-4fe6-45c7-943a-1cbd4bc0ab61
Catalogue record
Date deposited: 08 Aug 2007
Last modified: 15 Mar 2024 09:35
Export record
Altmetrics
Contributors
Author:
T. Bektas
Author:
O. Oguz
Author:
I. Ouveysi
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics