Method for optimally utilizing a peer to peer network

• US 8,904,015 B2
• Filed: 03/26/2012
• Issued: 12/02/2014
• Est. Priority Date: 01/23/2004
• Status: Expired due to Term

• Current Assignee: Kroll Information Assurance LLC
• Original Assignee: Tiversa Ip, Inc.
• Inventors: Hopkins, Samuel P.
• Primary Examiner(s): ZHANG, SHIRLEY X
• Application Number:
  US13/429,949
• Publication Number:
  US 20120185601A1
• Time in Patent Office: 981 Days
• Field of Search: 709227-229
• US Class Current: 709/227
• 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 for utilizing a peer to peer network having a plurality of nodes that exchange electronic messages over the peer to peer network, the method comprising:

a. defining a maximum concurrent connection value;

b. attempting through a first node, multiple connections to nodes in the peer to peer network up to the maximum concurrent connection value;

c. adding new connection attempts up to the concurrent connection value as connection attempts succeed or fail;

d. dropping a particular connection if a particular node receives less than a threshold number of messages on the particular connection during a predetermined amount of time; and

e. dropping the particular connection if the particular node receives a number of duplicate messages.

2. The method as set forth in claim 1 wherein the first node attempts more than the maximum concurrent connection value until a defined number of successful connection attempts.

3. The method as set forth in claim 1 wherein the first node waits a threshold amount of time for each connection attempt.

7. The method as set forth in claim 1 wherein messages received by the particular node over the particular connection are search requests.

8. The method as set forth in claim 1 wherein a particular node receives less than a threshold number of messages on the particular connection within a predetermined amount of time, further comprises:

determining a first number of messages received by the particular node over the particular connection;

waiting the predetermined amount of time to elapse;

determining a second number of messages received by the particular node over the particular connection;

determining a difference between the first number of message and the second number of messages; and

dropping the particular connection if the difference between the first number of messages and the second number of messages is less than the threshold number of messages.

9. The method as set forth in claim 8 wherein the threshold number of messages is an average number of messages received on all connections associated with the particular node.

11. The method as set forth in claim 1 further comprising:

maintaining a cache that includes information associated with newly discovered nodes in the peer to peer network.

12. The method as set forth in claim 11 further comprising:

connecting, by the particular node, to a new node utilizing the information in the cache in response to the particular node dropping the particular connection.

13. The method as set forth in claim 11 further comprising:

clearing the cache when the cache reaches a limit.

14. The method as set forth in claim 11 further comprising:

clearing the cache at set intervals.

15. The method as set forth in claim 1 wherein dropping the particular connection if the particular node receives a number of duplicate messages, further comprises:

maintain, by the particular node, a count of the duplicate messages received from a different node over the particular connection during a selected time period; and

dropping the particular connection if the count of duplicate messages maintained by the particular node exceeds a duplicate message threshold.

4. A node in a peer to peer network having a plurality of nodes that exchange electronic messages over the peer to peer network, the node comprising:

one or more interfaces configured to exchange the electronic messages with other nodes over the peer to peer network utilizing logic, wherein the logic is configured to;

attempt multiple connections to other nodes in the peer to peer network up to a maximum concurrent connection value that the node is allowed to have in the peer to peer network;

add new connection attempts up to the concurrent value as connection attempts succeed or fail;

drop a particular connection if less than a threshold number of messages are received on the particular connection during a predetermined amount of time; and

drop the particular connection if a number of duplicate messages are received.

5. The node as set forth in claim 4 further configured to attempts more than the maximum concurrent connection value until a defined number of successful connection attempts.

6. The node as set forth in claim 4 further configured to wait a threshold amount of time for each connection attempt.

10. The node as set forth in claim 4 wherein messages received by the particular node over the particular connection are search requests.