Adaptive Video Object Replication in Distributed Hash Tables
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Managing video surveillance networks effectively is challenging due to the need for content redundancy and resiliency, especially in scenarios where video feeds from different cameras have varying levels of sensitivity and priority, and existing distributed hash table systems lack adaptive policies for replication and overhead management.
Innovation Solution
A method that fragments video objects into segments, creates sub-keys from resource identifiers, and replicates them in a distributed hash table based on a redundancy factor, allowing for adaptive storage policies and efficient distribution across a network, with per-object or per-group policies for replication and redundancy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If video objects are replicated in a distributed hash table to ensure content redundancy and resiliency, then reliability is improved, but device complexity increases due to the need for adaptive policies for replication and overhead management
Solution Approach 1:
The patent applies parameter changes by dynamically adjusting the replication factor based on priority levels. High-priority video objects receive higher replication factors for enhanced redundancy, while low-priority objects use lower replication factors. This parameter-based approach resolves the contradiction by making replication adaptive to content importance rather than uniform across all objects.
Solution Approach 2:
The patent implements local quality by applying different replication policies to different video objects based on their priority levels. Each video object receives tailored replication treatment (high, medium, or low replication factor) according to its specific requirements, rather than a one-size-fits-all approach. This resolves the contradiction by optimizing reliability for each object locally while managing overall system complexity.
2Productivity
If video objects are fragmented into segments and replicated across the network, then productivity is improved through efficient distribution, but device complexity increases due to segment management and sub-key creation
Solution Approach 1:
The patent applies segmentation by dividing video objects into smaller segments for distributed storage in the network. Each segment is assigned a sub-key derived from the original video object's key, enabling independent storage and retrieval. This resolves the contradiction by improving distribution efficiency through parallel segment handling while managing complexity through systematic key derivation.
Solution Approach 2:
The patent uses hash keys and sub-keys as intermediaries to manage segment distribution. The key derivation function acts as an intermediary mechanism that systematically generates sub-keys from parent keys, automating the segment management process. This resolves the contradiction by reducing manual management complexity while enabling efficient distributed storage and retrieval.
3Adaptability or versatility
If adaptive storage policies are implemented with per-object or per-group replication, then adaptability is improved, but device complexity increases due to policy management overhead
Solution Approach 1:
The patent implements dynamics by making replication policies adaptive rather than static. The system dynamically determines replication factors based on video object priority levels (high, medium, low) and system conditions. This resolves the contradiction by improving adaptability to different content requirements while managing complexity through automated priority-based policy selection.
Solution Approach 2:
The patent applies partial action by implementing different levels of replication (high, medium, low) based on priority needs. Not all video objects receive maximum replication; instead, each receives the appropriate level needed for its priority class. This resolves the contradiction by optimizing adaptability for different scenarios while reducing overall policy management overhead through hierarchical policy levels.
Data Source
AI summary
A method is provided in one example embodiment and includes creating a key from a hash of a resource identifier associated with a video object; storing the video object in a distributed hash table with the key; and replicating the video object in the distributed hash table based on a redundancy factor associated with the video object. In more particular embodiments, the method can include fragmenting the video object into segments; creating sub-keys with a hash of resource identifiers associated with each of the segments; storing the segments in the distributed hash table with the sub-keys; and replicating the segments in the distributed hash table based on the redundancy factor.


