Cache me if you can : storage-aware data caching in heterogeneous wireless edge networks
Loading...
Authors
Shukla, Samta
Issue Date
2018-05
Type
Electronic thesis
Thesis
Thesis
Language
ENG
Keywords
Computer Systems engineering
Alternative Title
Abstract
We formulate the problem of as a non-convex, non-linear mixed-integer program. We prove that it is NP-Hard under both multicast/unicast modes of server transmission -- even when the caches have a large capacity and storage costs are linear -- and develop greedy algorithms that have provable performance bounds for the case of uncapacitated caches. Finally, we propose heuristics with low computational complexity for the capacitated cache case as well as for the case of convex storage costs. We refer to the caching policy described in Chapter 5 as Proactive Retention Routing Optimization (PRRO).
Description
May 2018
School of Engineering
School of Engineering
Full Citation
Publisher
Rensselaer Polytechnic Institute, Troy, NY