Exact algorithms for the joint object placement and request routing problem in content distribution networks


Bektas, T., Cordeau, J-F., Erkut, E. and Laporte, G. (2008) Exact algorithms for the joint object placement and request routing problem in content distribution networks Computers and Operations Research, 35, (12), pp. 3860-3884. (doi:10.1016/j.cor.2007.02.005).

Download

Full text not available from this repository.

Description/Abstract

This paper describes two exact algorithms for the joint problem of object placement and request routing in a content distribution network (CDN). A CDN is a technology used to efficiently distribute electronic content throughout an existing Internet Protocol network. The problem consists of replicating content on the proxy servers and routing the requests for the content to a suitable proxy server in a CDN such that the total cost of distribution is minimized. An upper bound on end-to-end object transfer time is also taken into account. The problem is formulated as a nonlinear integer programming formulation which is linearized in three different ways. Two algorithms, one based on Benders decomposition and the other based on Lagrangean relaxation and decomposition, are described for the solution of the problem. Computational experiments are conducted by comparing the proposed linearizations and the two algorithms on randomly generated Internet topologies.

Item Type: Article
Digital Object Identifier (DOI): doi:10.1016/j.cor.2007.02.005
ISSNs: 0305-0548 (print)
Keywords: OR in telecommunications, content distribution network, linearization, benders decomposition, lagrangean relaxation and decomposition
Subjects:
ePrint ID: 51356
Date :
Date Event
December 2008Published
Date Deposited: 06 Jun 2008
Last Modified: 16 Apr 2017 18:05
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/51356

Actions (login required)

View Item View Item