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

Simple item page
dc.citation.epage3884en_US
dc.citation.issueNumber12en_US
dc.citation.spage3860en_US
dc.citation.volumeNumber35en_US
dc.contributor.authorBektaş, T.en_US
dc.contributor.authorCordeau J.-F.en_US
dc.contributor.authorErkut, E.en_US
dc.contributor.authorLaporte G.en_US
dc.date.accessioned2016-02-08T10:06:22Z
dc.date.available2016-02-08T10:06:22Z
dc.date.issued2008en_US
dc.departmentDepartment of Managementen_US
dc.description.abstractThis 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. © 2007 Elsevier Ltd. All rights reserved.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:06:22Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2008en
dc.identifier.doi10.1016/j.cor.2007.02.005en_US
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/11693/22909
dc.language.isoEnglishen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.cor.2007.02.005en_US
dc.source.titleComputers and Operations Researchen_US
dc.subjectBenders decompositionen_US
dc.subjectContent distribution networken_US
dc.subjectLagrangean relaxation and decompositionen_US
dc.subjectLinearizationen_US
dc.subjectOR in telecommunicationsen_US
dc.subjectInteger programmingen_US
dc.subjectInternet protocolsen_US
dc.subjectLinearizationen_US
dc.subjectNetwork routingen_US
dc.subjectProblem solvingen_US
dc.subjectBenders decompositionen_US
dc.subjectContent distribution networken_US
dc.subjectLagrangean relaxation and decompositionen_US
dc.subjectAlgorithmsen_US
dc.titleExact algorithms for the joint object placement and request routing problem in content distribution networksen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Exact algorithms for the joint object placement and request routing problem in content distribution networks.pdf
Size:
277.55 KB
Format:
Adobe Portable Document Format
Description:
Full Printable Version
Download

Collections

Department of Management