Hive-based peer-to-peer network

• US 8,103,870 B2
• Filed: 09/12/2007
• Issued: 01/24/2012
• Est. Priority Date: 09/12/2006
• Status: Expired due to Fees

• Current Assignee: Foleeo Incorporated
• Original Assignee: Foleeo Incorporated
• Inventors: Clower, Matthew J., Dean, Vada W., Ross, Joseph E., Parman, Ryan
• Primary Examiner(s): Revak, Christopher
• Assistant Examiner(s): KOSOWSKI, CAROLYN M
• Application Number:
  US11/900,702
• Publication Number:
  US 20080062870A1
• Time in Patent Office: 1,595 Days
• Field of Search: 713/161
• US Class Current: 713/161
• CPC Class Codes: H04L 61/457 containing identifiers of data entities on a computer, e.g. file names
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1061 using node-based peer discovery mechanisms static access to replicated servers H04L67/1006; service discovery H04L67/51
• CPC Class Codes: H04L 67/1063 Discovery through centralising entities
• CPC Class Codes: H04L 67/108 characterised by resources being split in blocks or fragments

Abstract

A collaborative data transferring process can combine segments from all known servers and peer-to-peer (P2P) sources simultaneously, regardless of their native protocols. The process uses variable data block size that can be dynamically selected according to sizes provided by sources, e.g., according to the protocol of the source, and can generate hash values or validation codes on the fly so that compliance with validation techniques (if any) of other protocols is not required. The process may be classified as a P2P protocol, although it also contains centralized elements. Machine language implementations and low syntax overhead allow file exchanges over a homogeneous network with high throughput and low bandwidth consumption.

Claims

1. A process comprising:

(a) identifying nodes on a network that have copies of desired content;

(b) requesting that a first of the nodes send a first piece of the desired content to a requesting node, the first piece having a first size;

(c) requesting that a second of the nodes send a second piece of the desired content to the requesting node, the second piece having a second size that differs from the first size;

(d) requesting that a first plurality of the nodes respectively calculate and return first remotely-calculated hash values for the first piece of the desired content;

(e) calculating a first local hash value from the first piece as received at the requesting node;

(f) receiving the remotely-calculated hash values for the first piece of the desired content;

(g) comparing the first local hash value and the first remotely calculated hash values to determine whether the first piece as received at the requesting node is valid;

(h) requesting that a second plurality of the nodes respectively calculate and return second remotely-calculated hash values for the second piece of the desired content;

(i) calculating a second local hash value from the second piece as received at the requesting node;

(j) receiving the remotely-calculated hash values for the second piece of the desired content; and

(k) comparing the second local hash value and the second remotely calculated hash values to determine whether the second piece as received at the requesting node is valid,

wherein the requesting node dynamically selects the first size of the first piece of the desired content according to the capabilities of the first of the nodes and the requesting node selects the second size of the second piece of the desired content according to the capabilities of the second of the nodes.

2. The process of claim 1, wherein the first of the nodes implements a first peer-to-peer protocol allowing transfers of pieces of sizes selected on the fly.

3. The process of claim 2, wherein the second of the nodes implements a second peer-to-peer protocol that requires transfers of pieces having the second size.

4. The process of claim 2, wherein the second of the nodes implements a data transfer protocol and is not compliant with any peer-to-peer protocol.

5. The method of claim 1, further comprising the nodes in the first plurality respectively calculating the first remotely-calculated hash values from respective copies of the desired content, only in response to the request in step (d).

6. The method of claim 1, further comprising the nodes in the second plurality respectively calculating the second remotely-calculated hash values from respective copies of the desired content, only in response to the request in step (g).

7. A non-transitory computer readable media containing instructions that when executed perform the process of claim 1.