Interminable peer relationships in transient communities

• US 7,181,536 B2
• Filed: 03/27/2002
• Issued: 02/20/2007
• Est. Priority Date: 03/27/2002
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Wesley, Ajamu A., Burbeck, Stephen L.
• Primary Examiner(s): Najjar; Saleh
• Assistant Examiner(s): KOROBOV, VITALI A
• Application Number:
  US10/109,373
• Publication Number:
  US 20030187918A1
• Time in Patent Office: 1,791 Days
• Field of Search: 709/237, 709/238, 709/245, 709/205, 709/223, 370351-356, 370/466, 370/400, 370/409
• US Class Current: 709/245
• CPC Class Codes: H04L 61/00 Network arrangements, protocols or services for addressing or naming
• CPC Class Codes: H04L 61/45 Network directories; Name-to-address mapping
• CPC Class Codes: H04L 63/10 for controlling access to devices or network resources
• CPC Class Codes: H04L 67/02 based on web technology, e.g. hypertext transfer protocol [HTTP]
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1057 involving pre-assessment of levels of reputation of peers
• CPC Class Codes: H04L 67/51 Discovery or management thereof, e.g. service location protocol [SLP] or web services
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]

Abstract

Methods, systems, and computer program products are disclosed for persisting identifiers and relationships in a transient peer-to-peer networking environment where communities have ad hoc participants. Persistent identifiers are defined for nodes, allowing nodes to be identified across sessions and invocations, even though they re-enter the network with a different network address. Paths taken by content resources as they traverse the network (e.g. which nodes forwarded the content) are persisted, along with reputation information about nodes (e.g. indicating how successful they are at answering queries from peers). Trust relationships can be derived using the persisted information. A tiered broadcast strategy is defined for reducing the number of messages exchanged. Preferred embodiments leverage a web services implementation model.

Claims

1. A computer-implemented method of persistently identifying nodes in networks having transient network communities where a collection of nodes making up a network is dynamically changeable over time, comprising steps of:

assigning an initial network address to each node upon its initial entry into the network;

creating, for each of the nodes upon the initial entry of the node into the network, a persistent node identifier to uniquely identify the node across all of that node'"'"'s entries into the network, wherein the persistent node identifier for each of the nodes comprises;

(1) a network domain identifier of a network domain in which the initial entry occurred;

(2) the initial network address of the node; and

(3) a timestamp representing when the initial network entry occurred;

storing a mapping between the initial network address and the persistent node identifier for each of the nodes; and

using the persistent node identifier to resolve each node'"'"'s identity upon its subsequent entry into the network, even if a different network address is assigned to the node upon the subsequent entry.

2. The method according to claim 1, further comprising the steps of:

assigning, for a particular one of the nodes, the different network address to the particular node upon the subsequent entry of the particular node into the network; and

using the persistent node identifier of the particular node to resolve the particular node'"'"'s identity after assigning the different network address.

3. The method according to claim 1, further comprising the step of revising the stored mapping for a particular node, whenever the particular node subsequently enters the network with a different network address, such that the network address from the mapping for the particular node is replaced with the different network address.

4. The method according to claim 1, wherein the persistent node identifier of each node uniquely identifies a linkbase used by the node to store links.

5. The method according to claim 1, wherein the timestamp in the persistent node identifier for each of the nodes further comprises a date upon which the initial entry into the network occurred and optionally a time at which the initial entry into the network occurred.

6. The method according to claim 5, wherein the persistent node identifiers are based on a Universal Unique Identifier (“

UUID”

) format.

7. The method according to claim 1, wherein the mapping for a particular node is stored in a resource set having mappings that persistently identify other nodes known by the particular node.

8. The method according to claim 1, further comprising the step of using the persistent node identifiers to track each node'"'"'s behavior in the network.

9. The method according to claim 8, wherein the behavior for a particular node comprises how well the particular node responds to requests from other nodes.

10. The method according to claim 1, further comprising the step of using the persistent node identifier to track network traversal paths taken by content resources in the network.

11. The method according to claim 10, wherein the step of using the persistent node identifier to track network traversal paths further comprises the steps of:

identifying, for a particular content resource, where the particular content resource entered the network, or, alternatively, was generated in the network; and

identifying, for the particular content resource, each node through which the particular content resource passed on a selected network traversal, wherein the identifying steps use the persistent node identifiers for corresponding ones of the nodes.

12. The method according to claim 9, wherein the particular node'"'"'s behavior is indicated on outbound messages sent from the particular node.

13. The method according to claim 11, wherein the network traversal path of the particular content resource is indicated on outbound messages which carry the particular content resource.

14. The method according to claim 2, further comprising the steps of:

broadcasting, by each node upon each of its subsequent entries into the network, a message which identifies the node using its persistent node identifier and a current version of its network address;

receiving, by other nodes in the network, the broadcast message; and

revising, by the receiving nodes, their stored mappings to reflect the current version of the subsequently-entering node'"'"'s network address.

15. The method according to claim 1, wherein the mappings are specified using Xlink notation.

16. The method according to claim 14, further comprising the step of consulting the stored mappings to identify previous behavior of a selected node.

17. The method according to claim 14, further comprising the step of consulting the stored mappings to track content created by, or forwarded by, a selected node.

18. The method according to claim 1, wherein the network is a peer-to-peer network.

19. A system for persistently identifying nodes in ad hoc networks, where a collection of nodes making up a network is dynamically changeable over time, comprising:

