Models and algorithms for assignment and cache allocation problems in content distribution networks
This thesis considers two di?cult 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 revi...
Main Author: | |
---|---|
Other Authors: | |
Published: |
University of Southampton
2016
|
Subjects: | |
Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.690311 |
id |
ndltd-bl.uk-oai-ethos.bl.uk-690311 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-bl.uk-oai-ethos.bl.uk-6903112018-09-05T03:28:01ZModels and algorithms for assignment and cache allocation problems in content distribution networksHaghi, NargesPotts, Christopher2016This thesis considers two di?cult 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.519.6University of Southamptonhttps://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.690311https://eprints.soton.ac.uk/397651/Electronic Thesis or Dissertation |
collection |
NDLTD |
sources |
NDLTD |
topic |
519.6 |
spellingShingle |
519.6 Haghi, Narges Models and algorithms for assignment and cache allocation problems in content distribution networks |
description |
This thesis considers two di?cult 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. |
author2 |
Potts, Christopher |
author_facet |
Potts, Christopher Haghi, Narges |
author |
Haghi, Narges |
author_sort |
Haghi, Narges |
title |
Models and algorithms for assignment and cache allocation problems in content distribution networks |
title_short |
Models and algorithms for assignment and cache allocation problems in content distribution networks |
title_full |
Models and algorithms for assignment and cache allocation problems in content distribution networks |
title_fullStr |
Models and algorithms for assignment and cache allocation problems in content distribution networks |
title_full_unstemmed |
Models and algorithms for assignment and cache allocation problems in content distribution networks |
title_sort |
models and algorithms for assignment and cache allocation problems in content distribution networks |
publisher |
University of Southampton |
publishDate |
2016 |
url |
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.690311 |
work_keys_str_mv |
AT haghinarges modelsandalgorithmsforassignmentandcacheallocationproblemsincontentdistributionnetworks |
_version_ |
1718729750974824448 |