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 & Operations Research, 35, (12), 3860-3884. (doi:10.1016/j.cor.2007.02.005).
Full text not available from this repository.
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.
|Digital Object Identifier (DOI):||doi:10.1016/j.cor.2007.02.005|
|Keywords:||OR in telecommunications, content distribution network, linearization, benders decomposition, lagrangean relaxation and decomposition|
|Subjects:||H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
|Divisions:||University Structure - Pre August 2011 > School of Management
|Date Deposited:||06 Jun 2008|
|Last Modified:||06 Aug 2015 02:41|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)