FILE SAVING SYSTEM AND METHOD

• US 20140164487A1
• Filed: 10/29/2013
• Published: 06/12/2014
• Est. Priority Date: 12/12/2012
• Status: Abandoned Application

• Current Assignee: Hong Fu Jin Precision Industry (Shenzhen) Co., Ltd. (Hon Hai Precision Industry Co., Ltd.), Hon Hai Precision Industry Co., Ltd.
• Original Assignee: Hong Fu Jin Precision Industry (Shenzhen) Co., Ltd. (Hon Hai Precision Industry Co., Ltd.), Hon Hai Precision Industry Co., Ltd.
• Inventors: CHAI, ZHI-QUAN, LI, DA-PENG, LIN, HAI-HONG, LEE, CHUNG-I
• Application Number:
  US14/065,491
• Publication Number:
  US 20140164487A1
• Time in Patent Office: Days
• US Class Current: 709/203
• CPC Class Codes: H04L 67/06 specially adapted for file transfer, e.g. file transfer protocol [FTP]
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
• CPC Class Codes: H04L 67/5651 Reducing the amount or size of exchanged application data

Abstract

An assignment server receives two or more data blocks of the file from a client. The assignment server deletes repetitive data blocks from the client, and sets a storage space in a storage server for storing each data block from the client. The assignment server uploads each data block from the client into the storage space corresponding to the data block.

Claims

1. An assignment server in electronic communication with a client and a plurality of storage server, comprising:

at least one processor; and

a storage system that stores one or more programs, when executed by the at least one processor, cause the at least one processor to perform a file saving method, the method comprising;

receiving a hash list corresponding to a file from the client, and saving the hash list corresponding to the file into the database connected to the assignment server, wherein the hash list comprises a hash value of each data block of the file, and a name of each data block;

calculating a transfer process usage ratio of each storage server and a remaining storage capacity of each storage server;

determining an available storage server according to the transfer process usage ratio of the storage server and the remaining storage capacity of each storage server;

searching for repetitive data blocks according to the hash value of each data block and keeping one repetitive data block by deleting other repetitive data blocks from the client;

assigning a storage space for storing each data block in the available storage server and obtaining a pointer corresponding to the data block that points to the storage space; and

uploading each data block from the client into the storage space corresponding to the data block according to the pointer corresponding to the data block, and sending sends the pointer of each data block to the client.

2. The assignment server of claim 1, wherein a method of dividing the file by the client comprises:

the client divides each file into two or more data blocks;

the client calculates the hash value of each data block; and

the client saves the hash value of each data block into the hash list.

3. The assignment server of claim 1, wherein the name of each data block is generated in an alphabetical order or in a numerical order.

4. The assignment server of claim 1, wherein a storage server is determined as the available storage server, upon the condition that the transfer process usage ratio of the storage server is less or equal to a predetermined percentage and the storage server is available to store two or more data blocks.

5. The assignment server of claim 1, wherein a data block is determined as a repetitive data block upon the condition that the hash value of the data block is the same as the hash values of other data blocks.

6. The assignment server of claim 1, wherein a method of saving the file into the available storage sever comprises:

the available storage sever calculates the hash value of each data block uploaded from the assignment server;

the available storage sever determines whether the hash value of each data block exists in the hash list;

the available storage sever saves each data block into the storage space corresponding to the data block according to the pointer corresponding to the data block, when the hash value of each data block exists in the hash list; and

the available storage sever notifies the client to upload the file again when one hash value of the data block does not exists in the hash list.

7. The assignment server of claim 1, wherein a method of downloading the file from the available storage server comprises:

the client obtains the hash value of each data block of the file from the hash list stored in the database;

the client downloads each data block of the file according to the pointer of each data block from the available storage server;

the client calculates a hash value of each downloaded data block, and determines if the hash value of each downloaded data block exists in the hash list stored in the database;

the client saves all downloaded data blocks into a temporary storage space of the client when the hash value of each downloaded data block exists in the hash list stored in the database;

the client combines all downloaded data blocks to generate the file in the temporary storage space of the client according to the name of each downloaded data block;

the client calculates the hash value of the generated file and determines if the calculated hash value of the generated file exists in the hash list stored in the database.

8. A file saving method implemented by an assignment server, the assignment server in electronic communication with a client and a plurality of storage servers, the method comprising:

receiving a hash list corresponding to a file from the client, and saving the hash list corresponding to the file into the database connected to the assignment server, wherein the hash list comprises a hash value of each data block of the file, and a name of each data block;

calculating a transfer process usage ratio of each storage server and a remaining storage capacity of each storage server;

determining an available storage server according to the transfer process usage ratio of the storage server and the remaining storage capacity of each storage server;

searching for repetitive data blocks according to the hash value of each data block and keeping one repetitive data block by deleting other repetitive data blocks from the client;