means for assigning an initial network address to each node upon its initial entry into the network;

means for creating, for each of the nodes upon the initial entry of the node into the network, a persistent node identifier to uniquely identify the node across all of that node'"'"'s entries into the network, wherein the persistent node identifier for each of the nodes comprises;

(1) a network domain identifier that identifies a network domain in which the initial entry occurred;

(2) the initial network address of the node; and

(3) a timestamp representing when the initial network entry occurred;

means for storing a mapping between the initial network address and the persistent node identifier for each of the nodes;

means for revising the stored mapping, for each node that subsequently enters the network with a different network address, wherein the revision comprises replacing the initial network address with the different network address; and

means for resolving the particular node'"'"'s identity using its persistent node identifier after the particular node subsequently enters the network with the different network address.

20. The system according to claim 19, wherein the persistent node identifier of each node uniquely identifies a linkbase managed by the node.

21. The system according to claim 19, wherein the timestamp in the persistent node identifier for each of the nodes further comprises a date upon which the initial entry into the network occurred and optionally a time at which the initial entry into the network occurred.

22. The system according to claim 19, wherein the mappings are stored in a resource set having mappings that persistently identify the nodes in the network.

23. The system according to claim 19, further comprising means for using the persistent node identifiers to track each node'"'"'s behavior in the network, wherein the behavior for a particular node comprises how well the particular node responds to requests from other nodes.

24. The system according to claim 19, further comprising means for using the persistent node identifier to track network traversal paths taken by content resources in the network, wherein the means for using the persistent node identifier to track network traversal paths further comprises:

means for identifying, for a particular content resource, where the particular content resource entered the network, or, alternatively, was generated in the network; and

means for identifying, for the particular content resource, each node through which the particular content resource passed on a selected network traversal, wherein the means for identifying use the persistent node identifiers for corresponding ones of the nodes.

25. The system according to claim 23, wherein the particular node'"'"'s behavior is indicated on outbound messages sent from the particular node.

26. The system according to claim 24, wherein the network traversal path of the particular content resource is indicated on outbound messages which carry the particular content resource.

27. The system according to claim 19, further comprising:

means for broadcasting, by each node upon each of its subsequent entries into the network, a message which identifies the node using its persistent node identifier and a current version of its network address;

means for receiving, by other nodes in the network, the broadcast message; and

means for revising, by the receiving nodes, their stored mappings to reflect the current version of the subsequently-entering node'"'"'s network address.

28. A computer program product for persistently identifying nodes in ad hoc networks, where a collection of nodes making up a network is dynamically changeable over time, the computer program product embodied on one or more computer-readable media and comprising:

computer-readable program code for assigning an initial network address to each node upon its initial entry into the network;

computer-readable program code for creating, for each of the nodes upon the initial entry of the node into the network, a persistent node identifier to uniquely identify the node across all of that node'"'"'s entries into the network, wherein the persistent node identifier for each of the nodes comprises;

(1) a network domain identifier that identifies a network domain in which the initial entry occurred;

(2) the initial network address of the node; and

(3) a timestamp representing when the initial network entry occurred;

computer-readable program code for storing a mapping between the initial network address and the persistent node identifier for each of the nodes;

computer-readable program code for revising the stored mapping, for each node that subsequently enters the network with a different network address, wherein the revision comprises replacing the initial network address with the different network address; and

computer-readable program code for resolving the particular node'"'"'s identity using its persistent node identifier after the particular node subsequently enters the network with the different network address.

29. The computer program product according to claim 28, wherein the timestamp in the persistent node identifier for each of the nodes further comprises a date upon which the initial entry into the network occurred, and optionally a time at which the initial entry into the network occurred.

30. The computer program product according to claim 28, wherein the mappings are stored in a resource set having mappings that persistently identify the nodes in the network.

31. The computer program product according to claim 28, further comprising computer-readable program code for using the persistent node identifiers to track each node'"'"'s behavior in the network, wherein the behavior for a particular node comprises how well the particular node responds to requests from other nodes and wherein the particular node'"'"'s behavior is indicated on outbound messages sent from the particular node.

32. The computer program product according to claim 28, further comprising computer-readable program code for using the persistent node identifier to track network traversal paths taken by content resources in the network, wherein the computer-readable program code for using the persistent node identifier to track network traversal paths further comprises:

computer-readable program code for identifying, for a particular content resource, where the particular content resource entered the network, or, alternatively, was generated in the network; and

computer-readable program code for identifying, for the particular content resource, each node through which the particular content resource passed on a selected network traversal, wherein the computer-readable program code for identifying use the persistent node identifiers for corresponding ones of the nodes and wherein the network traversal path of the particular content resource is indicated on outbound messages which carry the particular content resource.

33. The computer program product according to claim 28, further comprising:

computer-readable program code for broadcasting, by each node upon each of its subsequent entries into the network, a message which identifies the node using its persistent node identifier and a current version of its network address;

computer-readable program code for receiving, by other nodes in the network, the broadcast message; and

computer-readable program code for revising, by the receiving nodes, their stored mappings to reflect the current version of the subsequently-entering node'"'"'s network address.

34. The computer program product according to claim 33, further comprising computer-readable program code for consulting the stored mappings to identify previous behavior of a selected node.

35. The computer program product according to claim 33, further comprising computer-readable program code for consulting the stored mappings to track content created by, or forwarded by, a selected node.