TY - JOUR
T1 - Proactive Retention-Aware Caching with Multi-Path Routing for Wireless Edge Networks
AU - Shukla, Samta
AU - Bhardwaj, Onkar
AU - Abouzeid, Alhussein A.
AU - Salonidis, Theodoros
AU - He, Ting
N1 - Funding Information:
This work was supported in part by the National Science Foundation under Grant 1422153. The work of A. A. Abouzeid was supported by the Tekes FiDiPro Award from the University of Oulu, Finland. Parts of this paper were presented in The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the U.S. Army Research Laboratory, the U.S. Government, the U.K. Ministry of Defence or the U.K. Government. The U.S. and U.K. Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copy-right notation hereon.
Funding Information:
Manuscript received December 11, 2017; revised April 17, 2018; accepted April 18, 2018. Date of publication June 7, 2018; date of current version September 12, 2018. This work was supported in part by the National Science Foundation under Grant 1422153. The work of A. A. Abouzeid was supported by the Tekes FiDiPro Award from the University of Oulu, Finland. Parts of this paper were presented in [1]. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the U.S. Army Research Laboratory, the U.S. Government, the U.K. Ministry of Defence or the U.K. Government. The U.S. and U.K. Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copy-right notation hereon. (Corresponding author: Samta Shukla.) S. Shukla and A. A. Abouzeid are with the Rensselaer Polytechnic Institute, Troy, NY 12180 USA (e-mail: shukls@rpi.edu).
Publisher Copyright:
© 1983-2012 IEEE.
PY - 2018/6
Y1 - 2018/6
N2 - We consider the problem of proactive retention aware caching in a heterogeneous wireless edge network consisting of mobile users accessing content from a server and associated to one or more edge caches. Our goal is to design a caching policy that minimizes the sum of content storage costs and server access costs over two design variables: the retention time of each cached content and the probability that a user routes content requests to each of its associated caches. We develop a model that captures multiple aspects such as cache storage costs and several capabilities of modern wireless technologies, such as server multicast/unicast transmissions, device multi-path routing, and cache access constraints. We formulate the problem of Proactive Retention Routing Optimization as a non-convex, non-linear mixed-integer program. We prove that it is NP-hard under both multicast/unicast modes - 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. Systematic evaluations based on real-world data demonstrate the effectiveness of our approach, compared to the existing caching schemes.
AB - We consider the problem of proactive retention aware caching in a heterogeneous wireless edge network consisting of mobile users accessing content from a server and associated to one or more edge caches. Our goal is to design a caching policy that minimizes the sum of content storage costs and server access costs over two design variables: the retention time of each cached content and the probability that a user routes content requests to each of its associated caches. We develop a model that captures multiple aspects such as cache storage costs and several capabilities of modern wireless technologies, such as server multicast/unicast transmissions, device multi-path routing, and cache access constraints. We formulate the problem of Proactive Retention Routing Optimization as a non-convex, non-linear mixed-integer program. We prove that it is NP-hard under both multicast/unicast modes - 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. Systematic evaluations based on real-world data demonstrate the effectiveness of our approach, compared to the existing caching schemes.
UR - http://www.scopus.com/inward/record.url?scp=85048159227&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85048159227&partnerID=8YFLogxK
U2 - 10.1109/JSAC.2018.2844999
DO - 10.1109/JSAC.2018.2844999
M3 - Article
AN - SCOPUS:85048159227
SN - 0733-8716
VL - 36
SP - 1286
EP - 1299
JO - IEEE Journal on Selected Areas in Communications
JF - IEEE Journal on Selected Areas in Communications
IS - 6
M1 - 8374856
ER -