Cooperative Tx/Rx caching in interference channels: A storage-latency tradeoff study

Xu, Fan; Liu, Kangqi; Tao, Meixia

doi:10.1109/isit.2016.7541656

Cited by 32 publications

(32 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [15], separation of network and physical layers is proposed, which is proved to be approximately optimal. Reference [16] extended the works in [12]- [15] to include decentralized content placement at receivers.…”

mentioning

confidence: 99%

Online Edge Caching and Wireless Delivery in Fog-Aided Networks With Dynamic Content Popularity

Azimi

Simeone

Sengupta

et al. 2018

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Fog Radio Access Network (F-RAN) architectures can leverage both cloud processing and edge caching for content delivery to the users. To this end, F-RAN utilizes caches at the edge nodes (ENs) and fronthaul links connecting a cloud processor to ENs. Assuming time-invariant content popularity, existing information-theoretic analyses of content delivery in F-RANs rely on offline caching with separate content placement and delivery phases. In contrast, this work focuses on the scenario in which the set of popular content is time-varying, hence necessitating the online replenishment of the ENs' caches along with the delivery of the requested files. The analysis is centered on the characterization of the long-term Normalized Delivery Time (NDT), which captures the temporal dependence of the coding latencies accrued across multiple time slots in the high signal-to-noise ratio regime. Online edge caching and delivery schemes are investigated for both serial and pipelined transmission modes across fronthaul and edge segments. Analytical results demonstrate that, in the presence of a time-varying content popularity, the rate of fronthaul links sets a fundamental limit to the long-term NDT of F-RAN system. Analytical results are further verified by numerical simulation, yielding important design insights. Index TermsEdge caching, Online caching, C-RAN, F-RAN, interference management, fog networking, 5G.S. M. Azimi is with the CWiP,

show abstract

mentioning

confidence: 99%

Online Edge Caching and Wireless Delivery in Fog-Aided Networks With Dynamic Content Popularity

Azimi

Simeone

Sengupta

et al. 2018

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

“…[11] designs the optimal joint pushing and caching policy to maximize the bandwidth utilization and smooth the traffic load. [12] studies the fundamental tradeoff between storage and latency in a general wireless interference network with caches equipped at all the transmitters and receivers. [5], [9], [13] design the caching policy at the base stations.…”

Section: Related Workmentioning

confidence: 99%

Bandwidth Gain From Mobile Edge Computing and Caching in Wireless Multicast Systems

Sun

Chen

Tao

et al. 2020

IEEE Trans. Wireless Commun.

Self Cite

View full text Add to dashboard Cite

In this paper, we present a novel mobile edge computing (MEC) model where the MEC server has the input and output data of all computation tasks and communicates with multiple caching-and-computing-enabled mobile devices via a shared wireless link. Each task request can be served from local output caching, local computing with input caching, local computing or MEC computing, each of which incurs a unique bandwidth requirement of the multicast link. Aiming to minimize the transmission bandwidth, we design and optimize the local caching and computing policy at mobile devices subject to latency, caching, energy and multicast transmission constraints. The joint policy optimization problem is shown to be NP-hard. When the output data size is smaller than the input data size, we reformulate the problem as minimization of a monotone submodular function over matroid constraints and obtain the optimal solution via a strongly polynomial algorithm of Schrijver. On the other hand, when the output data size is larger than the input data size, by leveraging sample approximation and concave convex procedure together with the alternating direction method of multipliers, we propose a lowcomplexity high-performance algorithm and prove it converges to a stationary point. Furthermore, we theoretically reveal how much bandwidth gain can be achieved from computing and caching resources at mobile devices or the multicast transmission for symmetric case. Our results indicate that exploiting the computing and caching resources at mobile devices as well as multicast transmission can provide significant bandwidth savings.

show abstract

“…A detailed description of the transmission strategy is provided below as a function of the channel state G. From the discussion above, Encoder 2 transmits 1 bit of information to Decoder 2 in the states (1), (3), (5) and (7). For large F, the normalized transmission delay for transmitting the requested file to Decoder 2 is then equal to…”

Section: Proof Of Achievabilitymentioning

confidence: 99%

“…The delivery coding latency, henceforth delivery latency, measures the duration of the transmission block. A scenario in which both BSs and users have cache storage is considered in [6,7] under one-shot linear transmission and in [8] under several transmission schemes for both centralized and decentralized caching strategies. It is proved that both BSs and users' caches have the same quantitative contribution to the achievable sum-DoF.…”

Section: Introductionmentioning

confidence: 99%

Content Delivery in Fog-Aided Small-Cell Systems with Offline and Online Caching: An Information—Theoretic Analysis

Azimi

Simeone

Tandon

2017

Entropy

View full text Add to dashboard Cite

Abstract:The storage of frequently requested multimedia content at small-cell base stations (BSs) can reduce the load of macro-BSs without relying on high-speed backhaul links. In this work, the optimal operation of a system consisting of a cache-aided small-cell BS and a macro-BS is investigated for both offline and online caching settings. In particular, a binary fading one-sided interference channel is considered in which the small-cell BS, whose transmission is interfered by the macro-BS, has a limited-capacity cache. The delivery time per bit (DTB) is adopted as a measure of the coding latency, that is, the duration of the transmission block, required for reliable delivery. For offline caching, assuming a static set of popular contents, the minimum achievable DTB is characterized through information-theoretic achievability and converse arguments as a function of the cache capacity and of the capacity of the backhaul link connecting cloud and small-cell BS. For online caching, under a time-varying set of popular contents, the long-term (average) DTB is evaluated for both proactive and reactive caching policies. Furthermore, a converse argument is developed to characterize the minimum achievable long-term DTB for online caching in terms of the minimum achievable DTB for offline caching. The performance of both online and offline caching is finally compared using numerical results.

show abstract

Cooperative Tx/Rx caching in interference channels: A storage-latency tradeoff study

Cited by 32 publications

References 12 publications

Online Edge Caching and Wireless Delivery in Fog-Aided Networks With Dynamic Content Popularity

Online Edge Caching and Wireless Delivery in Fog-Aided Networks With Dynamic Content Popularity

Bandwidth Gain From Mobile Edge Computing and Caching in Wireless Multicast Systems

Content Delivery in Fog-Aided Small-Cell Systems with Offline and Online Caching: An Information—Theoretic Analysis

Contact Info

Product

Resources

About