Dynamic Threshold Search Result Filtering in Peer-to-Peer Networks

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Peer-to-peer networks face issues with redundant and irrelevant search results, leading to increased network traffic and potential exclusion of better-matching results due to limitations in managing search results effectively.

Innovation Solution

A method and apparatus that compute a threshold value based on search request message fields to ensure only high-quality search results are returned, limiting the number of results and controlling their quality by using a weighted threshold value that adjusts as the search request message propagates through the network.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of energy

If the number of search results is limited to reduce network traffic, then network traffic is reduced, but better-matching results may be excluded

Engineering Contradiction:

Improvenetwork trafficVSAvoidquality of search results

Core Design Contradiction:

Loss of energyVSReliability

Solution Approach 1:

The patent applies parameter changes by computing a dynamic threshold value based on multiple fields from the search request message (results rank, results count, maximum results, hop count, and TTL). This threshold is calculated using a weighted formula that adapts to the current state of search propagation, allowing the system to dynamically adjust the quality bar for accepting results rather than using a fixed limit

Inventive Principle:

Principle #35Parameter changes

Solution Approach 2:

The threshold value is dynamic rather than static - it changes based on the search request parameters and propagation state. The formula incorporates variables like hop count and TTL to adjust the threshold as the search message travels through the network, enabling adaptive filtering that responds to real-time conditions

Inventive Principle:

Principle #15Dynamics

2Quantity of substance

If search messages are re-issued with increased TTL to find more results, then more results are obtained, but redundant duplicate results increase network traffic

Engineering Contradiction:

Improvenumber of search resultsVSAvoidnetwork traffic

Core Design Contradiction:

Quantity of substanceVSLoss of energy

Solution Approach 1:

The patent implements feedback by having intermediate nodes track the number of results already returned (results count field) and use this information to adjust the threshold value. This feedback mechanism prevents redundant searches by comparing against previously obtained results and adjusting acceptance criteria accordingly

Inventive Principle:

Principle #23Feedback

Solution Approach 2:

The system performs partial action by computing a threshold that may reject some lower-quality results even if more results are available. Rather than accepting all results up to a maximum number, it selectively accepts only those meeting the computed threshold, performing enough action to get quality results without excessive action that would generate redundant traffic

Inventive Principle:

Principle #16Partial or excessive action

Data Source

PatentUS7979414B2Method and apparatus for managing peer-to-peer search results

Publication Date: 2011.07.12 INTERNATIONAL BUSINESS MACHINE CORPORATION

AI summary

One embodiment of the present method and apparatus for processing a search request message received over a network includes computing a threshold value in accordance with the search request message and returning at least one search result to a user in response to the search request message, if a rank of the at least one search result at least meets the threshold value.