DHT Interval Keepers for P2P Range Queries

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Peer-to-peer network systems face inefficiencies in searching for computing resources due to the lack of support for range queries, leading to time-consuming and inefficient searches, as they typically only index distinct values and not ranges of attribute values.

Innovation Solution

Implementing a distributed hash table (DHT) overlay network in a peer-to-peer system where nodes, or interval keepers, store and manage ranges of attribute values, allowing for efficient indexing and querying of computing resources by mapping close-by ranges to proximal locations, and using controlled flooding techniques to route queries effectively.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If a distributed hash table (DHT) structure is used to index distinct values, then information retrieval efficiency is improved, but the ability to support range queries is lost

Engineering Contradiction:

Improveinformation retrieval efficiencyVSAvoidrange query support

Core Design Contradiction:

ProductivityVSAdaptability or versatility

Solution Approach 1:

The system segments the attribute value space into discrete indexable units while maintaining the ability to represent ranges. Each node in the DHT indexes specific attribute values or ranges, allowing the system to maintain efficient lookup while supporting range queries by dividing the search space into manageable segments that can be independently queried.

Inventive Principle:

Principle #1Segmentation

2Device complexity

If flooding requests are used in early P2P systems, then simplicity of implementation is maintained, but network throughput and efficiency deteriorate

Engineering Contradiction:

Improvesystem implementation simplicityVSAvoidnetwork throughput

Core Design Contradiction:

Device complexityVSProductivity

Solution Approach 1:

The patent introduces intermediary nodes (interval keepers) that act as mediators between query sources and data sources. These intermediaries maintain indexed information about attribute value ranges and can directly route queries to relevant nodes, eliminating the need for widespread flooding while maintaining system simplicity.

Inventive Principle:

Principle #24Intermediary (Mediator)

3Reliability

If deterministic DHT structure is implemented, then information location reliability is improved, but routing overhead and message traffic increase

Engineering Contradiction:

Improveinformation location guaranteeVSAvoidrouting overhead

Core Design Contradiction:

ReliabilityVSLoss of energy

Solution Approach 1:

The system performs preliminary actions by pre-indexing attribute value ranges at interval keeper nodes before queries are issued. This pre-organization of data metadata allows queries to be efficiently routed without extensive message passing, as the routing information is already in place and can be quickly consulted.

Inventive Principle:

Principle #10Preliminary action

Data Source

PatentUS7805448B2Storing attribute values of computing resources in a peer-to-peer network

Publication Date: 2010.09.28 PALO ALTO NETWORKS INC

AI summary

A system comprises a plurality of computing resource. Attribute values for the computing resources are stored in a peer-to-peer network in the system. A method for storing an attribute value comprises receiving an attribute value for a resource in the system, identifying a node in the peer-to-peer network for storing the attribute value, wherein the node stores a range of attribute values encompassing the received attribute value, and storing the attribute value at the identified node.