Persisting node reputations in transient network communities

• US 7,177,929 B2
• Filed: 03/27/2002
• Issued: 02/13/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): Baturay; Alicia
• Application Number:
  US10/108,088
• Publication Number:
  US 20030217140A1
• Time in Patent Office: 1,784 Days
• Field of Search: 709/200, 709/224
• US Class Current: 709/224
• CPC Class Codes: H04L 61/00 Network arrangements, protocols or services for addressing or naming
• CPC Class Codes: H04L 61/50 Address allocation
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]

Abstract

Methods, systems, and computer program products are disclosed for persisting node reputations 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 persisting a node'"'"'s reputation in a transient network having transient network communities where a collection of nodes making up the network may change over time, comprising steps of:

creating, for each of the nodes in the transient network, a persistent node identifier to uniquely identify the node across all of the node'"'"'s entries into the network, even if a different network address is assigned to the node upon a subsequent entry into the network, wherein the persistent node identifier for each of the nodes comprises;

(i) an original network address assigned to the node upon its initial entry into the network;

(ii) a date of the initial entry;

(iii) a time of the initial entry; and

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

creating, for each of the nodes in the transient network, a mapping usable for resolving current network addresses to persistent node identifiers, wherein the mapping created for each of the nodes comprises an entry for each other one of the nodes in the network that is known to the each node and each of the entries specifies (i) the persistent node identifier of the other one and (ii) the current network address of the other one, and wherein the entries in the mapping for each of the nodes are revised when the each node learns that any of the known nodes has a changed current network address and when any additional node in the network becomes known to the each node;

recording, for each of the nodes in the transient network, reputation information usable for evolving trust among the nodes, wherein the recorded reputation information for each of the nodes comprises recorded results of the node'"'"'s behavior as it interacts with other ones of the nodes in the network; and

programmatically consulting the mapping, by each of the nodes when presented with a particular current network address of a particular one of the other nodes in the network, to obtain the persistent node identifier from the entry for the particular one of the other nodes, such that the mapping thereby enables associating the recorded reputation information for each of the nodes with the node even if the node'"'"'s current network address changes.

2. The method according to claim 1, wherein the recorded results for each node indicate how successful the node is at responding to queries from other nodes.

3. The method according to claim 1, wherein the recorded results for each node indicate the node'"'"'s efficiency at responding to queries from other nodes.

4. The method according to claim 3, wherein the efficiency is measured as elapsed time of the responses to the queries.

5. The method according to claim 2, wherein the success is determined for each of the queries the node can answer.

6. The method according to claim 2, wherein the success is determined collectively for all of the queries the node can answer.

7. The method according to claim 3, wherein the efficiency is determined individually for each of the queries the node can answer.

8. The method according to claim 3, wherein the efficiency is determined collectively for all of the queries the node can answer.

9. The method according to claim 1, wherein the recorded reputation information for each node comprises a set of queries which the node can answer, as well as the recorded results of the node'"'"'s behavior as it responds to those queries.

10. The method according to claim 1, wherein the recorded reputation information for each node comprises a set of services available from the node, as well as the recorded results of the node'"'"'s behavior as it performs those services.

11. The method according to claim 1, further comprising the step of forwarding a reference to the recorded reputation information for a particular node along with messages sent by the particular node, such that receivers of the messages can access the particular node'"'"'s recorded reputation information using the reference and can thereby determine whether to trust content of the messages.

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

receiving, by a particular node, a request for content available from that particular node; and

forwarding, by the particular node, the requested content, along with information asserting the particular node'"'"'s reputation, wherein the asserted reputation includes the recorded results for the particular node.

13. The method according to claim 12, further comprising the step of revising, by the particular node, its recorded results in response to receiving the request and forwarding the requested content.

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

receiving the forwarded content at a receiving node; and

storing, by the node receiving the forwarded content responsive to the step of receiving the forwarded content, a local version of the particular node'"'"'s reputation, wherein the local version reflects whether the received content is satisfactory to the node receiving the forwarded content.

15. The method according to claim 1, further comprising the step of broadcasting a message, by each node as it enters the network, thereby advertising the node'"'"'s version of its reputation, wherein the advertised reputation further comprises the node'"'"'s view of how successful it is in its interactions with other nodes in the network.

16. The method according to claim 15, wherein the advertised reputation further comprises content available from the broadcasting node.

17. The method according to claim 15, wherein the advertised reputation further comprises services available from the broadcasting node.

18. The method according to claim 15, further comprising steps of:

