Asymptotic Laws for Joint Content Replication and Delivery in Wireless Networks

Abstract

We investigate on the scalability of multihop wireless communications, a major concern in networking, for the case that users access content replicated across the nodes. In contrast to the standard paradigm of randomly selected communicating pairs, content replication is efficient for certain regimes of file popularity, cache and network size. Our study begins with the detailed joint content replication and delivery problem on a 2D square grid, a hard combinatorial optimization. This is reduced to a simpler problem based on replication density, whose performance is of the same order as the original. Assuming a Zipf popularity law, and letting the size of content and network both go to infinity, we identify the scaling laws and regimes of the required link capacity, ranging from O(\sqrt{N}) down to O(1).

References in corpus (3)

• On Capacity Scaling in Arbitrary Wireless Networks
• The Balanced Unicast and Multicast Capacity Regions of Large Wireless Networks
• Asymptotic Capacity Bounds for Wireless Networks with Non-Uniform Traffic

Cited by in corpus (8)

• Wireless Device-to-Device Caching Networks: Basic Principles and System Performance
• Placing Dynamic Content in Caches with Small Population
• Fundamentals of Cluster-Centric Content Placement in Cache-Enabled Device-to-Device Networks
• Optimizing Content Caching to Maximize the Density of Successful Receptions in Device-to-Device Networking
• Multi-antenna Interference Management for Coded Caching
• Wireless Multihop Device-to-Device Caching Networks
• How Much Cache is Needed to Achieve Linear Capacity Scaling in Backhaul-Limited Dense Wireless Networks?
• Fundamental Limits on Throughput Capacity in Information-Centric Network