The Role of Caching in Future Communication Systems and Networks

Paschos, Georgios S.; Iosifidis, George; Tao, Meixia; Towsley, Don; CaireIEEE, Giuseppe

doi:10.1109/jsac.2018.2844939

Cited by 238 publications

(166 citation statements)

References 131 publications

Supporting

Mentioning

166

Contrasting

Order By: Relevance

“…We consider a utility-cache model which is more general than cache-hit maximization [4]. We introduce the weights w n,i,j to denote the utility when delivering a unit of file n (i.e., a coded chunk) to location i from cache j instead of the MBS, and trivially set w n,i,0 = 0.…”

Section: A Cache Utilitymentioning

confidence: 99%

“…The wireless edge caching architecture proposes to cache popular files at small-cell base stations (SBS) in order to serve future user requests [2]. This is a promising approach for accommodating the increasing mobile data traffic in a cost-efficient fashion [3], and has rightfully spurred a flurry of related work [4]. A weakness of these proactive caching solutions, however, is that they assume static and known file popularity.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Online Convex Optimization for Caching Networks

Paschos¹,

Destounis

Iosifidis

2020

IEEE/ACM Trans. Networking

Self Cite

View full text Add to dashboard Cite

We study the problem of wireless edge caching when file popularity is unknown and possibly non-stationary. A bank of J caches receives file requests and a utility is accrued for each request depending on the serving cache. The network decides dynamically which files to store at each cache and how to route them, in order to maximize total utility. The request sequence is assumed to be drawn from an arbitrary distribution, capturing time-variance, temporal and spatial locality of requests. For this challenging setting, we propose the Bipartite Supergradient Caching Algorithm (BSCA) which provably exhibits no regret (RT /T → 0). That is, as the time horizon T increases, BSCA achieves (at least) the same utility with the cache configuration that we would have chosen knowing all future requests. The learning rate of the algorithm is characterized by its regret expression RT = O( √ JT ), which is independent of the file library size. For the single-cache case, we prove that this is the lowest attainable bound. BSCA requires at each step J projections on intersections of boxes and simplices, for which we propose a tailored algorithm. Our model is the first that draws a connection between the network caching problem and Online Convex Optimization, and we demonstrate its generality by discussing various practical extensions and presenting a tracedriven comparison with state-of-the-art competitors.

show abstract

Section: A Cache Utilitymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Online Convex Optimization for Caching Networks

Paschos¹,

Destounis

Iosifidis

2020

IEEE/ACM Trans. Networking

Self Cite

View full text Add to dashboard Cite

show abstract

“…Then, for the SNM content, let V denote the number of requests for SNM content S f , which is assumed to be independent identically distributed. According to [22], V conforms to the following Pareto distribution:…”

Section: Content Popularity Modelmentioning

confidence: 99%

Human-Like Hybrid Caching in Software-Defined Edge Cloud

Hao

et al. 2020

IEEE Internet Things J.

View full text Add to dashboard Cite

With the development of Internet of Things (IoT) and communication technology, the number of next-generation IoT devices has increased explosively, and the delay requirement for content requests is becoming progressively higher. Fortunately, the edge-caching scheme can satisfy users' demands for low latency of content. However, the existing caching schemes are not smart enough. To address these challenges, we propose a human-like hybrid caching architecture based on the software defined edge cloud, which simultaneously considers the content popularity and the fine-grained user characteristics. Then, an optimization problem with a caching hit ratio as an optimization objective is formulated. To solve this problem, using reinforcement learning, we design a human-like hybrid caching algorithm. Extensive experiments show that compared with popular caching schemes, human-like hybrid caching schemes can improve the cache hit ratio by 20%.

show abstract

“…Therefore, temporal locality exists even with IRM, and time-varying content popularity complicates the locality by introducing the temporal correlation. As a result, the study of online caching in the case of time-varying content popularity can be very challenging [9]. Existing research on caching with time-varying content popularity can be roughly categorized into two groups: the first group of works aims to analyze or model temporal locality, and the second group targets at proposing caching solutions to cope with it.…”

Section: Introductionmentioning

confidence: 99%

The Study of Dynamic Caching via State Transition Field—the Case of Time-Varying Popularity

Gao

Zhao

Shen

2019

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

In the second part of this two-part paper, we extend the study of dynamic caching via state transition field (STF) to the case of time-varying content popularity. The objective of this part is to investigate the impact of time-varying content popularity on the STF and how such impact accumulates to affect the performance of a replacement scheme. Unlike the case in the first part, the STF is no longer static over time, and we introduce instantaneous STF to model it. Moreover, we demonstrate that many metrics, such as instantaneous state caching probability and average cache hit probability over an arbitrary sequence of requests, can be found using the instantaneous STF. As a steady state may not exist under timevarying content popularity, we characterize the performance of replacement schemes based on how the instantaneous STF of a replacement scheme after a content request impacts on its cache hit probability at the next request. From this characterization, insights regarding the relations between the pattern of change in the content popularity, the knowledge of content popularity exploited by the replacement schemes, and the effectiveness of these schemes under time-varying popularity are revealed. In the simulations, different patterns of time-varying popularity, including the shot noise model, are experimented. The effectiveness of example replacement schemes under time-varying popularity is demonstrated, and the numerical results support the observations from the analytic results. Index Termscache replacement policy, content popularity, shot noise model, temporal locality, online caching, mobile edge caching.

show abstract

The Role of Caching in Future Communication Systems and Networks

Cited by 238 publications

References 131 publications

Online Convex Optimization for Caching Networks

Online Convex Optimization for Caching Networks

Human-Like Hybrid Caching in Software-Defined Edge Cloud

The Study of Dynamic Caching via State Transition Field—the Case of Time-Varying Popularity

Contact Info

Product

Resources

About