Method for optimally utilizing a peer to peer network

• US 9,300,534 B2
• Filed: 01/10/2014
• Issued: 03/29/2016
• Est. Priority Date: 01/23/2004
• Status: Active Grant

• Current Assignee: Kroll Information Assurance LLC
• Original Assignee: Tiversa Ip, Inc.
• Inventors: Hopkins, Samuel P.
• Primary Examiner(s): ZHANG, SHIRLEY X
• Application Number:
  US14/152,015
• Publication Number:
  US 20140195656A1
• Time in Patent Office: 809 Days
• Field of Search: 370/237
• US Class Current: 1/1
• CPC Class Codes: H04L 41/042 comprising distributed management centres cooperatively managing the network
• CPC Class Codes: H04L 41/0816 the condition being an adaptation, e.g. in response to network events
• CPC Class Codes: H04L 43/50 Testing arrangements
• 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/107 with limitation or expansion of the discovery scope
• CPC Class Codes: H04L 67/1093 Some peer nodes performing special functions
• CPC Class Codes: H04L 67/145 avoiding end of session, e.g. keep-alive, heartbeats, resumption message or wake-up for inactive or interrupted session
• CPC Class Codes: H04N 21/632 using a connection between clients on a wide area network, e.g. setting up a peer-to-peer communication via Internet for retrieving video segments from the hard-disk of other client devices broadcast-related systems characterised by transmission among terminal devices H04H60/80; distributed application using peer-to-peer [P2P] networks H04L67/104
• CPC Class Codes: Y10S 707/99956 File allocation

Abstract

In accordance with an embodiment of the invention, there is provided a method for splitting a load of monitoring a peer to peer network. The method has a first node in the peer to peer network receiving information reported by a second node in the peer to peer network, including information concerning which nodes are connected to the second node. The method further has the first node connecting to nodes different from the nodes that are connected to the second node using the received information. The method still further has the first node reporting information, including information concerning which nodes are connected to the first node, such that the second node also has access to the reported information, thereby splitting the load of monitoring the peer to peer network among the first and second nodes.

Claims

1. A method comprising:

at a first peer node in a peer-to-peer network having a plurality of peer nodes in which connections among some of the plurality of peer nodes cannot be formed because a number of hops among such nodes is more than a maximum number of hops allowed for the peer-to-peer network, the steps of;

connecting to a second peer node to form a direct connection;

issuing a search request message to the second peer node over the direct connection, the message requesting the second peer node to forward the search request message to other peer nodes of the second peer node;

receiving a response to the search request message from the second peer node including one or more responses from the other peer nodes of the second peer node, the response including peer node distance information;

determining from peer node distance information provided in the response, which of the other peer nodes of the second peer node is a determined peer node, such that a number of hops along a path from the first peer node to the second peer node to the determined peer node is equal to or greater than a maximum number of hops that the search request message may be forwarded using the direct connection to the second peer node;

maintaining connection information received from the plurality of peer nodes, the connecting information including information about connections among the plurality of peer nodes;

accepting or denying a search request received by the first peer node from a requesting peer node, the search request requesting to connect to another peer different from the requesting peer node and the first peer node, the accepting or denying based on the connection information maintained by the first peer node and received from peer nodes other than the requesting peer node;

connecting directly to the determined peer node to form a direct connection to the determined peer node that is in addition to the direct connection to the second peer node;

issuing a second search request message to the determined peer node requesting the determined peer node to forward the second search message to other peer nodes of the determined peer node;

receiving a response from the determined peer node including responses from the other peer nodes of the determined peer node; and

determining from peer node distance information provided in the response from the determined peer node, which of the peer nodes of the determined peer node is a second determined peer node, such that a number of hops from the first node to the determined peer node to the second determined peer node is equal to or greater than a maximum number of hops that the second search message can be forwarded using the direct connection to the determined peer node.

2. The method of claim 1 additionally comprising:

grouping the plurality of peer nodes into a first sub-peer network and a second sub-peer network by;

adding to the first sub-peer network, the second node and peers of the second node but not the determined peer node, wherein each node of the first sub-peer network is less than or equal to the maximum number of hops away from the first peer node; and

adding to the second sub-peer network, the determined peer node and peers of the determined peer node but not the second determined peer node, wherein each node of the second sub-peer network is less than or equal to the maximum number of hops away from the first peer node.

3. The method of claim 1 additionally comprising:

keeping a statistic on at least one connection between the first node and at least one connected peer node connected to the first peer node;

using the statistic for making a decision to disconnect the connected peer node; and

disconnecting the connected peer node in response to making the decision.

