Dynamic Video Storage Probability for P2P Sharing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In peer-to-peer (P2P) video on demand (VoD) services, lightweight devices with limited storage capacity struggle to store and share video and audio data effectively, leading to a low P2P sharing rate and increased server loading, as they are less likely to act as data providers due to insufficient storage space.
Innovation Solution
A method and device that dynamically adjust the storing probability of video and audio data on peers based on storage space, bit rate, and service request timing, extending the storage interval before a service request and setting a new probability when a request is received, allowing peers to share data more efficiently and reduce server loading.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If lightweight devices with limited storage capacity store more video and audio data to increase P2P sharing rate, then the P2P sharing rate improves, but the storage space constraint is violated
Solution Approach 1:
The patent implements dynamic adjustment of storing probability based on real-time system state. The storing probability is not fixed but changes according to storage space availability, peer count, and service request patterns. This allows the system to adapt to varying storage constraints while maintaining optimal P2P sharing performance.
Solution Approach 2:
The patent changes the parameter of storing probability from a static value to a dynamically adjustable parameter. By modifying this parameter based on storage space, peer density, and service requests, the system optimizes the balance between storage utilization and sharing effectiveness without violating storage constraints.
2Volume of stationary object
If lightweight devices store less video and audio data to satisfy storage space constraints, then the storage space constraint is satisfied, but the P2P sharing rate decreases
Solution Approach 1:
The patent implements feedback mechanisms where the system continuously monitors storage space usage, peer count, and service request patterns. Based on this feedback, the storing probability is adjusted dynamically. This closed-loop control ensures that storage constraints are satisfied while maintaining adequate P2P sharing rates through adaptive parameter adjustment.
Solution Approach 2:
The system transitions from static storage allocation to dynamic storage management. The storing probability changes in response to real-time conditions, allowing the system to maximize P2P sharing within storage constraints by being more aggressive in storage when space is available and more conservative when space is limited.
3Device complexity
If peers store video and audio data with fixed storing probability, then the storage management is simple, but the system cannot adapt to changing storage space and service request conditions
Solution Approach 1:
The patent makes the storing probability dynamic rather than fixed. The system automatically adjusts the storing probability based on storage space availability, peer density, and service request patterns. This dynamic approach provides adaptability to changing conditions while keeping the underlying mechanism relatively simple through rule-based probability adjustment.
Data Source
AI summary
According to one exemplary embodiment, a method operable to store video data and/or audio data is adapted to a first peer of a video and audio data system having a plurality of peers, and each peer has a corresponding storage space. In the method, before the first peer has not received a service request of a second peer of the plurality of peers, determines whether the video and audio data received by the first peer is stored in its corresponding storage space with a dynamically adjustable first video and audio storing probability, and extends a time interval of the first peer for storing received video and audio data; and when the first peer receives the service request of the second peer, sets a second video and audio storing probability. Thereby the second peer obtains at least one stored video and audio data from the first peer.