Deterministic Media Shuffle via Seed Transmission
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current media playback systems face challenges in recreating a shuffled order of media content across different devices due to random shuffling methods, leading to inefficient storage and transmission requirements, especially in devices with limited memory and bandwidth constraints.
Innovation Solution
A shuffle algorithm that uses a seed to consistently generate the same shuffled order, allowing only the seed and a reference to be transmitted, reducing data storage and bandwidth needs by packaging them into a single data package.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a shuffled order of media content items is determined and an ordered list is shared across devices, then correct ordering is ensured, but storage requirements and bandwidth usage increase
Solution Approach 1:
The patent extracts only the essential element needed for shuffling - the seed value - from the complete shuffled playlist data. Instead of transmitting the entire ordered list of media content items, only the compact seed is transmitted to client devices, which then use the deterministic shuffle algorithm to reconstruct the same ordered list locally, dramatically reducing data transmission requirements while maintaining ordering accuracy.
Solution Approach 2:
The patent creates a simplified copy (the seed) that contains only the essential information needed to reproduce the complete shuffled playlist. Each client device uses this seed copy with the deterministic algorithm to generate an identical copy of the shuffled order without needing to receive or store the full playlist data, reducing both storage and bandwidth requirements.
2Reliability
If full playlist information is transmitted to client devices, then accurate shuffle order is achieved, but transmission time and bandwidth requirements increase
Solution Approach 1:
The patent extracts only the seed value from the complete shuffled playlist information and transmits only this compact data structure to client devices. The deterministic shuffle algorithm on each device then reproduces the exact same shuffled order locally, reducing transmission time from potentially minutes to milliseconds while maintaining perfect shuffle order accuracy across all devices.
3Quantity of substance
If random shuffling is performed on each device, then data storage and transmission are reduced, but the same shuffled order cannot be accurately recreated across different devices
Solution Approach 1:
The patent changes the fundamental parameter of shuffling from non-deterministic random selection to deterministic algorithmic selection based on a seed. This parameter change allows the system to maintain data size efficiency (only transmitting the seed) while achieving reliability (identical shuffle orders across all devices using the same seed and deterministic algorithm).
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method for communicating a defined order of a plurality of media content items, the method performed at a first computing device and comprising receiving a first reference to a plurality of media content items arranged in a first order, determining a seed for a shuffle algorithm that enables the shuffle algorithm to arrange the plurality of media content items in a second order, and sending the seed, along with a second reference to the plurality of media content items, to a second computing device.