Source-linked AI summary

Caching at the Wireless Edge: Design Aspects, Challenges and Future Directions

Dong Liu, Binqiang Chen, Chenyang Yang, Andreas F. Molisch

arXiv:1810.13287v1cs.NI

TL;DR

Caching at the wireless edge seeks to improve wireless-network performance through popular-content reuse while accounting for prediction, placement, delivery, deployment, and wireless-network constraints. The article surveys these challenges and solutions, concluding that wireless-edge caching can improve spectral and energy efficiency through bandwidth and energy savings, subject to architectural and channel limitations.

  • Problem

    Wireless-edge caching requires understanding content popularity, user preferences, placement and delivery, deployment differences, and tradeoffs involving spectral efficiency, energy efficiency, and cache size.

  • Method

    The article surveys methods for predicting popularity distributions and user preferences, examines erroneous information, and reviews content placement, delivery, and caching architectures.

  • Results

    Wireless-edge caching can significantly improve spectral and energy efficiency compared with wired-edge caching by saving bandwidth and energy in server-to-infrastructure and infrastructure-to-user transmission.

  • Takeaways & Limitations

    Realizing wireless-edge caching’s full potential requires accounting for topology, interference, user mobility, limited battery, and fine-grained spatial content popularity.

  • Takeaways & Limitations

    Wireless-edge caching is constrained by wireless-network architecture and channel factors, including topology, interference, mobility, and limited battery.

Abstract

from arXiv · show

Caching at the wireless edge is a promising way of boosting spectral efficiency and reducing energy consumption of wireless systems. These improvements are rooted in the fact that popular contents are reused, asynchronously, by many users. In this article, we first introduce methods to predict the popularity distributions and user preferences, and the impact of erroneous information. We then discuss the two aspects of caching systems, namely content placement and delivery. We expound the key differences between wired and wireless caching, and outline the differences in the system arising from where the caching takes place, e.g., at base stations, or on the wireless devices themselves. Special attention is paid to the essential limitations in wireless caching, and possible tradeoffs between spectral efficiency, energy efficiency and cache size.

I. INTRODUCTION

Wireless edge caching reduces unnecessary content-delivery traffic by storing popular content near users before requests arrive. The article surveys prediction, placement, delivery, wired–wireless differences, and tradeoffs involving spectral efficiency, energy efficiency, cache size, and wireless constraints.

  • Motivation: Popular contents requested asynchronously by many users can be cached at base stations or user devices before requests arrive.Predicted popularity and growing device storage make local precaching feasible.
  • Benefits: Wireless edge caching can improve spectral and energy efficiency through user precaching, device-to-device communication, and small-base-station caching.Small-base-station caches can also eliminate the backhaul bottleneck.
  • Wireless-specific issues: Wireless caching differs from wired caching because architecture, wireless channels, interference, mobility, and limited batteries constrain its gains.The article emphasizes differences between local caching in wired and wireless edge systems.
  • Scope: The article examines content placement and delivery, including cache sizing and location, content selection, cache downloading, and serving requested content.These are the two closely coupled problems shared by wired and wireless caching.
  • Tradeoffs: The article compares spectral- and energy-efficiency gains and illustrates tradeoffs among cache size, network performance, and user quality of experience.The analysis uses simulations for two example systems.

II. KEY FEATURES OF CONTENT DELIVERY TRAFFIC

Content-request statistics can be predicted and used to design caching, but wireless systems require popularity estimates at fine spatial granularity. Local popularity may differ from global popularity, and dynamic users and limited requests make prediction difficult.

  • Prediction: Big data analytics can predict aggregate and per-user request patterns that inform caching design.Popularity and preference statistics are treated as inputs to caching decisions.
  • Content popularity: Content popularity is commonly modeled with a Zipf distribution characterized by catalog size Nf and skewness parameter β.Popularity changes more slowly than cellular traffic and may be approximated as constant over periods such as a week for movies or hours for news.
  • Content popularity: Global popularity in a city or country can differ from local popularity in a small region.Wireless caching therefore requires popularity information at a fine spatial granularity.
  • Content popularity: Predicting popularity within a base-station coverage area is challenging because associated users change dynamically and popular content receives limited cumulative requests.These conditions restrict the observations available during a content’s lifetime.

2) User preference:

