Background file sharing in a segmented peer-to-peer file sharing network

• US 8,131,673 B2
• Filed: 12/05/2006
• Issued: 03/06/2012
• Est. Priority Date: 12/05/2006
• Status: Active Grant

• Current Assignee: Dropbox, Inc.
• Original Assignee: International Business Machines Corporation
• Inventors: Chavez, Timothy R., Lauridsen, Christina K., Patel, Sushma B., Peterson, Robert R., Salem, Loulwa F., Seacat, Lisa A.
• Primary Examiner(s): Ali, Mohammad
• Assistant Examiner(s): Tran, Bao G
• Application Number:
  US11/566,835
• Publication Number:
  US 20080133538A1
• Time in Patent Office: 1,918 Days
• Field of Search: 707/3, 707/10, 707/662, 707/999.002, 707/610, 707/637, 715716-726, 709/223, 709/228, 709/232, 705/7, 705/10
• US Class Current: 707/622
• CPC Class Codes: H04L 67/06 specially adapted for file transfer, e.g. file transfer protocol [FTP]
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/108 characterised by resources being split in blocks or fragments

Abstract

A peer-to-peer file sharing client with background file sharing is provided in a segmented peer-to-peer file sharing network. Each file sharing participant may designate an amount of bandwidth and/or storage space for background file sharing. Peer-to-peer file sharing clients then share file data and content in the background automatically. The client may participate in additional swarms, in the background, to generally increase the number of peers in file sharing networks, thus increasing the speed of downloading desired files for other users.

Claims

1. A method in a peer-to-peer file sharing client data processing system for background file sharing in a peer-to-peer file sharing computer network, the method comprising:

allocating background resources in the peer-to-peer file sharing client data processing system for background file sharing comprising a specified amount of bandwidth and a specified amount of storage space to be used for background file sharing, wherein the amount of bandwidth and the amount of storage space to be used for background file sharing are specified in a preferences data structure;

sharing, by the peer-to-peer file sharing client data processing system, a first file in a first swarm, wherein the first swarm is a foreground swarm;

identifying, by the peer-to-peer file sharing client data processing system, a given peer data processing system in the first swarm;

determining, by the peer-to-peer file sharing client data processing system, that the given peer data processing system is participating in a second swarm in which the peer-to-peer file sharing client data processing system is not participating, wherein the second swarm is sharing a second file;

growing the second swarm by requesting, by the peer-to-peer file sharing client data processing system, at least one file fragment for the second file from the second swarm, wherein the second swarm becomes a background swarm for background file sharing such that the at least one file fragment becomes available to be distributed from the peer-to-peer file sharing client data processing system to peer data processing systems in the second swarm;

receiving, by the peer-to-peer file sharing client data processing system, the at least one file fragment from the second swarm using at least a portion of the specified amount of bandwidth;

storing the at least one file fragment in at least a portion of the specified amount of storage space; and

uploading, by the peer-to-peer file sharing client data processing system, the at least one file fragment to peer data processing systems in the second swarm using at least a portion of the specified amount of bandwidth and at least a portion of the amount of storage space,

wherein the at least one file fragment is part of a file that is not being downloaded in the foreground.

2. The method of claim 1, further comprising:

deleting a given file fragment of the at least one file fragment from the amount of storage space based on an expiration parameter.

3. The method of claim 2, wherein the expiration parameter is specified in the preferences data structure.

4. The method of claim 1, wherein the amount of storage space is partitioned to a defined storage space from which files cannot be executed.

5. The method of claim 1, wherein a user of the peer-to-peer file sharing client data processing system is a member of a community and wherein the background swarm is selected based on swarm peers being members of the community.

6. The method of claim 1, wherein the at least one file fragment is selected based on a rarity value of the file fragment.

7. A peer-to-peer file sharing client for background file sharing in a peer-to-peer file sharing network, the peer-to-peer file sharing client comprising:

a processor; and

a memory coupled to the processor, wherein the memory contains instructions which, when executed by the processor, cause the processor to;

allocate background resources in the peer-to-peer file sharing client data processing system for background file sharing comprising a specified amount of bandwidth and a specified amount of storage space to be used for background file sharing, wherein the amount of bandwidth and the amount of storage space to be used for background file sharing are specified in a preferences data structure;

share a first file in a first swarm, wherein the first swarm is a foreground swarm;

identify a given peer in the first swarm;

determine that the given peer is participating in a second swarm in which the peer-to-peer file sharing client is not participating, wherein the second swarm is sharing a second file;

