Method and apparatus for efficiently expanding a P2P network

• US 8,788,573 B2
• Filed: 06/30/2008
• Issued: 07/22/2014
• Est. Priority Date: 03/21/2005
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Jennings, Raymond B. III, LaVoie, Jason D.
• Primary Examiner(s): Dharia, Rupal
• Assistant Examiner(s): Nguyen, Van Kim T
• Application Number:
  US12/164,979
• Publication Number:
  US 20080270539A1
• Time in Patent Office: 2,213 Days
• Field of Search: 709/203, 709/204, 709/218, 709223-224, 709/231
• US Class Current: 709/203
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/107 with limitation or expansion of the discovery scope
• CPC Class Codes: H04L 67/51 Discovery or management thereof, e.g. service location protocol [SLP] or web services
• CPC Class Codes: H04L 67/568 Storing data temporarily at an intermediate stage, e.g. caching
• CPC Class Codes: H04L 67/59 Providing operational support to end devices by off-loading in the network or by emulation, e.g. when they are unavailable

Abstract

One embodiment of the present method and apparatus for efficiently expanding a P2P network includes receiving a search request message from a requesting node and sending a response message to the requesting node on behalf of a node that has the requested data, where the response message originates at an intermediate node. The intermediate node may respond on behalf of the “responding” node, for example, in cases where the responding node is too far away from the requesting node to receive the search request message.

Claims

1. A method for transferring data from a first node to a second node in a network, said method comprising steps of:

receiving, at a third node in the network, a search request message originating from said second node, said search request message requesting the data;

determining, by the third node, that the first node has the data and that the search request message will not reach the first node; and

sending, by the third node, a response message to said second node said response message indicating that said first node has the data, wherein said sending comprises;

locating information related to said data in a database associated with said third node, where said database includes at least one entry comprising information taken from a prior response message received by said third node in connection with a prior transfer of said data, the prior response message including a dedicated field that explicitly indicates a length of time for which said data will be available at said first node; and

constructing said response message using said information taken from said prior response message, wherein said information taken from said prior response message comprises at least one of;

a name of said data, a description of content of said data, a size of said data, a type of said data, a time of said prior transfer of said data, a number of hops separating said third node from said first node, meta data related to said prior response message, a source of said data, or said prior response message,

wherein the search request message specifies that the response message must come from a source of the data unless a hop count of the search request message has reached a specified value, and wherein the search request message further specifies that the response message is permitted to come from a node other than the source of the data when the hop count reaches the specified value, and

wherein at least one of;

the receiving, the determining, or the sending is performed using a processor.

2. The method of claim 1, where said prior response message originated at said first node.

3. The method of claim 1, wherein said information related to said data is automatically saved in said database for every response message received by said third node.

4. The method of claim 1, wherein said information related to said data is saved based on at least one of:

available database memory, available database storage, network bandwidth speed, network bandwidth utilization, or a length of time for which said first node has been active on said network.

5. The method of claim 1, wherein said method is executed at said second node.

6. The method of claim 1, wherein the third node receives the search request message from a fourth node that is different from the first node and the second node.

7. The method of claim 1, wherein said third node is an intermediate node located between said first node and second node.

8. The method of claim 1, wherein the determining comprises:

examining a time to live field or a hop count field of said search request message to determine how far in said network said search request message will travel; and

concluding that said time to live field or hop count field will expire before the search request message reaches the first node.

9. The method of claim 1, wherein a time period for keeping said at least one entry in said database is dictated by at least one of:

a fixed number of most recent data transfers, a fixed number of most popular responses, a fixed number of least popular data responses, or a length of time for which said first node has been active in said network.

10. The method of claim 1, wherein the prior response message indicates a length of time for which said first node has been active in said network.

11. The method of claim 1, wherein the search request message specifies that the at least one entry must be no older than a defined age in order for the information to be included in said response message.

12. A non-transitory computer readable storage device containing an executable program for transferring data from a first node to a second node in a network, where the program performs steps of:

receiving, at a third node in the network, a search request message originating from said second node, said search request message requesting the data;

determining, by the third node, that the first node has the data and that the search request message will not reach the first node; and

sending, by the third node, a response message to said second node, said response message indicating that said first node has the data, wherein said sending comprises;

locating information related to said data in a database associated with said third node, where said database includes at least one entry comprising information taken from a prior response message received by said third node in connection with a prior transfer of said data, the prior response message including a dedicated field that explicitly indicates a length of time for which said data will be available at said first node; and

constructing said response message using said information taken from said prior response message, wherein said information taken from said prior response message comprises at least one of;

a name of said data, a description of content of said data, a size of said data, a type of said data, a time of said prior transfer of said data, a number of hops separating said third node from said first node, meta data related to said prior response message, a source of said data, or said prior response message,

wherein the search request message specifies that the response message must come from a source of the data unless a hop count of the search request message has reached a specified value, and wherein the search request message further specifies that the response message is permitted to come from a node other than the source of the data when the hop count reaches the specified value.

13. The non-transitory computer readable storage device of claim 12, where said prior response message originated at said first node.

14. The non-transitory computer readable storage device of claim 12, wherein said information related to said data is automatically saved in said database for every response message received by said third node.

15. The non-transitory computer readable storage device of claim 12, wherein said information related to said data is saved based on at least one of:

available database memory, available database storage, network bandwidth speed, network bandwidth utilization, or a length of time for which said first node has been active on said network.

16. The non-transitory computer readable storage device of claim 12, wherein said program is executed at said second node.

17. The non-transitory computer readable storage device of claim 12, wherein said third node is an intermediate node located between said first node and second node.

18. The non-transitory computer readable storage device of claim 12, wherein the determining comprises:

examining a time to live field or a hop count field of said search request message to determine how far in said network said search request message will travel; and

concluding that said time to live field or hop count field will expire before the search request message reaches the first node.

19. The non-transitory computer readable storage device of claim 12, wherein a time period for keeping said at least one entry in said database is dictated by at least one of:

a fixed number of most recent data transfers, a fixed number of most popular responses, a fixed number of least popular data responses, or a length of time for which said first node has been active in said network.

20. Apparatus comprising:

for an input device for receiving, at a third node in the network, a search request message originating from said second node, said search request message requesting the data;

a processor for determining, by the third node, that the first node has the data and that the search request message will not reach the first node;

an output device for sending, by the third node, a response message to said second node, said response message indicating that said first node has the data; and

a database associated with said third node, where said database includes at least one entry comprising information taken from a prior response message received by said third node in connection with a prior transfer of said data, the prior response message including a dedicated field that explicitly indicates a length of time for which said data will be available at said first node,

wherein the processor additionally locates information related to said data in said database,

wherein the output device additionally constructs said response message using said information taken from said prior response message, wherein said information taken from said prior response message comprises at least one of;

a name of said data, a description of content of said data, a size of said data, a type of said data, a time of said prior transfer of said data, a number of hops separating said third node from said first node, meta data related to said prior response message, a source of said data, or said prior response message, and

wherein the search request message specifies that the response message must come from a source of the data unless a hop count of the search request message has reached a specified value, and wherein the search request message further specifies that the response message is permitted to come from a node other than the source of the data when the hop count reaches the specified value.