Live Event Segment Caching for Scrubbing Without Cache Bloat
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing caching strategies for live event media segments in edge servers are inefficient, leading to network saturation and reduced viewing experiences due to the need for re-downloading segments and excessive memory requirements, especially when providing scrubbing functionality like rewind, pause, and fast forward during live events.
Innovation Solution
Implement a caching method where live event segments are stored in high priority lists until a cutoff threshold is reached, then moved to low priority lists, allowing segments to be deleted as needed to manage cache memory effectively, while ensuring all relevant segments are cached for seamless scrubbing functionality.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all segments of live event downloadables are cached in high priority lists until events end, then scrubbing functionality (rewind, pause, fast forward) is fully supported, but excessive cache memory is required
Solution Approach 1:
The patent implements dynamic cache management by moving segments between high priority and low priority lists based on temporal criteria. Specifically, segments are moved from high priority to low priority lists based on their age relative to a cutoff threshold, allowing the system to adapt cache resource allocation dynamically during live events while maintaining scrubbing functionality for recent content and reducing overall cache memory requirements
Solution Approach 2:
The patent divides the cache memory into multiple priority lists (high priority and low priority lists) rather than using a single unified cache. This segmentation allows different segments of live event downloadables to be managed differently based on their temporal characteristics, enabling the system to maintain recent segments for scrubbing while archiving older segments with lower priority
2Quantity of substance
If LRU algorithm deletes segments based on least recent access, then cache memory is freed up, but segments needed for scrubbing functionality are discarded
Solution Approach 1:
The patent applies different caching strategies to different segments based on their temporal properties. Recent segments (within cutoff threshold) are maintained in high priority lists with higher retention, while older segments are moved to low priority lists. This local differentiation ensures that segments critical for scrubbing functionality are preserved while allowing less critical older segments to be deleted when cache memory is full
3Reliability
If edge servers re-download numerous segments to provide rewind capability, then scrubbing functionality is enabled, but upstream network link becomes saturated
Solution Approach 1:
The patent performs preliminary caching of live event segments in both high and low priority lists during the live event broadcast. By pre-caching segments before they are needed for scrubbing operations, the system eliminates the need for re-downloading segments during rewind, pause, or fast forward operations, thus preventing upstream network link saturation while maintaining full scrubbing functionality
Data Source
AI summary
In various embodiments, a live event caching application caches segments that are associated with live events. At a first point-in-time, the live event caching application stores a segment of a downloadable that is associated with a live event in a high priority list. At a second point-in-time, the live event caching application determines that the segment is at a tail of the high priority list, where the second point-in-time is subsequent to the first point-in-time. Upon determining that the segment is at the tail of the high priority list, further determining that an age of the segment is greater than a cutoff threshold. In response to determining that the age of the segment is greater than the cutoff threshold, moving the segment from the high priority list to a low priority list.