P2P Network Fountain Encoding Block Sharing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Peer-to-Peer (P2P) networks face performance bottlenecks due to the requirement of full piece validation before sharing blocks, leading to redundancy and increased download time, as they cannot share blocks until the entire piece is downloaded and validated, which limits the exploitation of upload resources and introduces redundancy.
Innovation Solution
The proposed solution involves delaying data-integrity checks and allowing block sharing before piece validation, utilizing a Digital Fountain mechanism to maximize information diversity and reduce redundancy by remapping Digital Fountain block generation, enabling peers to share blocks as soon as they are received, even if the piece is not fully downloaded, and using a BitFountain Delivery Remap (BFDR) mechanism to enhance diversity and efficiency in block distribution.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If full piece validation is performed before block sharing in P2P networks, then data integrity is ensured, but download time increases and upload resources are underutilized
Solution Approach 1:
The patent applies preliminary action by performing piece validation before block sharing. Peers validate received pieces using hash checks and only share blocks from validated pieces, ensuring data integrity is established in advance. This allows blocks to be shared confidently without requiring validation at each sharing point, reducing redundant validation operations and accelerating download processes.
2Reliability
If full piece validation is required before sharing blocks, then data reliability is maintained, but upload resource exploitation is limited
Solution Approach 1:
By validating pieces in advance before block sharing, the system prepares data for reliable distribution beforehand. Once a piece is validated, all its blocks can be freely shared without repeated validation overhead, enabling peers to maximize their upload capacity with pre-validated data, thus improving overall upload resource exploitation.
Solution Approach 2:
The patent segments the validation process from the sharing process. Validation is performed on complete pieces, while sharing operates on individual blocks from validated pieces. This segmentation allows the system to maintain reliability through piece-level validation while enabling flexible, high-speed block-level sharing, thereby improving upload resource utilization.
3Measurement precision
If conventional P2P validation protocols are used, then data accuracy is ensured, but network efficiency decreases due to redundancy
Solution Approach 1:
The patent performs data accuracy verification through hash validation in advance, before blocks are shared across the network. This preliminary validation ensures that only accurate data enters the sharing pool, eliminating the need for repeated accuracy checks during block exchange, thereby reducing redundancy and improving network efficiency.
Solution Approach 2:
Once a piece is validated, the patent enables efficient copying and distribution of its blocks across multiple peers without re-validation. The validated piece serves as a trusted source, and its blocks can be copied and shared freely, reducing the computational overhead of repeated accuracy checks and improving overall network efficiency.
Data Source
AI summary
In an embodiment, information contents, such as, e.g., media contents arranged in pieces including blocks of bits, is distributed over a network including plural terminals at least one of which acts as a source of the pieces of information distributed. Various terminals in the network are configured to act as peer terminals with at least one first peer terminal sending the information to one or more second peer terminals. A set of blocks of a corresponding piece of information is received at the first peer terminal and the corresponding piece of information is reconstructed from the set of blocks received. The pieces of information distributed over the network are fountain encoded by XOR-ing the blocks in a piece, so that a received piece is reconstructable from a combination of a corresponding set of linearly independent XOR-ed blocks. The first peer terminal may start sending to the second peer terminal(s) blocks it is receiving before the corresponding piece of information is reconstructed and possibly subjected to integrity check at the first terminal. Fountain encoding the pieces of information is by means of plural sets of linearly independent XOR-ed blocks. A same piece of information is distributed to a plurality of peer terminals by sending thereto different sets of linearly independent XOR-ed blocks, thus avoiding undue redundancy in the information further propagated to other peers.