Flower-petal resolutions for PNRP
First Claim
Patent Images
1. A serverless peer-to-peer name resolution protocol through which unique numbers are resolved to addresses, comprising the steps of:
- creating and initializing a node state object at an initiating node in an existing peer-to-peer mesh that keeps track of the state of a resolution process of the initiating node for establishing a direct connection, wherein the state object comprises information on a target node, a best match node, a next hop node, a path list, and a stack object;
creating a LOOKUP resolution message at the initiating node and sending the LOOKUP resolution message to an intermediate node in the existing peer-to-peer mesh;
receiving at the intermediate node a LOOKUP resolution message from the initiating node and determining whether the intermediate node contains information on a closer node to the target node than a node specified by the LOOKUP resolution message;
creating an answer message object at the intermediate node containing information on the closer node and sending the answer message to the initiating node in response to the LOOKUP resolution message object;
determining at the initiating node whether the closer node of the answer message matches a resolve criteria of the initiating node;
establishing a direct connection between the initiating node and closer node based on the LOOKUP resolution message if the resolve criteria is matched; and
changing the best match node to correspond to the intermediate node from which an answer message was received, adding the intermediate node from which an answer message was received on to the stack object, and adding the next hop node contained in the answer message to the stack object, when the answer message does not satisfy the resolve criteria.
3 Assignments
0 Petitions
Accused Products
Abstract
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.
87 Citations
18 Claims
-
1. A serverless peer-to-peer name resolution protocol through which unique numbers are resolved to addresses, comprising the steps of:
-
creating and initializing a node state object at an initiating node in an existing peer-to-peer mesh that keeps track of the state of a resolution process of the initiating node for establishing a direct connection, wherein the state object comprises information on a target node, a best match node, a next hop node, a path list, and a stack object; creating a LOOKUP resolution message at the initiating node and sending the LOOKUP resolution message to an intermediate node in the existing peer-to-peer mesh; receiving at the intermediate node a LOOKUP resolution message from the initiating node and determining whether the intermediate node contains information on a closer node to the target node than a node specified by the LOOKUP resolution message; creating an answer message object at the intermediate node containing information on the closer node and sending the answer message to the initiating node in response to the LOOKUP resolution message object; determining at the initiating node whether the closer node of the answer message matches a resolve criteria of the initiating node;
establishing a direct connection between the initiating node and closer node based on the LOOKUP resolution message if the resolve criteria is matched; andchanging the best match node to correspond to the intermediate node from which an answer message was received, adding the intermediate node from which an answer message was received on to the stack object, and adding the next hop node contained in the answer message to the stack object, when the answer message does not satisfy the resolve criteria. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A peer-to-peer computer mesh network comprising:
-
an initiating node attempting to resolve a unique number identifier to an address of a target node for the purpose of establishing a direction connection, wherein the initiating node contains a cache of local nodes and comprises a state object that keeps track of the state of a resolution process of the initiating node, the state object comprising information on a target node, a best match node, a next hop node, a path list, and a stack object; a first intermediate node that is listed in the cache of the initiating node and is closer to the target node than the initiating node, wherein the initiating node contains a cache of local nodes; wherein the initiating node sends a first LOOKUP resolution message to the first intermediate node when the initiating node does not have the target node address in its cache, wherein the intermediate node receives a LOOKUP resolution message from the initiating node and returns an answer message to the initiating node with the address of a second intermediate node closer to the target node than the first intermediate node; and wherein the initiating node establishes a direction connection to the target node if the resolve criteria is matched; and changing the best match node to correspond to the intermediate node from which an answer message was received, adding the intermediate node from which an answer message was received on to the stack object, and adding the next hop node contained in the answer message to the stack object, when the answer message does not satisfy the resolve criteria. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18)
-
Specification