4. The method of claim 3 wherein the statistic is one or more of a number of received communications messages, a last time a transmission was received, a number of searches received, or based on an average or within a percentage of an average of other connections.

5. The method of claim 1 additionally comprising:

storing a list of peer nodes for the first peer node to connect with;

attempting to make at least one connection to at least one peer node from the list of peer nodes over the direct connection; and

waiting for a fixed duration of time in response to a failed connection attempt before attempting to make a connection to another peer node from the list of peer nodes.

6. The method of claim 5 wherein the step of attempting to make at least one connection is made concurrently to two peer nodes on the list.

7. The method of claim 1 wherein the search message comprises either a predefined search term or a ping request.

8. The method of claim 2 additionally comprising:

controlling connections among the plurality of peer nodes in the first and second sub-networks.

9. The method of claim 1 additionally comprising:

disconnecting a connection to the determined peer node in response to receiving a duplicate search message.

10. A first node for connecting to a network having a plurality of nodes arranged in a peer to peer network to exchange electronic messages, the first node comprising:

one or more hardware interfaces configured to exchange the electronic messages with other peer nodes such that connections to at least some of the other peer nodes cannot be directly made if a number of hops between such nodes is greater than a maximum number of hops allowed by a peer to peer network protocol used by the peer nodes;

a processor for executing instructions containing a stored program, the instructions for;

connecting to a second peer node to form a direct connection;

issuing a search request message to the second peer node over the direct connection, the message requesting the second peer node to forward the search request message to other peer nodes of the second peer node;

receiving a response to the search request message from the second peer node including one or more responses from the other peer nodes of the second peer node, the response including peer node distance information;

determining from peer node distance information provided in the response, which of the other peer nodes of the second peer node is a determined peer node, such that a number of hops along a path from the first peer node to the second peer node to the determined peer node is equal to or greater than a maximum number of hops that the search request message may be forwarded using the direct connection to the second peer node;

maintaining connection information received from the plurality of peer nodes, the connecting information including information about connections among the plurality of peer nodes;

accepting or denying a search request received by the first peer node from a requesting peer node, the search request requesting to connect to another peer different from the requesting peer node and the first peer node, the accepting or denying based on the connection information maintained by the first peer node and received from peer nodes other than the requesting peer node;

connecting directly to the determined peer node to form a direct connection to the determined peer node that is in addition to the direct connection to the second peer node;

issuing a second search request message to the determined peer node requesting the determined peer node to forward the second search message to other peer nodes of the determined peer node;

receiving a response from the determined peer node including responses from the other peer nodes of the determined peer node; and

determining from peer node distance information provided in the response from the determined peer node, which of the peer nodes of the determined peer node is a second determined peer node, such that a number of hops from the first node to the determined peer node to the second determined peer node is equal to or greater than a maximum number of hops that the second search message can be forwarded using the direct connection to the determined peer node.

11. The first node of claim 10 wherein the instructions are additionally for:

grouping the plurality of peer nodes into a first sub-peer network and a second sub-peer network by;

adding to the first sub-peer network, the second node and peers of the second node but not the determined peer node, wherein each node of the first sub-peer network is less than or equal to the maximum number of hops away from the first peer node; and

adding to the second sub-peer network, the determined peer node and peers of the determined peer node but not the second determined peer node, wherein each node of the second sub-peer network is less than or equal to the maximum number of hops away from the first peer node.

12. The first node of claim 10 wherein the instructions are additionally for:

keeping a statistic on at least one connection between the first node and at least one connected peer node connected to the first peer node;

using the statistic for making a decision to disconnect the connected peer node; and

disconnecting the connected peer node in response to making the decision.

13. The first node of claim 12 wherein the statistic is one or more of a number of received communications messages, a last time a transmission was received, a number of searches received, or based on an average or within a percentage of an average of other connections.

14. The first node of claim 10 wherein the instructions are additionally for:

storing a list of peer nodes for the first peer node to connect with;

attempting to make at least one connection to at least one peer node from the list of peer nodes over the direct connection; and

waiting for a fixed duration of time in response to a failed connection attempt before attempting to make a connection to another peer node from the list of peer nodes.

15. The first node of claim 14 wherein the instructions are additionally for attempting to make connections concurrently to two peer nodes on the list.

16. The first node of claim 10 wherein the search message comprises either a predefined search term or a ping request.

17. The first node of claim 10 wherein the instructions are additionally for:

disconnecting a connection to the determined peer node in response to receiving a duplicate search message.

18. The first node of claim 11 wherein the instructions are additionally for:

controlling connections among the plurality of peer nodes in the first and second sub-networks.