Moving File Fragments from Background File Sharing to Foreground File Sharing and Preventing Duplicate Downloads

• US 20080133666A1
• Filed: 06/12/2007
• Published: 06/05/2008
• Est. Priority Date: 12/05/2006
• Status: Active Grant

• Current Assignee: Dropbox, Inc.
• Original Assignee: International Business Machines Corporation
• Inventors: Seacat, Lisa A., Lauridsen, Christina K., Peterson, Robert R., Patel, Sushma B., Chavez, Timothy R., Salem, Loulwa F.
• Granted Patent: US 7,617,178 B2
• Time in Patent Office: Days
• US Class Current: 709/205
• 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
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing

Abstract

In accordance with one illustrative embodiment, when a file is moved from the background to the foreground in a peer-to-peer client, the client makes a local request for file pieces. The client sends a handshake message to itself to check for available pieces. The client then exchanges messages locally the same way it would with external peers. As an alternative approach to local message passing, the client may keep a local record of file fragments in a data structure, such as a markup language document or other data repository. The client may then query the data structure for needed file fragments before submitting a request to the peer-to-peer network. Every time a new file segment is downloaded and validated in the background, or the foreground, the peer-to-peer client may update the data structure. Then, the client may simply query the data structure for the specific segment it wishes to download.

Claims

1. A method in a peer-to-peer file sharing client for moving a file from background file sharing to foreground file sharing and preventing duplicate downloads in a peer-to-peer file sharing network, the method comprising:

receiving at least one file fragment of a file from a background swarm for background file sharing;

responsive to a request to move the file from background file sharing to foreground file sharing, identifying the at least one file fragment stored locally; and

requesting at least one remaining file fragment from the background swarm, wherein the background swarm becomes a foreground swarm.

2. The method of claim 1, wherein identifying the at least one file fragment stored locally comprises:

initiating a local request for file fragments;

sending a handshake message to self to check for available file fragments; and

exchanging messages to self to request and respond for the at least one file fragment stored locally.

3. The method of claim 1, further comprising:

responsive to receiving a given file fragment of the file from the background swarm, storing an identification of the given file fragment in a data structure.

4. The method of claim 3, wherein identifying the at least one file fragment stored locally comprises:

examining the data structure for file fragments identified as being stored locally.

5. The method of claim 3, wherein the data structure is a markup language document.

6. The method of claim 1, wherein requesting at least one remaining file fragment from the background swarm comprises sending a request to a tracker for a peer list.

7. The method of claim 6, wherein requesting at least one remaining file fragment from the background swarm further comprises exchanging messages with peers to request, respond, and exchange data for the at least one remaining file fragment.

8. A peer-to-peer file sharing client for moving a file from background file sharing to foreground file sharing and preventing duplicate downloads in a peer-to-peer file sharing network, the peer-to-peer file sharing client comprising:

a processor; and

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

receive at least one file fragment of a file from a background swarm for background file sharing;

responsive to a request to move the file from background file sharing to foreground file sharing, identify the at least one file fragment stored locally;

and

request at least one remaining file fragment from the background swarm, wherein the background swarm becomes a foreground swarm.

9. The peer-to-peer file sharing client of claim 8, wherein identifying the at least one file fragment stored locally comprises:

initiating a local request for file fragments;

sending a handshake message to self to check for available file fragments; and

exchanging messages to self to request and respond for the at least one file fragment stored locally.

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

responsive to receiving a given file fragment of the file from the background swarm, store an identification of the given file fragment in a data structure.

11. The peer-to-peer file sharing client of claim 10, wherein identifying the at least one file fragment stored locally comprises:

examining the data structure for file fragments identified as being stored locally.

12. The peer-to-peer file sharing client of claim 10, wherein the data structure is a markup language document.

13. The peer-to-peer file sharing client of claim 8, wherein requesting at least one remaining file fragment from the background swarm comprises sending a request to a tracker for a peer list.

14. The peer-to-peer file sharing client of claim 13, wherein requesting at least one remaining file fragment from the background swarm further comprises exchanging messages with peers to request, respond, and exchange data for the at least one remaining file fragment.

15. A computer program product comprising a computer useable medium having a computer readable program, wherein the computer readable program, when executed on a computing device, causes the computing device to:

receive at least one file fragment of a file from a background swarm for background file sharing;

responsive to a request to move the file from background file sharing to foreground file sharing, identify the at least one file fragment stored locally; and

request at least one remaining file fragment from the background swarm, wherein the background swarm becomes a foreground swarm.

16. The computer program product of claim 15, wherein identifying the at least one file fragment stored locally comprises:

initiating a local request for file fragments;

sending a handshake message to self to check for available file fragments; and

exchanging messages to self to request and respond for the at least one file fragment stored locally.

17. The computer program product of claim 15, wherein the computer readable program, when executed on the computing device, further causes the computing device to:

responsive to receiving a given file fragment of the file from the background swarm, store an identification of the given file fragment in a data structure.

18. The computer program product of claim 17, wherein identifying the at least one file fragment stored locally comprises:

examining the data structure for file fragments identified as being stored locally.

19. The computer program product of claim 15, wherein requesting at least one remaining file fragment from the background swarm comprises sending a request to a tracker for a peer list.

20. The computer program product of claim 19, wherein requesting at least one remaining file fragment from the background swarm further comprises exchanging messages with peers to request, respond, and exchange data for the at least one remaining file fragment.