assigning a storage space for storing each data block in the available storage server and obtaining a pointer corresponding to the data block that points to the storage space; and

uploading each data block from the client into the storage space corresponding to the data block according to the pointer corresponding to the data block, and sending sends the pointer of each data block to the client.

9. The method of claim 8, wherein a method of dividing the file by the client comprises:

the client divides each file into two or more data blocks;

the client calculates the hash value of each data block; and

the client saves the hash value of each data block into the hash list.

10. The method of claim 8, wherein the name of each data block is generated in an alphabetical order or in a numerical order.

11. The method of claim 8, wherein a storage server is determined as the available storage server, upon the condition that the transfer process usage ratio of the storage server is less or equal to a predetermined percentage and the storage server is available to store two or more data blocks.

12. The method of claim 8, wherein a data block is determined as the repetitive data block upon the condition that the hash value of the data block is the same as the hash values of other data blocks.

13. The method of claim 8, wherein a method of saving the file into the available storage sever comprises:

the available storage sever calculates the hash value of each data block uploaded from the assignment server;

the available storage sever determines whether the hash value of each data block exists in the hash list;

the available storage sever saves each data block into the storage space corresponding to the data block according to the pointer corresponding to the data block, when the hash value of each data block exists in the hash list; and

the available storage sever notifies the client to upload the file again when one hash value of the data block does not exists in the hash list.

14. The method of claim 8, wherein a method of downloading the file from the available storage server comprises:

the client obtains the hash value of each data block of the file from the hash list stored in the database;

the client downloads each data block of the file according to the pointer of each data block from the available storage server;

the client calculates a hash value of each downloaded data block, and determines if the hash value of each downloaded data block exists in the hash list stored in the database;

the client saves all downloaded data blocks into a temporary storage space of the client when the hash value of each downloaded data block exists in the hash list stored in the database;

the client combines all downloaded data blocks to generate the file in the temporary storage space of the client according to the name of each downloaded data block;

the client calculates the hash value of the generated file and determines if the calculated hash value of the generated file exists in the hash list stored in the database.

15. A non-transitory computer-readable medium having stored thereon instructions that, when executed by an assignment server, the assignment server in electronic communication with a client and a plurality of storage servers, causing the assignment server to perform a file saving method, the method comprising:

receiving a hash list corresponding to a file from the client, and saving the hash list corresponding to the file into the database connected to the assignment server, wherein the hash list comprises a hash value of each data block of the file, and a name of each data block;

calculating a transfer process usage ratio of each storage server and a remaining storage capacity of each storage server;

determining an available storage server according to the transfer process usage ratio of the storage server and the remaining storage capacity of each storage server;

searching for repetitive data blocks according to the hash value of each data block and keeping one repetitive data block by deleting other repetitive data blocks from the client;

assigning a storage space for storing each data block in the available storage server and obtaining a pointer corresponding to the data block that points to the storage space; and

uploading each data block from the client into the storage space corresponding to the data block according to the pointer corresponding to the data block, and sending sends the pointer of each data block to the client.

16. The non-transitory computer-readable medium of claim 15, wherein a method of dividing the file by the client comprises:

dividing each file into two or more data blocks;

calculating the hash value of each data block; and

saving the hash value of each data block into the hash list.

17. The non-transitory computer-readable medium of claim 15, wherein a storage server is determined as the available storage server, upon the condition that the transfer process usage ratio of the storage server is less or equal to a predetermined percentage and the storage server is available to store two or more data blocks.

18. The non-transitory computer-readable medium of claim 15, wherein a data block is determined as the repetitive data block upon the condition that the hash value of the data block is the same as the hash values of other data blocks.

19. The non-transitory computer-readable medium of claim 15, wherein a method of saving the file into the available storage sever comprises:

the available storage sever calculates the hash value of each data block uploaded from the assignment server;

the available storage sever determines whether the hash value of each data block exists in the hash list;

the available storage sever saves each data block into the storage space corresponding to the data block according to the pointer corresponding to the data block, when the hash value of each data block exists in the hash list; and

the available storage sever notifies the client to upload the file again when one hash value of the data block does not exists in the hash list.

20. The non-transitory computer-readable medium of claim 15, wherein a method of downloading the file from the available storage server comprises:

the client obtains the hash value of each data block of the file from the hash list stored in the database;

the client downloads each data block of the file according to the pointer of each data block from the available storage server;

the client calculates a hash value of each downloaded data block, and determines if the hash value of each downloaded data block exists in the hash list stored in the database;

the client saves all downloaded data blocks into a temporary storage space of the client when the hash value of each downloaded data block exists in the hash list stored in the database;

the client combines all downloaded data blocks to generate the file in the temporary storage space of the client according to the name of each downloaded data block;

the client calculates the hash value of the generated file and determines if the calculated hash value of the generated file exists in the hash list stored in the database.