Peer name resolution and discovery

• US 20070073859A1
• Filed: 09/29/2005
• Published: 03/29/2007
• Est. Priority Date: 09/29/2005
• Status: Abandoned Application

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Huitema, Christian, Singhal, Sandeep, Weisberg, Tomer, Rao, Ravi
• Application Number:
  US11/238,194
• Publication Number:
  US 20070073859A1
• Time in Patent Office: Days
• US Class Current: 709/223
• CPC Class Codes: H04L 61/45 Network directories; Name-to-address mapping
• CPC Class Codes: H04L 63/08 for authentication of entities cryptographic mechanisms or cryptographic arrangements for entity authentication H04L9/32
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1063 Discovery through centralising entities
• CPC Class Codes: H04L 67/1093 Some peer nodes performing special functions
• CPC Class Codes: H04L 67/51 Discovery or management thereof, e.g. service location protocol [SLP] or web services

Abstract

By adding a server as a node on a peer-to-peer network, the network may become more scalable, more reliable and more manageable, especially when the peer-to-peer network becomes very large.

Claims

1. A computer implemented method of peer name discovery and resolution in a peer-to-peer network comprising

accepting peer name registrations data from a node;

if the peer name data is not in a first format, translating the peer name data into the first format;

storing the registration data in a memory; and

allowing additional nodes to access the registration data stored in the memory or additional registration data.

2. The method according to claim 1, further comprising querying nodes in the peer-to-peer network for registration data.

3. The method according to claim 2, wherein the querying is performed in a periodic basis.

4. The method according to claim 2, further comprising monitoring the traffic in the peer-to-peer network querying the nodes during periods of lower network traffic.

5. The method according to claim 2, further comprising answering queries from additional nodes for peer name registration data.

6. The method according to claim 1, wherein the peer name data is stored in a server on the peer-to-peer network.

7. The method according to claim 1, further comprising determining the depreciation time of peer name registrations.

8. The method according to claim 7, further comprising adjusting the frequency of querying based on the determined deprecation time.

9. The method according to claim 1, further comprising performing an analysis on registration data.

10. The method according to claim 9, further comprising issuing queries for additional registration data based on the analysis of the registration data.

11. The method according to claim 9, further comprising categorizing the registration data.

12. The method according to claim 1, further comprising authenticating nodes on the peer network based on the registration data.

13. The method according to claim 12, wherein an authenticated node is only able to communicate with other authenticated nodes.

14. The method according to claim 12, wherein non-authenticated nodes cannot communicate with authenticated nodes.

15. The method according to claim 12, wherein authentication is based on passing a test.

16. The method according to claim 1, wherein registration data is mirrored and stored in a second memory.

17. A tangible computer readable medium with computer executable instructions for peer name discovery in a peer-to-peer network comprising computer executable instruction for:

accepting peer name registrations data from a node;

authenticating the node on the peer network based on the registration data;

if the peer name data is not in a first format, translating the peer name data into the first format;

storing the registration data in a memory;

allowing an authenticated node to communicate with other authenticated nodes;

forbidding a non-authenticated nodes to communicate with authenticated nodes; and

allowing additional authenticated nodes to access the registration data stored in the memory.

18. The computer readable medium of claim 17, wherein the peer name data is stored in a server on the peer-to-peer network.

19. A server comprising a processor, a memory, an input device and an output device, the server being connected to a peer-to-peer network and the server being capable of executing computer instructions comprising:

accepting peer name registrations data from a node;

authenticating the node on the peer network based on the registration data;

if the peer name data is not in a first format, translating the peer name data into the first format;

storing the registration data in a memory;

allowing an authenticated node to communicate with other authenticated nodes;

forbidding a non-authenticated nodes to communicate with authenticated nodes; and

allowing additional authenticated nodes to access the registration data stored in the memory.

20. The server of claim 19, further comprising computer instructions to categorize the registration data.