Method for optimally utilizing a peer to peer network

• US 8,095,614 B2
• Filed: 01/21/2005
• Issued: 01/10/2012
• Est. Priority Date: 01/23/2004
• Status: Active Grant

• Current Assignee: Kroll Information Assurance LLC
• Original Assignee: Tiversa, Inc. (Tiversa Holding Corp.)
• Inventors: Hopkins, Samuel P.
• Primary Examiner(s): Blair, Douglas
• Assistant Examiner(s): ZHANG, SHIRLEY X
• Application Number:
  US11/039,981
• Publication Number:
  US 20050163133A1
• Time in Patent Office: 2,545 Days
• Field of Search: 709227-229, 709238-244, 370229-240, 370254-258, 370/328, 370/338
• US Class Current: 709/208
• 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

The present invention relates to optimally utilizing a peer to peer network by increasing the amount of communication messages that are received. The present invention does this by eliminating under performing connections, by controlling how connections are attempted and by locating optimal connections. The present invention provides a way to increase the number of nodes that are available for searching.

Claims

1. A method comprising the steps of:

at a first peer node in a peer-to-peer network having a plurality of peer nodes in which connections among some of the 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;

A. grouping the plurality of peer nodes into first and second sub-peer networks by;

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

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

receiving a first set of responses from the second peer node including responses from the other peer nodes of the second peer node;

determining from peer node distance information provided in the first set of responses 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 a maximum number of hops that the search message can be forwarded using the first direct connection to the second peer node;

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 the maximum number of hops away from the first peer node;

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

issuing a second search 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 second set of responses from the determined peer node including responses from the other peer nodes of the determined peer node;

determining from peer node distance information provided in the second set of responses 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 a maximum number of hops that the second search message can be forwarded using the second direct connection;

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 the maximum number of hops away from the first peer node;

B. controlling connections among the plurality of peer nodes of the first and second sub-peer networks by;

receiving from the plurality of peer nodes, information about connections among the plurality of peer nodes within each of the sub-peer networks;

maintaining the connection information; and

accepting and denying a search request received by the first peer node from a requesting peer node requesting to connect to another peer node located in a sub-peer network different from the requesting peer node and the first peer node, the accepting and denying based on the connection information maintained by the first peer node and received from peer nodes other than the requesting peer node.

2. A method as set forth in claim 1 further comprising:

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

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

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

3. A method as set forth in claim 2 wherein the statistic is a number of received communications messages.

4. A method as set forth in claim 2 wherein the statistic is a last time a transmission was received.

5. A method as set forth in claim 2 wherein the statistic is a number of searches received.

6. A method as set forth in claim 2 wherein the statistic is based on an average or within a percentage of an average of other connections.

7. A method as set forth in claim 2 wherein the decision is based on the statistic being of a lower value compared to statistics of other connections with other peer nodes.

8. A method as set forth in claim 1 further 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; 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.

9. A method as set forth in claim 8 wherein the connection attempt is made concurrently to two nodes on the list.

10. A method as set forth in claim 1 wherein the first and second search messages comprise a predefined search term.

11. A method as set forth in claim 1 wherein the first and second search messages comprise a ping request.

12. A method as set forth in claim 1 further including disconnecting a connection of the determined peer node in response to receiving a duplicate search message.

13. A method as set forth in claim 1 further including:

splitting a communications load amongst load sharing peer nodes, each of the load sharing peer nodes being a node amongst the plurality of peer nodes that is directly connected to the first peer node; and

each load sharing peer node monitoring a respective one of the first and second sub-peer networks for network communications.

14. A method as set forth in claim 13 wherein each of the load sharing peer nodes is in communication with the first node.

15. A method as set forth in claim 14 wherein the first node receives the network communications from the load sharing peer nodes.