Content tracking in transient network communities

• US 7,069,318 B2
• Filed: 03/27/2002
• Issued: 06/27/2006
• 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): LAZARO, DAVID R
• Application Number:
  US10/107,696
• Publication Number:
  US 20030217139A1
• Time in Patent Office: 1,553 Days
• Field of Search: 709/221, 709/224, 709/229, 709/203, 709/204, 709/238, 345/440, 715/734
• 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 tracking content 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 method of tracking content in networks having transient network communities where a collection of nodes making up the network may change over time, comprising steps of:

using a persistent node identifier to uniquely identify each node in the network, even tough a different network address may be assigned to the node upon entering the network multiple times;

creating a mapping between the persistent node identifier of each node and a current network address used by that node and revising the mapping to reflect the current network address assigned to the node upon subsequent entry of the node into the network, such that an identity of each of the nodes can be resolved even though a current network address assigned to the node upon entering the network may vary from one entry to another;

for each of the nodes in the network, storing, at the node, a directed graph associated with each content resource currently available from that node, thereby enabling a network traversal path taken by each of the content resources to be known, wherein;

each of the directed graphs represents a complete network traversal path of the associated content resource;

at least one of the directed graphs comprises plurality of arcs;

each arc of the directed graph for each of the content resources represents the content resource traversing from one node of the network to another;

a first of the arcs of each of the directed graphs (1) represents the content resource traversing from one of the nodes at which the content resource entered the network to a next of the nodes of the network through the content resource traversed on the network traversal path and (2) identifies, using the persistent node identifiers thereof, the node at which the content resource entered the network and the next of the nodes;

a last of the arcs of each of the directed graphs (1) represents the content resource traversing to one of the nodes at which the content resource is currently available from a next-preceding one of the nodes of the network through which the content resource traversed on the network traversal path and (2) identifies, using the persistent node identifiers thereof, the node at which the content resource is currently available and the next-preceding one of the nodes;

each of the nodes which each content resource is currently available stores the directed graph representing the complete network traversal path for the content resource to the each node, including at least the first of the arcs and, if the traversal path comprises the plurality of arcs, the last of the arcs; and

for each transmission of the content resource to a destination node from one of the nodes at which the content resource is currently available, also transmitting a reference to the directed graph associated with the content resource; and

maintaining the complete network traversal path upon each transmission of each of the content resources, further comprising steps of;

upon receipt of the transmitted content resource at the destination node, extending the directed graph for the content resource by adding a new last arc that represents the content resource traversing from the transimitting node to the destination node at which the content resource is now currently available and that identifies, using the persistent node identifiers thereof, the transmitting node and the destination node, thereby creating a new directed graph; and

storing the new directed graph, associated with the received content resource, at the destination node.

2. The method according to claim 1, wherein each of the arcs further comprises a nodal representation at both ends thereof, the nodal reprentations being used for the identifications of the traversed-from node and the traversed-to node on the network traversal path.

3. The method according to claim 1, further comprising the step of storing, at each node for each content resource currently available from the node, meta-data for each of the currently-available content resources, wherein the meta-data comprises a persistent identifier of the content resource.

4. The method according to claim 3, wherein the meta-data further comprises information pertaining to creation of the content resource.

5. The method according to claim 4, wherein the information further comprises a creator of the content resource and a date and time of the creation.

6. The method according to claim 3, wherein the meta-data further comprises information pertaining to entry of the content resource into the network and a date and time of the entry into the network.

7. The method according to claim 3, wherein the meta-data further comprises a description of the content resource.

8. The method according to claim 7, wherein the description is provided to a user who evaluates whether the content resource is desired.

9. The method according to claim 1, wherein each of the directed graphs stored at each of node is stored in association with a persistent content identifier that locally identifies the associated content resource.

10. The method according to claim 1, wherein a structured markup language notation is used to specify the directed graph for each content resource.

11. The method according to claim 1, wherein Xlink notation is used to specify the arcs of which the directed graphs are comprised.

12. The method according to claim 1, wheren each of the nodes stores a content mapping which maps between a current location of a particular content resource currently available from the node and a persistent identifier assigned to the content resource.

13. The method according to claim 12, wherein the persistent identifier of the content resource is stored as meta-data associated with the content resource and further comprising the step of using the persistent identifier in the associated meta-data to consult the content mapping, thereby determining the current location of the content resource.

14. The method according to claim 1, wherein the maintaining step further comprises steps of:

retrieving, by the destination node from the transmission, the reference to the directed graph associated with the transmitted content resource;

locating the directed graph using the retrieved reference; and

making a local copy of the located directed graph for use by the extending step.

15. The method according to claim 1, further comprising the step of storing the received content resource in a local content repository.

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

17. A method for tracking content in networks having transient network communities where a collection of nodes making up the network may change over time, comprising steps of:

for each of a plurality of content resources available from ones of the nodes in the network, using a directed graph to represent a complete network traversal path of the content resource, wherein;