grow the second swarm by requesting at least one file fragment for the second file from the second swarm, wherein the second swarm becomes a background swarm for background file sharing such that the at least one file fragment becomes available to be distributed from the peer-to-peer file sharing client to peers in the second swarm;

receive the at least one file fragment from the second swarm using at least a portion of the specified amount of bandwidth;

store the at least one file fragment in at least a portion of the specified amount of storage space; and

upload the at least one file fragment to peers in the second swarm using at least a portion of the specified amount of bandwidth,

wherein the at least one file fragment is part of a file that is not being downloaded in the foreground.

8. The peer-to-peer file sharing client of claim 7, wherein the memory contains instructions which, when executed by the processor, further cause the processor to:

delete a given file fragment of the at least one file fragment from the amount of storage space based on an expiration parameter.

9. The peer-to-peer file sharing client of claim 8, wherein the expiration parameter is specified in the preferences data structure.

10. The peer-to-peer file sharing client of claim 7, wherein the amount of storage space is partitioned to a defined storage space from which files cannot be executed.

11. The peer-to-peer file sharing client of claim 7, wherein a user of the peer-to-peer file sharing client is a member of a community and wherein the background swarm is selected based on swarm peers being members of the community.

12. The peer-to-peer file sharing client of claim 7, wherein the at least one file fragment is selected based on a rarity value of the file fragment.

13. A computer program product comprising a computer storage medium having a computer readable program stored thereon, wherein the computer readable program, when executed on a peer-to-peer file sharing client computing device, causes the peer-to-peer file sharing client computing device to:

allocate background resources in the peer-to-peer file sharing client data processing system for background file sharing comprising a specified amount of bandwidth and a specified amount of storage space to be used for background file sharing, wherein the amount of bandwidth and the amount of storage space to be used for background file sharing are specified in a preferences data structure;

share a first file in a first swarm, wherein the first swarm is a foreground swarm;

identify a given peer in the first swarm;

determine that the given peer is participating in a second swarm in which the peer-to-peer file sharing client computing device is not participating, wherein the second swarm is sharing a second file;

grow the second swarm by requesting at least one file fragment for the second file from the second swarm, wherein the second swarm becomes a background swarm for background file sharing such that the at least one file fragment becomes available to be distributed from the peer-to-peer file sharing client computing device to peers in the second swarm;

receive the at least one file fragment from the second swarm using at least a portion of the specified amount of bandwidth;

store the at least one file fragment in at least a portion of the specified amount of storage space; and

upload the at least one file fragment to peers in the second swarm using at least a portion of the specified amount of bandwidth,

wherein the at least one file fragment is part of a file that is not being downloaded in the foreground.

14. The computer program product of claim 13, wherein the computer readable program, when executed on the peer-to-peer file sharing Client computing device, further causes the peer-to-peer file sharing client computing device to:

delete a given file fragment of the at least one file fragment from the amount of storage space based on an expiration parameter.

15. The computer program product of claim 14, wherein the expiration parameter is specified in the preferences data structure.

16. The computer program product of claim 13, wherein the amount of storage space is partitioned to a defined storage space from which files cannot be executed.

17. The computer program product of claim 13, wherein the at least one file fragment is selected based on a rarity value of the file fragment.

18. A communications system, comprising:

a memory configured to store a computer readable program; and

a transmitter configured to transmit the computer readable program, wherein the computer readable program, when received by and executed on a peer-to-peer file sharing client computing device, causes the peer-to-peer file sharing client computing device to;

allocate background resources in the peer-to-peer file sharing client data processing system for background file sharing comprising a specified amount of bandwidth and a specified amount of storage space to be used for background file sharing, wherein the amount of bandwidth and the amount of storage space to be used for background file sharing are specified in a preferences data structure;

share a first file in a first swarm, wherein the first swarm is a foreground swarm;

identify a given peer in the first swarm;

determine that the given peer is participating in a second swarm sharing a in which the peer-to-peer file sharing client computing device is not participating, wherein the second swarm is sharing a second file;

grow the second swarm by requesting at least one file fragment for the second file from the second swarm, wherein the second swarm becomes a background swarm for background file sharing such that the at least one file fragment becomes available to be distributed from the peer-to-peer file sharing client computing device to peers in the second swarm;

receive the at least one file fragment from the second swarm using at least a portion of the specified amount of bandwidth;

store the at least one file fragment in at least a portion of the specified amount of storage space; and

upload the at least one file fragment to peers in the second swarm using at least a portion of the specified amount of bandwidth,

wherein the at least one file fragment is part of a file that is not being downloaded in the foreground.

19. The communications system of claim 18, wherein the amount of storage space is partitioned to a defined storage space from which files cannot be executed.