Content Terminal Coefficient Vector ID Extraction for P2P Bandwidth Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current content sharing methods in peer-to-peer networks face inefficiencies due to high bandwidth usage, long download times, and resource wastage when transferring and reconstructing shared content blocks, particularly with high-dimensional coefficient vectors.
Innovation Solution
The method involves pre-configuring rules for constructing coefficient vectors with unique IDs, allowing content terminals to download and reconstruct original content blocks efficiently by transferring only the IDs of coefficient vectors, reducing the need for transferring entire coefficient vectors and comparing them, thus saving bandwidth and time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If coefficient vectors are transferred from content transmitting peer to content receiving peer, then the receiving peer can determine which code blocks to download, but this occupies large bandwidth resources
Solution Approach 1:
The patent extracts only the essential identification information (coefficient vector IDs) from the complete coefficient vectors, transferring only these IDs instead of the full vectors. This allows the receiving peer to identify which code blocks to download without receiving the entire coefficient vectors, thereby reducing bandwidth consumption while maintaining the ability to determine download requirements.
Solution Approach 2:
The receiving peer reconstructs the coefficient vectors locally by copying only the necessary identification elements (IDs) from the transmitting peer's list, rather than receiving complete vector data. This copying approach maintains functionality while minimizing data transfer requirements.
2Loss of information
If coefficient vectors are compared to determine downloaded code blocks, then the receiving peer can identify missing blocks, but this takes a long time with high dimensional vectors
Solution Approach 1:
The patent extracts only the identification component (ID) from the complex coefficient vectors for comparison purposes. By comparing only these simplified ID markers rather than full high-dimensional vectors, the receiving peer can quickly determine which code blocks are missing without the computational overhead of comparing complete vector data.
3Adaptability or versatility
If original content is divided into blocks and combined with coefficient vectors to obtain code blocks, then content can be shared in P2P network, but the combination loses linear coding property preventing original block sharing
Solution Approach 1:
The patent segments the code block information into two separate components: the code block data itself and the coefficient vector ID. This segmentation allows the receiving peer to identify and download only the necessary code blocks without requiring storage of redundant combined structures, thereby improving storage efficiency while maintaining P2P sharing capability.
4Reliability
If complex coefficient vectors are constructed to satisfy linear independence, then content can be recovered, but computation time increases decreasing sharing efficiency
Solution Approach 1:
The patent extracts only the identification element (ID) from the complex coefficient vectors for transmission and comparison purposes. This extraction maintains the reliability of content recovery (since the IDs uniquely identify the coefficient vectors needed for reconstruction) while dramatically improving sharing efficiency by eliminating the computational burden of transferring and comparing full complex vectors.
Data Source
Figure 1
Figure 2~3
Figure 4
AI summary
A method for transmitting shared contents includes: pre-configuring rules for constructing coefficient vectors corresponding to the shared content on each content terminal; by the content source peer, dividing the original content into blocks, constructing coefficient vectors corresponding to the original content according to the rules for constructing coefficient vectors, and combining each original content block with the corresponding coefficient vector linearly to obtain code blocks, with the ID of each code block same as the ID of the corresponding coefficient vector; and by the content receiving peer, downloading the code blocks from the content source peer according to the IDs of code blocks. A system for transmitting shared contents includes: a content source peer and a content receiving peer. The present invention also discloses a content terminal. The present invention may save the transmission bandwidth and improve the content sharing efficiency.