at least one of the directed graphs comprises a plurality of arcs;

each arc of the directed graph for each of the content resources represents the content resource traversing from one node of the network to another;

a first of the arcs of each of the directed graphs (1) represents the content resource traversing from one of the node at which the content resource entered the network to a next of the nodes of the network through which the content resource traversed on the network traversal path and (2) identifies, using persistent node identifiers thereof the node at which the content resource entered the network and the next of the nodes;

a last of the arcs of each of the directed graphs (1) represents the content resource traversing to one of the nodes at which the content resource is currently available from a next-preceding one of the nodes of the network through which the content resource traversed on the network traversal path and (2) identifies, using persistent node identifiers thereof, the node at which the content resource is currently available and the next-preceding one of the nodes;

each of the nodes at which each content resource is currently available stores the directed graph representing the complete network traversal path for the content resource to the each node, including at least the first of the arcs and, if the traversal path comprises the plurality of arcs, the last of the arcs; and

for each transmission of the content resource to a destination node from one of the nodes at which the content resource is currently available, also transimitting a reference to the directed graph for the content resource; and

maintaining the complete network traversal path upon each transmission of each of the content resources, further comprising steps of;

upon receipt of the transmitted content resource at the destination node, extending the directed graph for the content resource by adding a new last arc that represents the content resource traversing from the transmitting node to the destination node at which the content resource is now currently available and that identifies, using persistent node identifiers thereof, the transmitting node and the destination node, thereby creating a new directed graph; and

storing the new directed graph, for the received content resource, at the destination.

18. The method according to claim 17, further comprising the step of storing, by each node, a mapping between a persistent identifier of each of the node'"'"'s locally stored content resources and a current location of each of the locally stored content resources.

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

identifying a selected content resource by its persistent identifier; and

using the persistent identifier for the selected content resource to consult the stored mapping to determine the current location of the selected content resource at a particular node.

20. The method according to claim 17, further comprising the steps of:

identifying a selected content resource by its persistent identifier; and

using the persistent identifier of the selected content resource to consult a specification of network traversal paths known to a particular node at which the selected content resource is currently available, thereby locating the complete network traversal path of the selected content resource for its traversal to the particular node.

21. The method according to claim 17, wherein each node in the network has a unique persistent node identifier, and wherein the identifications of the nodes of the arcs use their persistent node identifiers.

22. The method according to claim 17, further comprising the step of broadcasting a message, by each node as it enters the network, thereby advertising what content resources are currently available from the broadcasting node.

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

requesting, by a node receiving the broadcast message, a particular content resource from the broadcasting node;

receiving the requested content resource at the requesting node, along with a reference to broadcasting node'"'"'s directed graph for that content resource; and

storing the received content resource in a local content repository of the requesting node; and

wherein the step of storing the new directed graph stores the new directed graph, at the requesting node, as a local copy of the complete directed graph for the received content resource.

24. The method according to claim 17, wherein the content resources comprise files which are available for sharing among the nodes of the network.

25. The method according to claim 17, wherein the content resources comprise results of services which we available from the nodes of the network.

26. A system for tracking content in networks having transient network communities where a collection of nodes making up the network may change over time, comprising:

means for using a persistent node identifier to uniquely identify each node in the network, even though a different network address may be assigned to the node upon entering the network multiple times;

means for creating a mapping between the persistent node identifier of each node and a current network address used by that node and revising the mapping to reflect the current network address assigned to the node upon each subsequent entry of the node into the network, such that an identity of each of the nodes can be resolved even though a current network address assigned to the node upon entering the network may vary from one entry to another;

for each of the nodes in the network, means for storing, at the node, a directed graph associated with each content resource currently available from that node, thereby enabling a network traversal path taken by each of the content resources to be known, wherein;

each of the directed graphs represents a complete network traversal path of the associated content resource;

at least one of the directed graphs comprises plurality of arcs;

each arc of the directed graph for each of the content resources represents the content resource traversing from one node of the network to another;

a first of the arcs of each of the direct graphs (1) represents the content resource traversing from one of the nodes at which the content resource entered the network to a next of the nodes of the network through which the content resource traversed on the network traversal path and (2) identifies, using the persistent node identifiers thereof, the node at which the content resource entered the network and the next of the nodes;

a last of the arcs of each of the directed graphs (1) represents the content resource traversing to one of the nodes at which the content resource is currently available from a next-preceding one of the nodes of the network through which the content resource traversed on the network traversal path and (2) identifies, using the persistent node identifiers thereof, the node at which the content resource is currently available and the next-preceding one of the nodes;

each of the nodes at which each content resource is currently available stores the directed graph representing the complete network traversal path for the content resource to the each node, including at least the first of the arc and, if the traversal path comprises the plurality of arcs, the last of the arcs; and

for each transmission of the content resource to a destination node from one of the nodes at which the content resource is currently available, a reference to the directed graph associated with the content resource is also transmitted; and

