Proactive Retention-Aware Caching with Multi-Path Routing for Wireless Edge Networks

Samta Shukla, Onkar Bhardwaj, Alhussein A. Abouzeid, Theodoros Salonidis, Ting He

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Article number8374856
Pages (from-to)1286-1299
Number of pages14
JournalIEEE Journal on Selected Areas in Communications
Volume36
Issue number6
DOIs
StatePublished - Jun 1 2018

Fingerprint

Servers
Costs
Computational complexity

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Shukla, Samta ; Bhardwaj, Onkar ; Abouzeid, Alhussein A. ; Salonidis, Theodoros ; He, Ting. / Proactive Retention-Aware Caching with Multi-Path Routing for Wireless Edge Networks. In: IEEE Journal on Selected Areas in Communications. 2018 ; Vol. 36, No. 6. pp. 1286-1299.
@article{03a2829b71a541a3bdceadf0ddf7554f,
title = "Proactive Retention-Aware Caching with Multi-Path Routing for Wireless Edge Networks",
abstract = "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.",
author = "Samta Shukla and Onkar Bhardwaj and Abouzeid, {Alhussein A.} and Theodoros Salonidis and Ting He",
year = "2018",
month = "6",
day = "1",
doi = "10.1109/JSAC.2018.2844999",
language = "English (US)",
volume = "36",
pages = "1286--1299",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

Proactive Retention-Aware Caching with Multi-Path Routing for Wireless Edge Networks. / Shukla, Samta; Bhardwaj, Onkar; Abouzeid, Alhussein A.; Salonidis, Theodoros; He, Ting.

In: IEEE Journal on Selected Areas in Communications, Vol. 36, No. 6, 8374856, 01.06.2018, p. 1286-1299.

Research output: Contribution to journalArticle

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

PY - 2018/6/1

Y1 - 2018/6/1

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

VL - 36

SP - 1286

EP - 1299

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 6

M1 - 8374856

ER -