PNRP Name Resolution via Direct Intermediary Links

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing serverless name resolution protocols face security concerns due to potential message compromise and difficulty in monitoring message transmission, as well as network traffic burdens from resolution messages in peer-to-peer networks.

Innovation Solution

A direct communication link is established between the initiating node and each intermediate node, with caching of information from contacted nodes to request leads on the target node, allowing the initiating node to maintain state and monitor the resolution process.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of operation

If a linear door-to-door approach is used for name resolution, then the resolution process can be simplified, but security is compromised and monitoring becomes difficult

Engineering Contradiction:
Improveresolution process simplicityVSAvoidmessage security
Core Design Contradiction:
Ease of operationVSReliability

Solution Approach 1:

The patent introduces an intermediary approach where the initiator maintains direct control over message transmission through separate communication links, rather than relying on intermediate nodes to forward messages. This mediator role allows the initiator to monitor and control the resolution process while still benefiting from indirect communication paths.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The resolution process is segmented into separate communication phases: the initiator establishes independent communication links with each intermediate node separately, rather than creating a single continuous message path. This segmentation allows for better security control and monitoring of each individual connection.

Inventive Principle:
Principle #1Segmentation

2Productivity

If messages are transferred through multiple intermediate nodes, then routing efficiency is improved, but network traffic burden increases

Engineering Contradiction:
Improverouting efficiencyVSAvoidnetwork traffic volume
Core Design Contradiction:
ProductivityVSQuantity of substance

Solution Approach 1:

The initiator performs preliminary actions by establishing direct communication links with intermediate nodes before the actual resolution message is transmitted. This preliminary setup allows for more efficient message routing with reduced overhead, as the communication paths are pre-established and optimized.

Inventive Principle:
Principle #10Preliminary action

3Adaptability or versatility

If message handling is entrusted to a series of nodes, then distributed processing is achieved, but monitoring capability is lost

Engineering Contradiction:
Improvedistributed processingVSAvoidmessage transmission monitoring
Core Design Contradiction:
Adaptability or versatilityVSDifficulty of detecting and measuring

Solution Approach 1:

The patent implements feedback mechanisms where the initiator receives acknowledgments and status information from each intermediate node through the established separate communication links. This feedback loop enables the initiator to monitor the resolution process and detect message status while maintaining distributed processing across multiple nodes.

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS7817647B2Flower-petal resolutions for PNRP
Publication Date: 2010.10.19 MICROSOFT TECHNOLOGY LICENSING LLC
  • US7817647B2 patent drawing
  • US7817647B2 patent drawing
  • US7817647B2 patent drawing

AI summary

The claimed process and system provides a resolution process for a multi-level cache resolution protocol that involves a lookup procedure whereby the initiating node contacts each intermediate node directly using a communication link separate from any previous intermediate node. The resolution process may involve caching information from each contacted intermediate node during the resolution process to request leads on the target node in the form of a list of closer nodes known to the intermediary node.