means for maintaining the complete network traversal path upon each transmission of each of the content resources, further comprising;

upon receipt of the transmitted content resource at the destination node, means for extending the directed graph for the content resource by adding a new last arc that represents the content resource traversing from the transmitting node to the destination node at which the content resource is now currently available and that identifies, using the persistent node identifiers thereof, the transmitting node and the destination node, thereby creating a new directed graph; and

means for storing the new directed graph, associated with the received content resource, at the destination node.

27. The system according to claim 26, further comprising means for storing, at each node for each content resource currently available from the node, meta-data for each of the currently-available content resources, wherein the meta-data for each of the content resources comprises a persistent identifier of the content resource, information pertaining to (1) creation of the content resource or (2) entry of the content resource into the network, and a description of the content resource which may be provided to a user who evaluates whether the content resource is desired.

28. The system according to claim 27, wherein the information further comprises (1) a creator of the content resource and a date and time of the creation or (2) a date and time of the entry into the network.

29. The system according to claim 26, further comprising:

means for storing a content mapping which maps between a current location of a particular content resource and a persistent identifier of the content resource, wherein the persistent identifier of the content resource is stored as meta-data associated with the content resource; and

means for using the persistent identifier in the associated meta-data to consult the content mapping, thereby determining the current location of the content resource.

30. The system according to claim 26, wherein the means for maintaining further comprises:

means for retrieving, by the destination node from the transmission, the reference to the directed graph associated with the transmitted content resource;

means for locating the directed graph using retrieved reference; and

means for making a local copy of the located directed graph for use by the means for extending.

31. A computer program product for tracking content in ad hoc networks 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 using, for each of a plurality of content resources available from ones of the nodes in the network, a directed graph to represent a complete network traversal path of the content resource, wherein;

at least one of the directed graphs comprises a plurality of arcs;

each arc of the directed graph for each of the content resources represents the content resource traversing from one node of the network to another;

a first of the arcs of each of the directed graphs (1) represents the content resource traversing from one of the node at which the content resource entered the network to a next of the nodes of the network through which the content resource traversed on the network traversal path and (2) identifies, using persistent node identifiers thereof the node at which the content resource entered the network and the next of the nodes;

a last of the arcs of each of the directed graphs (1) represents the content resource traversing to one of the nodes at which the content resource is currently available from a next-preceding one of the nodes of the network through which the content resource traversed on the network traversal path and (2) identifies, using persistent node identifiers thereof, the node at which the content resource is currently available and the next-preceding one of the nodes;

each of the nodes at which each content resource is currently available stores the directed graph representing the complete network traversal path for the content resource to the each node, including at least the first of the arcs and, if the traversal path comprises the plurality of arcs, the last of the arcs; and

for each transmission of the content resource to a destination node from one of the nodes at which the content resource is currently available, also transimitting a reference to the directed graph for the content resource is also transmitted; and

computer-readable program code for maintaining the complete network traversal path upon each transmission of each of the content resources, further comprising;

computer-readable program code for extending;

upon receipt of the transmitted content resource at the destination node, the directed graph for the content resource by adding a new last arc that represents the content resource traversing from the transmitting node to the destination node at which the content resource is now currently available and that identifies, using persistent node identifiers thereof, the transmitting node and the destination node, thereby creating a new directed graph; and

computer-readable program code for storing the new directed graph, for the received content resource, at the destination node.

32. The computer program product according to claim 31, further comprising:

computer-readable program code for storing, by each node, a mapping between a persistent identifier of each of the node'"'"'s locally stored content resources and a current location of each of the locally stored content resources;

computer-readable program code for identifying a selected content resource by its persistent identifier; and

computer-readable program code for using the persistent identifier for the selected content resource to consult the stored mapping to determine the current location of the selected content resource at a particular node.

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

computer-readable program code for storing, by each node, a mapping between a persistent identifier of each of the node'"'"'s locally stored content resources and a current location of each of the locally stored content resources;

computer-readable program code for identifying a selected content resource by its persistent identifier; and

computer-readable program code for using the persistent identifier of the selected content resource to consult a specification of all network traversal paths known to a particular node at which the selected content resource is currently available, thereby locating the complete network traversal path of the selected content resource for its traversal to the particular node.

34. The computer program product according to claim 31, further comprising:

computer-readable program code for broadcasting a message, by each node as it enters the network, thereby advertising what content resources are currently available from the broadcasting node;

computer-readable program code for requesting, by a node receiving the broadcast message, a particular content resource from the broadcasting node;

computer-readable program code for receiving the requested content resource at the requesting node, along with a reference to the broadcasting node'"'"'s directed graph for that content resource; and

computer-readable program code for storing the received content resource in a local content repository of the requesting node; and

wherein the computer-readable program code for storing the new directed graph stores the new directed graph at the requesting node, as a local copy of the complete directed graph for the received content resource.