User preferences differ across individuals and can be predicted from historical requests and similarities among users. Content delivery also varies between file downloading and video streaming, creating distinct caching and quality-of-experience requirements.

  • User preference: A user preference profile gives the probability that each content is requested by a specific user during a defined period.Users commonly show strong preferences for particular content categories.
  • User preference: Machine learning methods such as collaborative filtering can predict preferences from historical requests and user similarity.This problem has been extensively studied in recommendation systems.
  • Prediction errors: Erroneous popularity or preference information lowers cache-hit probability, reducing caching gains and adding energy costs from improper backhaul and base-station operations.Cache-hit probability is used to reflect caching performance.
  • Delivery traffic: File downloading is evaluated by download time, whereas video streaming requires low initial delay, suitable quality, and few playback stalls.Streaming starts immediately after the request, unlike file consumption after complete delivery.
  • Video streaming: Limited cache size creates a tradeoff between storing complete videos and storing partial videos that may not align with playback.Streaming caches may also need multiple quality versions, increasing placement difficulty.

III. CONTENT PLACEMENT: DIFFERENCE BETWEEN CACHING IN WIRELESS AND WIRED EDGE

Wireless cache placement reflects wireless architecture, channel conditions, and mobility, with caches distributed across infrastructure and user devices. Larger caches can reduce backhaul requirements, while interference strongly affects achievable gains.

  • Placement scope: Wireless-edge placement addresses benefits, tradeoffs, and research issues that arise from wireless architecture, channels, and user mobility.Caches may be installed at macro base stations, small base stations, relays, or user devices.
  • Caching at BSs: Caching at base stations can replace or reduce backhaul transport, while backhaul-free helpers support flexible and cost-effective deployment for popular content.Existing macro and small base-station caches alleviate backhaul congestion.
  • Caching at BSs: Increasing cache size raises cache-hit probability and lowers required backhaul capacity, producing a tradeoff between cache size and backhaul capacity.When backhaul is a bottleneck, larger caches can increase throughput.
  • Efficiency: Power-efficient cache hardware, such as high-speed solid-state disks, can allow caching to improve network energy efficiency.Caching at base stations also reduces traffic through backhaul, core, and wired networks.
  • Wireless-specific effects: Maximum energy-efficiency gain over no caching is 575% with complete interference removal and 250% without interference coordination.Wireless caching gains depend strongly on inter-cell interference.
  • Wireless-specific effects: Overlapped coverage from dense small-base-station or heterogeneous networks and user mobility mean wireless-edge caching potential remains incompletely exploited.These settings add constraints beyond the backhaul considerations of wired caching.

2) Caching at users:

User-side caching places content on terminals to serve requests locally or through nearby-device sharing, improving QoE and wireless throughput while introducing storage and energy tradeoffs.

  • Operators classify user precaching as prefetching via unicast or pushing via broadcast, depending on how content is placed.
  • Local caches can retrieve requested content with zero delay and without generating wireless traffic.
  • Users may resist allocating substantial storage, so popularity-based pushing may have low cache-hit probability and requires incentives.
  • Cache-enabled D2D can provide throughput that scales linearly with users, enabling order-of-magnitude spectral-efficiency improvements and a throughput–outage tradeoff.
  • High offloading ratios consume energy at users, particularly D2D transmitters, creating an offloading–energy tradeoff.

B. Caching Policy in Wireless Edge: Unique Features

Wireless caching requires policies that account for prediction errors, uncertain connectivity and mobility, limited caches, and radio-channel effects rather than relying on wired-network assumptions.

  • Reactive caching responds after requests, whereas proactive caching places predicted-demand content beforehand and can jointly optimize multiple nodes.
  • With prediction errors, proactive caching can reduce cache-hit probability and perform worse than reactive caching.
  • Small BS caches and request volumes limit hit probability, while independent popularity caching can underuse aggregate cache capacity.
  • Adjacent-BS cooperation or distributed caching can improve cache-hit probability and reduce delivery cost and latency, but sharing is harder for SBSs.
  • Unknown user locations make BS connectivity uncertain, motivating probabilistic caching that optimizes each content’s caching probability.
  • Mobility during delivery complicates caching; predicted movement can be optimized, while unpredictable movement may be modeled with a Markov chain.
  • Ignoring fading and interference can make optimized policies perform poorly; higher cache-hit probability may not improve spectral or energy efficiency.

2) Caching at users:

User caching differs from wired caching because wireless placement and delivery interact with channel conditions, interference, mobility, and the choice between unicast, broadcast, and D2D sharing.

  • User prefetching downloads predicted preferences by unicast, often under good channel conditions, but may interfere with ongoing transmissions.
  • Unicast predownloading consumes energy at both BSs and users, so accurate prediction of requested content and request timing is important.
  • Broadcasting popular content during off-peak periods can cause negligible or no degradation, whereas reserving bandwidth may hurt peak-time performance.
  • Cache-hit probability reflects cache-utilization efficiency but does not necessarily reflect wireless-resource utilization efficiency.
  • For cache-enabled D2D, probabilistic caching suits dynamic device proximity and is designed to help other users rather than only the caching user.
  • A water-filling-like caching distribution can maximize offloading for a given popularity distribution.
  • Users can combine multicast delivery with overhearing, although the resulting gain remains unknown.

