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 |