receiving, by another node in the network, the broadcast message;

retrieving from the broadcast message, by the receiving node, the broadcasting node'"'"'s version of its reputation; and

storing, by the receiving node, a local copy of the retrieved reputation.

19. The method according to claim 15, wherein the advertised reputation is a reference to the broadcasting node'"'"'s version of its reputation, and further comprising steps of:

receiving, by another node in the network, the broadcast message;

retrieving from the broadcast message, by the receiving node, the reference; and

storing, by the receiving node, a local copy of the reference.

20. The method according to claim 18, further comprising the step of revising the local copy, by the receiving node, to reflect the receiving node'"'"'s view of the broadcasting node'"'"'s reputation.

21. The method according to claim 20, wherein the local copy ignores the broadcasting node'"'"'s version of its reputation if the receiving node considers the broadcasting node to be untrustworthy.

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

determining, by a particular node, that it needs content or a service from another node;

determining which other nodes in the network can provide the needed content or service; and

evaluating the recorded results for the nodes which can provide the needed content or service in order to select a particular node, from among those nodes, from which to request the content or service.

23. The method according to claim 1, wherein the recorded results for the nodes indicate whether each of the nodes is considered untrustworthy.

24. The method according to claim 1, wherein the recorded results for the nodes are recomputed over time and thereby reflect whether the nodes are earning trust of other nodes in the network.

25. The method according to claim 24, wherein a particular node wanting to interact with another node in the network considers the other node'"'"'s recorded reputation information to determine whether to trust the other node.

26. The method according to claim 1, wherein the recorded reputation information for the nodes is recomputed over time and thereby reflects whether the nodes are considered, by other nodes in the network, to be efficient in responding to queries.

27. The method according to claim 26, wherein a particular node wanting to interact with another node in the network considers the recorded results of a plurality of other nodes to determine which of the other nodes can most efficiently carry out the interaction.

28. The method according to claim 15, further comprising the steps of:

receiving, by the broadcasting node, responses from other nodes which receive the broadcast message, wherein the responses comprise the other nodes'"'"' versions of their reputations; and

using, by the broadcasting node, the received versions from the responses to determine a local view of the other nodes'"'"' reputations.

29. The method according to claim 28, further comprising the step of sending, by the broadcasting node, a subsequent message to each of the other nodes from which the responses are received, wherein the subsequent message requests the other nodes to propagate a request for identity of nodes, thereby enabling the broadcasting node to learn of nodes in other subnets and to exchange reputation information with those nodes in other subnets.

30. A system for persisting a node'"'"'s reputation in a transient network having transient network communities where a collection of nodes making up the network may change over time, comprising:

means for creating, for each of the nodes in the transient network, a persistent node identifier to uniquely identify the node across all of the node'"'"'s entries into the network, even if a different network address is assigned to the node upon a subsequent entry into the network, wherein the persistent node identifier for each of the nodes comprises;

(i) an original network address assigned to the node upon its initial entry into the network;

(ii) a date of the initial entry;

(iii) a time of the initial entry; and

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

means for creating, for each of the nodes in the transient network, a mapping usable for resolving current network addresses to persistent node identifiers, wherein the mapping created for each of the nodes comprises an entry for each other one of the nodes in the network that is known to the each node and each of the entries specifies (i) the persistent node identifier of the other one and (ii) the current network address of the other one, and wherein the entries in the mapping for each of the nodes are revised when the each node learns that any of the known nodes has a changed current network address and when any additional node in the network becomes known to the each node;

means for recording, for each of the nodes in the transient network, reputation information usable for evolving trust among the nodes, wherein the recorded reputation information for each of the nodes comprises recorded results of the node'"'"'s behavior as it interacts with other ones of the nodes in the network; and

means for programmatically consulting the mapping, by each of the nodes when presented with a particular current network address of a particular one of the other nodes in the network, to obtain the persistent node identifier from the entry for the particular one of the other nodes, such that the mapping thereby enables associating the recorded reputation information for each of the nodes with the node even if the node'"'"'s current network address changes.

31. The system according to claim 30, wherein the recorded results for each node indicate how successful the node is at performing services for other nodes.

32. The system according to claim 30, wherein the recorded results for each node indicate the node'"'"'s efficiency at performing services for other nodes.

33. The system according to claim 30, wherein the recorded reputation information for each node comprises a set of queries which the node can answer and/or services available from the node, as well as the recorded results of the node'"'"'s behavior as it responds to those queries and/or performs those services.

