The University of Southampton
University of Southampton Institutional Repository

Models and algorithms for assignment and cache allocation problems in content distribution networks

Models and algorithms for assignment and cache allocation problems in content distribution networks
Models and algorithms for assignment and cache allocation problems in content distribution networks
This thesis considers two difficult combinatorial optimization problems for request routing and client assignment in content distribution networks. The aim is to introduce lower and upper bounds to estimate optimal solutions. Existing solution methods and techniques for similar problems have been reviewed. The first problem consists of minimizing the total network cost for request routing with no origin server by considering the delay function. The second problem is cache allocation problem. Lagrangian relaxation and two perspective cuts are used to linearize first problem and to find valid lower bounds. Two different linearization methods are implemented for cache allocation problem. Iterated Variable Neighborhood Descent and Tabu Search are two solution methods which are suggested to find best upper bounds. Different local search operators are introduced to improve objective function values as follows: swap, remove-insert, insert from origin server to a proxy, insert from one proxy to another proxy, swap between origin server and a proxy, swap between two proxies and cyclic exchange. All computational results are presented on randomly generated instances
Haghi, Narges
e1d9d2d8-89ff-4f2e-90c6-b2626757daa7
Haghi, Narges
e1d9d2d8-89ff-4f2e-90c6-b2626757daa7
Potts, Christopher
58c36fe5-3bcb-4320-a018-509844d4ccff

(2016) Models and algorithms for assignment and cache allocation problems in content distribution networks. University of Southampton, School of Mathematics, Doctoral Thesis, 256pp.

Record type: Thesis (Doctoral)

Abstract

This thesis considers two difficult combinatorial optimization problems for request routing and client assignment in content distribution networks. The aim is to introduce lower and upper bounds to estimate optimal solutions. Existing solution methods and techniques for similar problems have been reviewed. The first problem consists of minimizing the total network cost for request routing with no origin server by considering the delay function. The second problem is cache allocation problem. Lagrangian relaxation and two perspective cuts are used to linearize first problem and to find valid lower bounds. Two different linearization methods are implemented for cache allocation problem. Iterated Variable Neighborhood Descent and Tabu Search are two solution methods which are suggested to find best upper bounds. Different local search operators are introduced to improve objective function values as follows: swap, remove-insert, insert from origin server to a proxy, insert from one proxy to another proxy, swap between origin server and a proxy, swap between two proxies and cyclic exchange. All computational results are presented on randomly generated instances

PDF
Narges Haghi.pdf - Other
Download (2MB)

More information

Published date: June 2016
Organisations: University of Southampton, Mathematical Sciences

Identifiers

Local EPrints ID: 397651
URI: http://eprints.soton.ac.uk/id/eprint/397651
PURE UUID: 9e4869e7-690d-443f-9b20-01ce6c7aa93b

Catalogue record

Date deposited: 06 Jul 2016 11:00
Last modified: 17 Jul 2017 18:37

Export record

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×