Peer-to-peer name resolution protocol (PNRP) and multilevel cache for use therewith
First Claim
1. A serverless name resolution protocol through which unique numbers are resolved to addresses, comprising the steps of:
- receiving at a first node a request message from a requester node seeking address resolution of a second node having a unique number identifier, the request message including address information of the requester node;
populating a routing table of the first node with the address information of the requester node;
analyzing the request message;
generating a response message to the requester node identifying address information of the first node as best matching for the request message when one of three conditions is met;
otherwise determining a suitable next hop for the request; and
forwarding the request message to the suitable next hop.
2 Assignments
0 Petitions
Accused Products
Abstract
A serverless name resolution protocol ensures convergence despite the size of the network, without requiring an ever-increasing cache and with a reasonable numbers of hops. This convergence is ensured through a multi-level cache and a proactive cache initialization strategy. The multi-level cache is built based on a circular number space. Each level contains information from different levels of slivers of the circular space. A mechanism is included to add a level to the multi-level cache when the node determines that the last level is full. The PNRP includes a mechanism to allow resolution of names which are mapped onto the circular number space through a hash function. Further, the PNRP may also operate with the domain name system by providing each node with an identification consisting of a DNS component and a unique number.
-
Citations
25 Claims
-
1. A serverless name resolution protocol through which unique numbers are resolved to addresses, comprising the steps of:
-
receiving at a first node a request message from a requester node seeking address resolution of a second node having a unique number identifier, the request message including address information of the requester node;
populating a routing table of the first node with the address information of the requester node;
analyzing the request message;
generating a response message to the requester node identifying address information of the first node as best matching for the request message when one of three conditions is met;
otherwisedetermining a suitable next hop for the request; and
forwarding the request message to the suitable next hop. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19)
-
-
20. A multilevel cache for use in a peer to peer name resolution protocol, comprising a set of L levels, each level sized to hold K entries, and wherein the number of levels L is dynamic, increasing by 1 when a K+1 entry is to be added to a Lth level when the Lth level is occupied by K entries.
-
21. A method of dynamically maintaining a multilevel cache for use in a peer to peer name resolution protocol, comprising the steps of:
-
receiving a new entry to be entered into the multilevel cache;
determining in which level the new entry is to be stored;
determining if the level into which the new entry is to be stored is full;
storing the new entry in the level when the level is not full;
randomly replacing another entry with the new entry when the level is full and when the level is not a last level of the multilevel cache; and
adding a new level when the level is full and when the level is the last level of the multilevel cache, sorting entries from the last level between the last level and the new level, and storing the new entry. - View Dependent Claims (22, 23, 25)
-
-
24. A method of resolving a peer name to a peer address certificate, comprising the steps of computing a hash value of the peer name, associating therewith a unique number in the form <
- hash>
.<
unique number>
, formatting a request message, and transmitting the request message to a peer node.
- hash>
Specification