Figure 8 - uploaded by Alireza Sadeghi
Content may be subject to copyright.
Slow and fast time slots.

Slow and fast time slots.

Source publication
Preprint
Full-text available
With the tremendous growth of data traffic over wired and wireless networks along with the increasing number of rich-media applications, caching is envisioned to play a critical role in next-generation networks. To intelligently prefetch and store contents, a cache node should be able to learn what and when to cache. Considering the geographical an...

Contexts in source publication

Context 1
... on this observation, we consider a two-timescale approach to managing such a tree network of caching nodes. To that end, let τ = 1, 2, . . . denote the slow time intervals, each of which is further divided into T fast time slots indexed by t = 1, . . . , T ; see Fig. 8 for a depiction. We assume that the network state remains unchanged during each fast time slot t, but can change from t to t + 1. Suppose that the F files in the cloud are collected in the set F = {1, . . . , F }. At the beginning of each slot t, every leaf node n selects a subset of files in F to prefetch and store for possible use in ...
Context 2
... on this observation, we consider a two-timescale approach to managing such a tree network of caching nodes. To that end, let τ = 1, 2, . . . denote the slow time intervals, each of which is further divided into T fast time slots indexed by t = 1, . . . , T ; see Fig. 8 for a depiction. We assume that the network state remains unchanged during each fast time slot t, but can change from t to t + 1. Suppose that the F files in the cloud are collected in the set F = {1, . . . , F }. At the beginning of each slot t, every leaf node n selects a subset of files in F to prefetch and store for possible use in ...