IV. CONTENT DELIVERY: IMPACT OF CACHING ON WIRELESS TRANSMISSION

Caching changes wireless transmission design by introducing cross-layer objectives and altering user association, so cache placement and content delivery must be optimized together.

  • Caching at BSs can replace backhaul usage and reduce latency, while caching at users can offload wireless traffic.
  • Wireless caching introduces objectives such as minimizing backhaul traffic or end-to-end delay and maximizing offloading.
  • In overlapping heterogeneous networks, users may associate with a BS caching the requested content rather than the nearest BS to reduce delay or balance backhaul load.
  • Content-based association can make the closest BS generate interference stronger than the desired signal.

B. Coordinated Multi-Point Transmission (CoMP-JT)

CoMP-JT can reduce interference and backhaul requirements through coordinated service from cached contents, but its gains depend on cache placement and request synchronization. Wireless multicast and coded delivery also face asynchronous-demand, complexity, and delay constraints.

  • CoMP-JT with cached content: Traditional CoMP-JT is difficult to implement because it requires high-capacity backhaul, while backhaul-free helpers need user-assisted channel sharing or non-coherent transmission.Non-coherent CoMP-JT avoids interference but provides no multiplexing gain.
  • CoMP-JT with cached content: Caching at small-cell base stations makes CoMP-JT a cost-effective way to alleviate inter-cell interference by reducing data exchange over backhaul.When several adjacent base stations cache requested contents, they can serve users through CoMP-JT by exchanging only channel information.
  • Cache-placement tradeoffs: Caching popular contents in every small-cell base station raises the chance of joint availability but inevitably lowers the overall cache-hit probability.With a fixed cache size, maximizing the spectral-efficiency gain of cache-enabled CoMP-JT therefore requires careful policy design.
  • CoMP-JT with cached content: Users without jointly cached requested contents cannot be served by adjacent base stations, and their serving base stations generate interference that limits throughput gains.This interference comes from small-cell base stations not participating in CoMP-JT.
  • Multicast delivery: Asynchronous requests create a multicast tradeoff: waiting can cause large initial delay for video-on-demand, whereas harmonic broadcasting does not provide maximal spectral efficiency.Coded multicast can satisfy different requests with one transmission, but its coding complexity grows exponentially and per-user download delay increases with user count.

D. Device-to-Device communications

Cache-enabled D2D creates opportunities to offload traffic, but helper willingness and transmitter energy constrain its operation. Simulations examine caching, collaboration distance, transmit power, and the resulting offloading, spectral-efficiency, and energy tradeoffs.

  • D2D opportunities: Cache-enabled D2D creates opportunities to offload client/server traffic beyond traditional proximity-based peer-to-peer communication.Unlike traditional D2D, cached devices can support client/server traffic through locally stored content.
  • D2D constraints: Helper willingness can vary with time and battery state, making user incentives an important feasibility issue for cache-enabled D2D.The energy consumed by D2D transmitters must also be evaluated, and caching should be jointly optimized with the communication protocol.
  • Cache-size tradeoffs: Spectral efficiency increases with total cache size but eventually saturates, while energy efficiency generally rises and can later decline for very large libraries.Caching rarely used files can consume more energy than it saves because caches consume circuit power.
  • Simulation setup: The study evaluates offloading ratio as D2D-conveyed data divided by total cell traffic and energy consumption as averaged transmit and circuit power at each D2D transmitter.The evaluation varies collaboration distance, transmit power, request patterns, and caching policies.
  • Simulation results: Optimizing the caching policy improves offloading ratio and reduces energy consumption, while optimizing collaboration distance and transmit power is more critical.For small collaboration distances, offloading ratio and energy consumption exhibit a tradeoff.

VI. CONCLUSION REMARKS

Caching at the wireless edge can improve spectral and energy efficiency by saving bandwidth and energy across server-to-infrastructure and infrastructure-to-user transmissions. Realizing this potential requires accounting for wireless-specific limitations and accurate popularity and preference predictions.

  • Caching at the wireless edge significantly improves spectral efficiency and energy efficiency compared with caching at the wired edge.
  • The gains come from saving bandwidth and energy when retrieving files for wireless infrastructure and transmitting them to users.
  • Wireless caching must account for topology, interference, user mobility, and limited battery in both content placement and delivery.
  • Accurate predictions of popularity distributions and user preferences are needed for wireless edge caching.
Loading 1810.13287v1…