Delivery Latency Trade-Offs of Heterogeneous Contents in Fog Radio Access Networks
Jasper Goseling, Osvaldo Simeone, Petar Popovski

TL;DR
This paper investigates the fundamental trade-offs in delivery latency for heterogeneous content types in Fog Radio Access Networks, highlighting how cache allocation impacts latency for different user requests.
Contribution
It characterizes the optimal latency trade-off in a two-EN, two-user F-RAN system under high-SNR conditions, considering content heterogeneity and cache constraints.
Findings
Optimal latency trade-off characterized in high-SNR regime
Cache allocation impacts delivery latency heterogeneity
Numerical examples illustrate the trade-offs
Abstract
A Fog Radio Access Network (F-RAN) is a cellular wireless system that enables content delivery via the caching of popular content at edge nodes (ENs) and cloud processing. The existing information-theoretic analyses of F-RAN systems, and special cases thereof, make the assumption that all requests should be guaranteed the same delivery latency, which results in identical latency for all files in the content library. In practice, however, contents may have heterogeneous timeliness requirements depending on the applications that operate on them. Given per-EN cache capacity constraint, there exists a fundamental trade-off among the delivery latencies of different users' requests, since contents that are allocated more cache space generally enjoy lower delivery latencies. For the case with two ENs and two users, the optimal latency trade-off is characterized in the high-SNR regime in terms…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Cooperative Communication and Network Coding · Opportunistic and Delay-Tolerant Networks
