Distributed Media Data Hashing for Bandwidth Bottleneck Resolution
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional cable-based television systems face bandwidth limitations and bottlenecks due to centralized content distribution, restricting true video-on-demand capabilities and providing no viewer control over program timing.
Innovation Solution
A distributed media data dissemination architecture that uses hashing and a hash table to locate and replicate media data across multiple devices, allowing for efficient, decentralized content delivery by assigning primary and secondary roles to devices based on popularity and utilizing multicasting for popular content.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If centralized content distribution through a single forwarder is used, then system simplicity is maintained, but bandwidth bottlenecks and loss of scalability occur
Solution Approach 1:
The patent segments the centralized forwarding function by distributing media data blocks across multiple senders based on hash table bins. Each sender independently manages specific media blocks, eliminating the single-point bottleneck while maintaining systematic organization through hash-based allocation.
Solution Approach 2:
The patent introduces a new dimensional organization layer by mapping media data blocks to hash table bins and assigning bins to multiple senders. This creates a distributed architecture where media can be retrieved from any sender holding the appropriate bin, transforming the single-dimensional centralized model into a multi-dimensional distributed system.
2Adaptability or versatility
If all media data is broadcast to every client simultaneously, then content availability is maximized, but bandwidth consumption becomes impracticable
Solution Approach 1:
The patent implements self-service by enabling clients to directly request media data blocks from appropriate senders using hash table lookups. Clients autonomously determine which sender holds their requested media block and retrieve it directly, eliminating the need for centralized broadcasting while maintaining universal access.
Solution Approach 2:
The patent applies local quality by allowing different senders to hold different subsets of media data blocks based on hash table bin assignments. Each sender specializes in serving specific media blocks, creating a distributed storage system where content availability is maintained through selective replication rather than universal broadcasting.
3Device complexity
If media data traverses the network switch twice (to forwarder and back to clients), then centralized control is maintained, but network efficiency and speed are reduced
Solution Approach 1:
The patent extracts the forwarding function from the network switch by implementing direct client-sender communication paths. The switch is removed from the media data retrieval path, and clients directly contact senders using hash table-based addressing, eliminating the unnecessary traversal through the switch while maintaining systematic control.
4Loss of energy
If true video-on-demand is implemented without content replication, then bandwidth usage is optimized, but viewer control over content timing cannot be achieved
Solution Approach 1:
The patent applies preliminary action by pre-distributing media data blocks to multiple senders based on hash table bin assignments before client requests arrive. This pre-positioning of content across the network enables immediate retrieval upon client request, achieving true video-on-demand capability without requiring content replication for every possible client.
Data Source
AI summary
Media data is distributed across multiple devices and is locatable using a hashing function and a hash table. The media data is partially replicated based on popularity thereof. In a described implementation, a media data block is locatable by hashing a media data indicator to produce a media data hash value that maps to a bin of the hash table. The bin is associated with at least one device that stores and/or with a sender that is capable of sending to clients the media data blocks mapping thereto. Each bin may have primary and secondary roles. Devices holding primary roles store all of the media data blocks mapping to a bin. Devices holding secondary roles replicate the media data blocks mapping to the bin that are also within a top predetermined popularity percentage. Popularity is determined based on numbers of clients currently requesting a particular media data portion.


