# US 2021/0334182 A1 · Network storage failover systems and associated methods

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

- Number: US 2021/0334182 A1
- Document ID: US20210334182A1
- Status: Published application
- Kind: A1
- Application number: 16/855,853
- Filed: 2020-04-22
- Published: 2021-10-28
- Earliest claimed: 2020-04-22
- Assignees: NetApp, Inc.
- Applicants: Netapp, Inc.
- Inventors: Szu-Wen Kuo; Parag Sarfare; Ananthan Subramanian; Asif Imtiyaz Pathan; Santhosh Selvaraj; Nikhil Mattankot
- Web page: https://patentgrep.com/patent/US20210334182A1

## CPC

- G06F 11/2094: {Redundant storage or storage space (G06F11/2056 takes precedence)}
- G06F 11/0751: {Error or fault detection not based on redundancy (power supply failures G06F1/30; network fault management H04L41/06)}
- G06F 11/2023: {Failover techniques}
- G06F 11/2064: {while ensuring consistency}
- G06F 11/2069: {Management of state, configuration or failover}
- G06F 11/2074: {Asynchronous techniques}
- G06F 11/2082: {Data synchronisation}
- G06F 11/2092: {Techniques of failing over between control units}
- H04L 41/0668: by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure
- H04L 49/901: using storage descriptor, e.g. read or write pointers
- 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]
- G06F 2201/82: Solving problems relating to consistency
- G06F 2201/855: Details of asynchronous mirroring using a journal to transfer not-yet-mirrored changes
- H04L 67/1095: Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
- 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

Failover methods and systems for a networked storage environment are provided. A metadata data structure is generated, before starting a replay of entries at a log stored in a non-volatile memory of a second storage node, during a failover operation initiated in response to a failure at a first storage node. The second storage node operates as a partner node of the first storage node, and the metadata structure stores a metadata attribute of each log entry. Furthermore, the metadata attribute of each log entry is persistently stored. The persistently stored metadata attribute is used to respond to a read request received during the replay by the second storage node, while a write request metadata attribute of a write request is used for executing the write request received by the second storage node during the replay.

## Claims

### Claim 1

A method, comprising:
generating by a processor of a second storage node, a metadata data structure before starting a replay of entries of a log stored in a non-volatile memory of the second storage node for a failover operation initiated in response to a failure at a first storage node, the second storage node operating as a partner node of the first storage node to mirror at the non-volatile memory, one or more write requests and data associated with the one or more write requests received by the first storage node prior to the failure, wherein the metadata structure stores a metadata attribute of each data container associated with each log entry;
persistently storing by the processor, prior to the replay, the metadata attribute from the metadata structure;
utilizing by the processor, the persistently stored metadata attribute to respond to a read request received during the replay by the second storage node;
extracting by the processor, a write request metadata attribute from a write request received by the second storage node during the replay; and
utilizing by the processor, the extracted metadata attribute for executing the write request.

### Claim 2 (depends on 1)

The method of claim 1, further comprising: skipping by the processor, an update to the persistently stored metadata attribute during the reply.

### Claim 3 (depends on 1)

The method of claim 1, wherein the metadata attribute is a modification time of a data container identified by a log entry.

### Claim 4 (depends on 1)

The method of claim 1, further comprising: processing by the processor, the read request when the read request does not have a corresponding entry in the log.

### Claim 5 (depends on 1)

The method of claim 1, further comprising: processing by the processor, the read request, when the read request has a corresponding entry in the log and data associated with the read request is accessible from the non-volatile memory.

### Claim 6 (depends on 1)

The method of claim 1, further comprising: processing by the processor, the write request, when the write request is the same write request received by the first storage node, prior to the failure.

### Claim 7 (depends on 1)

The method of claim 1, wherein the metadata attribute is a data container size of data containers associated with the entries of the log.

### Claim 8

A non-transitory machine readable medium having stored thereon instructions comprising machine executable code which when executed by a machine, causes the machine to:
generate a metadata data structure before starting a replay of entries of a log stored in a non-volatile memory of a second storage node for a failover operation, initiated in response to a failure at a first storage node, the second storage node operating as a partner node of the first storage node to mirror at the non-volatile memory, one or more write requests and data associated with the one or more write requests received by the first storage node prior to the failure, wherein the metadata structure stores a metadata attribute of each data container associated with each log entry;
persistently store, prior to the replay, the metadata attribute from the metadata structure;
utilize the persistently stored metadata attribute to respond to a read request received during the replay by the second storage node; and
utilize a write request metadata attribute for executing a write request received during the replay by the second storage node.

### Claim 9 (depends on 8)

The non-transitory machine readable medium of claim 8, wherein the machine executable code further causes the machine to: skip an update to the persistently stored metadata attribute during the replay.

### Claim 10 (depends on 8)

The non-transitory machine readable medium of claim 8, wherein the metadata attribute is a modification time of a data container identified by a log entry.

### Claim 11 (depends on 8)

The non-transitory machine readable medium of claim 8, wherein the machine executable code further causes the machine to: process the read request, when the read request does not have a corresponding entry in the log.

### Claim 12 (depends on 8)

The non-transitory machine readable medium of claim 8, wherein the machine executable code further causes the machine to: process the read request, when the read request has a corresponding entry in the log and data associated with the read request is accessible from the non-volatile memory

### Claim 13 (depends on 8)

The non-transitory machine readable medium of claim 8, wherein the machine executable code further causes the machine to: process the write request, when the write request is the same write request received by the first storage node, prior to the failure.

### Claim 14 (depends on 8)

The non-transitory machine readable medium of claim 8, wherein the metadata attribute is a data container size of data containers associated with the entries of the log.

### Claim 15

A system, comprising:
a memory containing machine readable medium comprising machine executable code having stored thereon instructions; and a processor coupled to the memory, the processor configured to execute the machine executable code to:
generate a metadata data structure before starting a replay of entries of a log stored in a non-volatile memory of a second storage node for a failover operation, initiated in response to a failure at a first storage node, the second storage node operating as a partner node of the first storage node to mirror at the non-volatile memory, one or more write requests and data associated with the one or more write requests received by the first storage node prior to the failure, wherein the metadata structure stores a metadata attribute of each data container associated with each log entry;
persistently store, prior to the replay, the metadata attribute from the metadata structure;
utilize the persistently stored metadata attribute to respond to a read request received during the replay by the second storage node; and
utilize a write request metadata attribute for executing a write request received during the replay by the second storage node.

### Claim 16 (depends on 15)

The system of claim 15, wherein the processor further causes the machine executable code to: skip an update to the persistently stored metadata attribute, during log replay.

### Claim 17 (depends on 15)

The system of claim 15, wherein the metadata attribute is a modification time of a data container identified by a log entry.

### Claim 18 (depends on 15)

The system of claim 15, wherein the processor further causes the machine executable code to: process the read request, when the read request does not have a corresponding entry in the log.

### Claim 19 (depends on 15)

The system of claim 15, wherein the processor further causes the machine executable code to: process the read request, when the read request has a corresponding entry in the log and data associated with the read request is accessible from the non-volatile memory.

### Claim 20 (depends on 15)

The system of claim 15, wherein the processor further causes the machine executable code to: process the write request, when the write request is the same write request received by the first storage node prior to the failure.
