P2P Data Entities with Non-Common Identifiers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing peer-to-peer (P2P) communication techniques face inefficiencies in distributing content with non-common data pieces, as they often require a large group of peers to share common content, but individualized content items, such as software or multimedia with language packs or advertisements, lead to smaller peer groups and inefficient data distribution.
Innovation Solution
A method and device for communicating data entities in a P2P network that include both common and non-common data pieces, using non-common data identifiers to determine which peers belong to subgroups sharing specific non-common data pieces, allowing for efficient distribution of individualized content without reducing the peer group size.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If individualized content items are distributed in P2P networks, then content personalization is achieved, but peer group size is reduced and distribution efficiency deteriorates
Solution Approach 1:
The patent segments content into common data pieces (shared by all peers) and non-common data pieces (specific to subgroups). This segmentation allows the system to maintain large peer groups for common content distribution while enabling personalization through non-common pieces. The descriptive file is also segmented to include separate identifier fields for common and non-common data pieces, facilitating efficient peer matching and content distribution.
2Measurement precision
If peer groups are reduced to share individualized content, then data retrieval accuracy is improved, but network resource utilization deteriorates
Solution Approach 1:
The patent applies local quality by making the peer matching process selective based on non-common data piece requirements. Instead of forming separate peer groups for each individualized content variant, the system maintains a large peer group and uses local quality filtering through non-common data identifiers. This allows peers to be matched precisely for their specific non-common content needs while maintaining access to the broader peer group for common content, thereby improving data retrieval accuracy without sacrificing network resource utilization.
Data Source
AI summary
A first peer device receives distinct first and second metadata. The first metadata includes a common identifier having a one-to-one relationship with a common data piece of a data entity. The common data piece is common to the first peer device, a second peer device, and a third peer device. The second metadata includes one or more non-common identifiers. Each of the one or more non-common identifiers has a one-to-one relationship with a non-common data piece of the data entity that is common to a group of peer devices including the first peer device and excluding the third peer device. The first peer device also receives a third identifier from the second peer device. The first peer device determines whether the second peer device is in the group of peer devices based on whether the third identifier is included in the one or more non-common identifiers.