34. The system according to claim 30, further comprising:

means for receiving, by a particular node, a request for content available from that particular node;

means for forwarding, by the particular node, the requested content, along with information asserting the particular node'"'"'s reputation, wherein the asserted reputation includes the recorded results for the particular node; and

means for revising, by the particular node, its recorded results in response to receiving the request and forwarding the requested content.

35. The system according to claim 34, further comprising:

means for receiving the forwarded content at a receiving node; and

means for storing, by the node receiving the forwarded content responsive to operation of the means for receiving the forwarded content, a local version of the particular node'"'"'s reputation, wherein the local version reflects whether the received content is satisfactory to the node receiving the forwarded content.

36. The system according to claim 30, further comprising:

means for determining, by a particular node, that it needs content or a service from another node;

means for determining which other nodes in the network can provide the needed content or service; and

means for evaluating the recorded results for the nodes which can provide the needed content or service in order to select a particular node, from among those nodes, from which to request the content or service.

37. A computer program product for persisting a node'"'"'s reputation in an ad hoc, transient network where a collection of nodes making up the network may change over time, the computer program product embodied on one or more computer-readable media and comprising:

computer-readable program code for creating, for each of the nodes in the ad hoc, transient network, a persistent node identifier to uniquely identify the node across all of the node'"'"'s entries into the network, even if a different network address is assigned to the node upon a subsequent entry into the network, wherein the persistent node identifier for each of the nodes comprises;

(i) an original network address assigned to the node upon its initial entry into the network;

(ii) a date of the initial entry;

(iii) a time of the initial entry; and

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

computer-readable program code for creating, for each of the nodes in the transient network, a mapping usable for resolving current network addresses to persistent node identifiers, wherein the mapping created for each of the nodes comprises an entry for each other one of the nodes in the network that is known to the each node and each of the entries specifies (i) the persistent node identifier of the other one and (ii) the current network address of the other one, and wherein the entries in the mapping for each of the nodes are revised when the each node learns that any of the known nodes has a changed current network address and when any additional node in the network becomes known to the each node;

computer-readable program code for recording, for each of the nodes in the transient network, reputation information usable for evolving trust among the nodes, wherein the recorded reputation information for each of the nodes comprises recorded results of the node'"'"'s behavior as it interacts with other ones of the nodes in the network; and

computer-readable program code for programmatically consulting the mapping, by each of the nodes when presented with a particular current network address of a particular one of the other nodes in the network, to obtain the persistent node identifier from the entry for the particular one of the other nodes, such that the mapping thereby enables associating the recorded reputation information for each of the nodes with the node even if the node'"'"'s current network address changes.

38. The computer program product according to claim 37, wherein the recorded reputation information for each node comprises a set of queries which the node can answer and/or services available from the node, as well as the recorded results of the node'"'"'s behavior as it responds to those queries and/or performs those services.

39. The computer program product according to claim 38, wherein the recorded results for each node indicate (1) how successful the node is at responding to queries from, and/or performing services for, other nodes and/or (2) the node'"'"'s efficiency at responding to queries from, or performing services for, other nodes, wherein the recorded results are recomputed over time to reflect changes to the node'"'"'s success and/or efficiency.

40. The computer program product according to claim 37, further comprising:

computer-readable program code for determining, by a particular node, that it needs content or a service from another node;

computer-readable program code for determining which other nodes in the network can provide the needed content or service; and

computer-readable program code for evaluating the recorded results for the nodes which can provide the needed content or service in order to select a particular node, from among those nodes, from which to request the content or service.

41. The computer program product according to claim 37, further comprising:

computer-readable program code for broadcasting a message, by each node as it enters the network, thereby advertising the node'"'"'s version of its reputation;

computer-readable program code for receiving, by the broadcasting node, responses from other nodes which receive the broadcast message, wherein the responses comprise the other nodes'"'"' versions of their reputations; and

computer-readable program code for using, by the broadcasting node, the received versions from the responses to determine a local view of the other nodes'"'"' reputations.

42. The computer program product according to claim 41, further comprising computer-readable program code for sending, by the broadcasting node, a subsequent message to each of the other nodes from which the responses are received, wherein the subsequent message requests the other nodes to propagate a request for identity of nodes, thereby enabling the broadcasting node to learn of nodes in other subnets and to exchange reputation information with those nodes in other subnets.

43. The computer program product according to claim 37, further comprising computer-readable program code for initializing the recorded results of one or more nodes'"'"' behavior with an externally-determined value.