Fundamental Tradeoff Between Storage and Latency in Cache-Aided Wireless Interference Networks

@article{Xu2017FundamentalTB,
  title={Fundamental Tradeoff Between Storage and Latency in Cache-Aided Wireless Interference Networks},
  author={Fan Xu and Meixia Tao and Kangqi Liu},
  journal={IEEE Transactions on Information Theory},
  year={2017},
  volume={63},
  pages={7464-7491}
}
This paper studies the fundamental tradeoff between storage and latency in a general wireless interference network with caches equipped at all transmitters and receivers. The tradeoff is characterized by an information-theoretic metric, normalized delivery time (NDT), which is the worst case delivery time of the actual traffic load at a transmission rate specified by degrees of freedom of a given channel. We obtain both an achievable upper bound and a theoretical lower bound of the minimum NDT… 

Figures from this paper

Cooperative Tx/Rx caching in interference channels: A storage-latency tradeoff study
TLDR
This paper designs the delivery phase carefully to turn the considered interference channel opportunistically into broadcast channel, multicast channel, X channel, or a hybrid form of these channels, and obtains an achievable upper bound of the minimum FDT by solving a linear programming problem of the file splitting ratios.
A Storage-Latency Tradeoff Study for Cache-Aided MIMO Interference Networks
TLDR
This paper provides a study of the fundamental storage- latency tradeoff for a cache-aided MIMO interference network with 3 transmitters and 3 receivers and each node equipped with $M$ antennas.
Tradeoffs between storage and latency for cache-aided relay interference channels with No CSIT
  • Haobo Liang, R. Cheng
  • Computer Science
    2018 IEEE Wireless Communications and Networking Conference (WCNC)
  • 2018
TLDR
By applying the relay decode-and-forward (DF) protocol, the tradeoffs between storage and latency for a k-user cache-aided relay interference channel with K antennas at the relay when channel state information (CSI) is not available at the transmitters are investigated.
Fundamental Limits of Memory-Latency Tradeoff in Fog Radio Access Networks Under Arbitrary Demands
TLDR
This paper proposes achievable transmission policies, and derives an information-theoretic bound on the expected NDT under uniform popularity distribution, and analytically proves that the proposed scheme is optimal within a gap of two independent of the popularity distribution.
Degrees of Freedom of Cache-Aided Wireless Interference Networks
TLDR
The role of caches in wireless interference networks is studied, and a constant-factor approximation of the system’s degrees of freedom is provided, for arbitrary number of transmitters, number of receivers, content library size, receiver cache size, and transmitter cache size.
Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic
TLDR
A scheme based on the separation principle, which isolates the coded caching and multicasting problem from the physical layer transmission problem is proposed, and it is shown that this separation-based scheme is sufficient for achieving an information-theoretically order-optimal performance, when working in the generalized degrees of freedom (GDoF) limit.
Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic
TLDR
This work proposes a scheme based on the separation principle, which isolates the coded caching problem from the physical layer transmission problem, and proves its information-theoretic order optimality up to a multiplicative factor of 2.01.
A Converse Bound for Cache-Aided Interference Networks
TLDR
An information-theoretic lower bound on both the peak normalized delivery time (NDT), and the expected NDT of cache-aided interference networks with uniform content popularity is obtained.
Fundamental Limits of Cache-Aided Broadcast Networks with User Cooperation
TLDR
This work considers cache-aided broadcast networks with user cooperation, where a server connects with multiple users and the users can cooperate with each other through a cooperation network, and proposes new coded caching scheme that fully exploits time resource by allowing parallel transmission between the server and users.
Cache-Aided Interference Management in Partially Connected Wireless Networks
  • Fan Xu, M. Tao
  • Computer Science
    GLOBECOM 2017 - 2017 IEEE Global Communications Conference
  • 2017
TLDR
The authors' NDT results are directly applicable to K×K partially connected circular interference networks because L is a divisor of K, and the proposed delivery strategy exploits coded multicasting gain by XOR combining and transmitter coordination gain by interference alignment.
...
...

References

SHOWING 1-10 OF 45 REFERENCES
Cooperative Tx/Rx caching in interference channels: A storage-latency tradeoff study
TLDR
This paper designs the delivery phase carefully to turn the considered interference channel opportunistically into broadcast channel, multicast channel, X channel, or a hybrid form of these channels, and obtains an achievable upper bound of the minimum FDT by solving a linear programming problem of the file splitting ratios.
Degrees of Freedom of Cache-Aided Wireless Interference Networks
TLDR
The role of caches in wireless interference networks is studied, and a constant-factor approximation of the system’s degrees of freedom is provided, for arbitrary number of transmitters, number of receivers, content library size, receiver cache size, and transmitter cache size.
Cache aided wireless networks: Tradeoffs between storage and latency
TLDR
An information theoretic model of cache-aided wireless networks is presented, that includes the introduction of a new metric, namely normalized delivery time (NDT), which captures the worst case time to deliver any requested content to the users.
Interference networks with caches at both ends
TLDR
The results indicate that, for this particular network architecture, caches located at the receiver side are more effective than those at the transmitter side in order to reduce the NDT.
Fundamental Limits of Caching in Wireless D2D Networks
TLDR
A caching strategy based on deterministic assignment of subpackets of the library files, and a coded delivery strategy where the users send linearly coded messages to each other in order to collectively satisfy their demands are proposed.
Fundamental limits of cache-aided interference management
TLDR
A system comprising a library of files and a wireless network with an arbitrary number of transmitters and receivers, where each node is equipped with a local cache memory, demonstrates that in this setting, caches at the transmitters' side are equally valuable as the caches on the receivers' side, and shows that caching can offer a throughput gain that scales linearly with the size of the network.
Fundamental limits of cache-aided wireless BC: Interplay of coded-caching and CSIT feedback
  • Jingjing Zhang, P. Elia
  • Computer Science, Business
    2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2016
TLDR
This work identifies the optimal cache-aided degrees-of-freedom (DoF) within a factor of 4, by identifying near-optimal schemes that exploit the new synergy between coded caching and delayed CSIT, as well as by exploiting the unexplored interplay between caching and feedback-quality.
Cache-aided interference channels
TLDR
Focusing on the three-user case, it is shown that through careful joint design of these phases, this wireless link can reap three distinct benefits from caching: a load balancing gain, an interference cancellation gain, and an interference alignment gain.
Fundamental limits of caching
TLDR
This paper proposes a novel caching approach that can achieve a significantly larger reduction in peak rate compared to previously known caching schemes, and argues that the performance of the proposed scheme is within a constant factor from the information-theoretic optimum for all values of the problem parameters.
Cloud-aided wireless networks with edge caching: Fundamental latency trade-offs in fog Radio Access Networks
  • R. Tandon, O. Simeone
  • Computer Science
    2016 IEEE International Symposium on Information Theory (ISIT)
  • 2016
TLDR
A latency-centric analysis of the degrees of freedom of an F-RAN by accounting for the total content delivery delay across the fronthaul and wireless segments of the network, based on the introduction of a novel performance metric, the Normalized Delivery Time.
...
...