Cache me if you can : storage-aware data caching in heterogeneous wireless edge networks

Authors
Shukla, Samta
ORCID
Loading...
Thumbnail Image
Other Contributors
Abouzeid, Alhussein A.
Anshelevich, Elliot
Kar, Koushik
Zhang, Tong
Issue Date
2018-05
Keywords
Computer Systems engineering
Degree
PhD
Terms of Use
This electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.
Full Citation
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
Department
Dept. of Electrical, Computer, and Systems Engineering
Publisher
Rensselaer Polytechnic Institute, Troy, NY
Relationships
Rensselaer Theses and Dissertations Online Collection
Access
Restricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Libraries.