Edge Node Caching Policy Based on Content Popularity and Latency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In mobile edge computing (MEC) systems, the limited storage space of edge nodes poses a challenge in determining which content files to cache, and how to efficiently select an appropriate edge node to serve user equipment (UE) requests, especially when multiple UEs request content simultaneously.
Innovation Solution
A method is proposed that involves determining a caching policy for edge nodes based on the popularity of content items and latency between edge nodes and base stations. This policy includes transmitting content indications to edge nodes and clustering edge nodes based on latency to optimize content caching and delivery.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If content files are cached at edge nodes, then latency and backhaul traffic are reduced, but storage space at edge nodes is limited
Solution Approach 1:
The patent segments the caching function by introducing a separate caching layer at edge nodes that is independent from the main content storage. The edge nodes cache only frequently accessed content segments based on popularity metrics, while the core network retains full content libraries. This segmentation allows latency reduction for popular content without requiring edge nodes to store complete content libraries.
Solution Approach 2:
The patent implements local quality by making each edge node's cache content specific to its local population's preferences and access patterns. Each edge node independently determines which content to cache based on local popularity metrics, rather than uniformly caching the same content across all edge nodes. This localized caching strategy maximizes the utility of limited storage space at each edge node.
2Productivity
If multiple UEs request content simultaneously, then service coverage is improved, but selecting appropriate edge nodes becomes complex
Solution Approach 1:
The patent applies preliminary action by pre-establishing a mapping between edge nodes and content items based on predicted popularity and edge node capabilities. Before handling simultaneous requests, the system pre-determines which edge nodes should cache which content, creating a lookup structure that enables rapid response to multiple simultaneous requests without complex real-time decision-making.
Solution Approach 2:
The patent implements feedback mechanisms where edge nodes report cache hit rates, popularity metrics, and availability status back to the content distribution server. This feedback loop enables the system to dynamically adjust content placement and routing decisions, simplifying the selection process for handling simultaneous requests by using real-time status information rather than complex optimization algorithms.
Data Source
AI summary
Embodiments of the present disclosure relate to methods and apparatus for managing caching in mobile edge computing systems. According to an embodiment of the present disclosure, a method includes: determining a caching policy for caching a group of content items in a plurality of edge nodes, wherein determining the cache policy comprises determining whether to cache a content item in an edge node at least based on a popularity of the content item and a latency between the edge node and a group of base stations; and transmitting a content indication to each edge node of the plurality of edge nodes based on the determined caching polity respectively, herein the content indication transmitted to a respective edge node comprises one or more identifiers corresponding to one or more content items determined to be cached in the respective edge node.