# US 2021/0279210 A1 · Devices, System and Methods for Deduplication

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0279210 A1
- Document ID: US20210279210A1
- Status: Published application
- Kind: A1
- Application number: 17/326,890
- Filed: 2021-05-21
- Published: 2021-09-09
- Earliest claimed: 2019-07-23
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Yaron Mor; Aviv Kuvent; Asaf Yeger
- Web page: https://patentgrep.com/patent/US20210279210A1

## CPC

- G06F 3/0611: {in relation to response time}
- G06F 16/1752: {based on file chunks}
- G06F 3/0641: {De-duplication techniques}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 16/152: {using file content signatures, e.g. hash values}
- G06F 16/185: Hierarchical storage management [HSM] systems, e.g. file migration or policies thereof (details of archiving G06F16/11)
- H04L 67/1001: for accessing one among a plurality of replicated servers
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method for deduplicating at a global server for multiple storage servers includes receiving, from a storage server, a request to store a data chunk, determining whether the data chunk is highly-duplicated among the storage servers, accepting the request when the data chunk is highly-duplicated, and rejecting the request when the data chunk is not highly-duplicated.

## Claims

### Claim 1

A global server for deduplicating a plurality of storage servers, wherein the global server comprises:
an interface; and
a processor coupled to the interface and configured to:
receive, using the interface from a first storage server in the storage servers, a first request to store a data chunk;
determine whether the data chunk is highly duplicated among the storage servers;
accept the first request when the data chunk is highly duplicated; and
reject the first request when the data chunk is not highly duplicated.

### Claim 2 (depends on 1)

The global server of claim 1, wherein the processor is further configured to determine that the data chunk is highly duplicated among the storage servers when a water mark associated with a hash value of the data chunk is equal to or higher than a first value.

### Claim 3 (depends on 2)

The global server of claim 2, wherein the first request comprises the hash value.

### Claim 4 (depends on 3)

The global server of claim 3, wherein the processor is further configured to:
increase, upon receiving the first request, the water mark; and
register the first storage server for the hash value.

### Claim 5 (depends on 4)

The global server of claim 4, wherein the processor is further configured to:
instruct the first storage server to send the data chunk to the global server when the water mark is equal to the first value; and
store the first data chunk.

### Claim 6 (depends on 5)

The global server of claim 5, wherein the processor is further configured to notify the first storage server that the data chunk has been stored.

### Claim 7 (depends on 2)

The global server of claim 2, wherein the processor is further configured to:
receive, using the interface from the first storage server, a second request to remove the data chunk;
decrease, upon receiving the second request, the water mark; and
unregister the first storage server for the hash value.

### Claim 8 (depends on 2)

The global server of claim 2, wherein the processor is further configured to:
instruct each storage server registered for the hash value to copy the data chunk from the global server when the water mark is equal to or below a second value; and
remove the data chunk from the global server after all storage servers registered for the hash value store the data chunk locally.

### Claim 9 (depends on 8)

The global server of the claim 8, wherein the first value is higher than the second value.

### Claim 10 (depends on 8)

The global server of claim 8, wherein the processor is further configured to dynamically adjust, based on free storage space left in the global server, the first value or the second value.

### Claim 11

A method implemented by a global server for deduplicating a plurality of storage servers, wherein the method comprises:
receiving, from a first storage server of the storage servers, a first request to store a data chunk; and
sending, to the first storage server, information indicating that the global server has accepted the first request or has rejected the first request.

### Claim 12 (depends on 11)

The method of claim 11, further comprising determining that the data chunk is highly duplicated among the storage servers when a water mark associated with a hash value of the data chunk is equal to or higher than a first value.

### Claim 13 (depends on 12)

The method of claim 12, wherein the first request comprises the hash value.

### Claim 14 (depends on 13)

The method of claim 13, further comprising:
increasing, upon receiving the first request, the water mark; and
registering the first storage server for the hash value.

### Claim 15 (depends on 14)

The method of claim 14, further comprising:
instructing the first storage server to send the data chunk to the global server when the water mark is equal to the first value; and
storing the data chunk.

### Claim 16 (depends on 15)

The method of claim 15, further comprising notifying the first storage server that the data chunk has been stored.

### Claim 17 (depends on 12)

The method of claim 12, further comprising:
receiving, from the first storage server, a second request to remove the data chunk;
decreasing, upon receiving the second request, the water mark; and
unregistering the first storage server for the hash value.

### Claim 18 (depends on 12)

The method of claim 12, further comprising:
instructing each storage server registered for the hash value to copy the data chunk from the global server when the water mark is equal to or below a second value; and
removing the data chunk from the global server after all storage servers registered for the hash value store the data chunk locally.

### Claim 19 (depends on 18)

The method of claim 18, wherein the first value is higher than the second value.

### Claim 20 (depends on 18)

The method of claim 18, further comprising dynamically adjusting, based on free storage space left in the global server, the first value or the second value.
