Delivery Time Minimization in Cache-Assisted Broadcast-Relay Wireless\n Networks with Imperfect CSI

2018/03/11 by Jaber Kakar, Anas Chaaban, Kakar, Jaber +5
Computer Science · Engineering · #Cooperative Communication and Network Coding #Caching and Content Delivery #Advanced Wireless Network Optimization

paper · pdf · doi:10.48550/arxiv.1803.04059

Abstract

An emerging trend of next generation communication systems is to provide\nnetwork edges with additional capabilities such as storage resources in the\nform of caches to reduce file delivery latency. To investigate the impact of\nthis technique on latency, we study the delivery time of a cache-aided\nbroadcast-relay wireless network consisting of one central base station, M\ncache-equipped transceivers and K receivers under finite precision channel\nstate information (CSI). We use the normalized delivery time (NDT) to capture\nthe worst-case per-bit latency in a file delivery. Lower and upper bounds on\nthe NDT are derived to understand the influence of K,M, cache capacity and\nchannel quality on the NDT. In particular, regimes of NDT-optimality are\nidentified and discussed.\n

Related

• Cache-Assisted Broadcast-Relay Wireless Networks: A Delivery-Time\n Cache-Memory Tradeoff
• Delivery Time Minimization in Edge Caching: Synergistic Benefits of Subspace Alignment and Zero Forcing
• Cache Aided Wireless Networks: Tradeoffs between Storage and Latency
• Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic
• Fundamental Storage-Latency Tradeoff in Cache-Aided MIMO Interference Networks