Exact algorithms for the joint object placement and request routing problem in content distribution networks |
| |
Authors: | Tolga Bekta , Jean-Fran ois Cordeau, Erhan Erkut,Gilbert Laporte |
| |
Affiliation: | aCenter for Research on Transportation, HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7;bSchool of Business, University of Alberta, Edmonton, Alberta, Canada T6G 2R6;cFaculty of Business Administration, Bilkent University, 06800 Bilkent, Ankara, Turkey |
| |
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. |
| |
Keywords: | OR in telecommunications Content distribution network Linearization Benders decomposition Lagrangean relaxation and decomposition |
本文献已被 ScienceDirect 等数据库收录! |
|