公开(公告)号：US20190245794A1

公开(公告)日：2019-08-08

申请号：US16389155

申请日：2019-04-19

Applicant: NetApp Inc.

Inventor： Dean Alan Kalman ,  John Alexander Scott ,  Sudha Sundaram

IPC: H04L12/851 ,  G06F3/06 ,  H04L12/26 ,  H04L12/24 ,  H04L29/08

CPC classification number: H04L47/24 ,  G06F3/061 ,  G06F3/0635 ,  G06F3/0659 ,  G06F3/067 ,  H04L41/0893 ,  H04L43/0888 ,  H04L67/1097

Abstract: Methods and systems for a networked storage system are provided. One method includes assigning a quality of service (QOS) parameter for a storage volume of a networked storage environment having a first storage node and a second storage node, where the QOS parameter is defined by a throughput value that defines a maximum data transfer rate and a number of input/output (I/O) operations executed within a time period (IOPS); distributing the QOS parameter between the first storage node and the second storage node; determining that throughput credit is available for processing an I/O request for using the storage volume; determining that IOPS credit is available for processing the request by the first storage node; and processing the I/O request when both the throughput credit and the IOPS credit is available.

公开(公告)号：US10365838B2

公开(公告)日：2019-07-30

申请号：US15820004

申请日：2017-11-21

Applicant: NetApp, Inc.

Inventor： Janice D'Sa ,  Ling Zheng ,  Blake H. Lewis

IPC: G06F3/06 ,  H04L29/08

Abstract: A N-way merge technique efficiently updates metadata in accordance with a N-way merge operation managed by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The metadata is embodied as mappings from logical block addresses (LBAs) of a logical unit (LUN) accessible by a host to durable extent keys, and is organized as a multi-level dense tree. The mappings are organized such that a higher level of the dense tree contains more recent mappings than a next lower level, i.e., the level immediately below. The N-way merge operation is an efficient (i.e., optimized) way of updating the volume metadata mappings of the dense tree by merging the mapping content of all three levels in a single iteration, as opposed to merging the content of the first level with the content of the second level in a first iteration of a two-way merge operation and then merging the results of the first iteration with the content of the third level in a second iteration of the operation.

公开(公告)号：US10360237B2

公开(公告)日：2019-07-23

申请号：US15820979

申请日：2017-11-22

Applicant: NetApp Inc.

Inventor： Vijay M. Deshmukh ,  Pranab Patnaik ,  Uday Madhav Joshi ,  Kiyoshi James Komatsu

IPC: G06F3/06 ,  G06F16/27 ,  G06F21/60 ,  G06F21/62 ,  H04L29/06 ,  H04L29/08

Abstract: One or more techniques and/or computing devices are provided for secure data replication. For example, a first storage controller may host first storage within which storage resources (e.g., files, logical unit numbers (LUNs), volumes, etc.) are stored. The first storage controller may establish an access policy with a001 second storage controller to which data is to be replicated from the first storage. The access policy may define an authentication mechanism for the first storage controller to authenticate the second storage controller, an authorization mechanism specifying a type of access that the second storage controller has for a storage resource, and an access control mechanism specifying how the second storage controller's access to data of the storage resource is to be controlled. In this way, data replication requests may be authenticated and authorized so that data may be provided, according to the access control mechanism, in a secure manner.

公开(公告)号：US10360119B2

公开(公告)日：2019-07-23

申请号：US14876063

申请日：2015-10-06

Applicant: NetApp, Inc.

Inventor： Martin Jess ,  Joseph Moore ,  Ziling Huang

IPC: G06F11/10 ,  G06F11/20

Abstract: A system, method, and machine-readable storage medium for recovering data in a distributed storage system are provided. In some embodiments, the method includes identifying a failing storage device of a first storage node having an inaccessible data segment. When it is determined that the inaccessible data segment cannot be recovered using a first data protection scheme, a first chunk of data associated with the inaccessible data segment is identified and a group associated with the first chunk of data is identified. A second chunk of data associated with the group is selectively retrieved from a second storage node such that data associated with an accessible data segment of the first storage node is not retrieved. The inaccessible data segment is recovered by recovering the first chunk of data using a second data protection scheme and the second chunk of data.

公开(公告)号：US20190220195A1

公开(公告)日：2019-07-18

申请号：US16359088

申请日：2019-03-20

Applicant: NETAPP, INC.

Inventor： Jayalakshmi Pattabiraman ,  Nikhil Mattankot ,  Deekshith Belchapada ,  Blake H. Lewis ,  Subramaniam Periyagaram ,  Satya Suresh Chouta Naga Veera ,  Rohit Singh ,  Rajesh Khandelwal ,  James Robert Morefield

IPC: G06F3/06 ,  G06F12/02 ,  G06F7/06

CPC classification number: G06F3/064 ,  G06F3/0613 ,  G06F3/0616 ,  G06F3/0683 ,  G06F7/06 ,  G06F12/02 ,  G06F12/023 ,  G06F2212/1016

Abstract: A first plurality of block identifiers is sorted based, at least in part, on a measure of spatial locality. A second plurality of block identifiers is sorted based, at least in part, on the measure of spatial locality. At least the first plurality of block identifiers and the second plurality of block identifiers are incrementally merged into a third plurality of block identifiers based, at least in part, on the measure of spatial locality. A block of data corresponding to metadata associated with a plurality of block identifiers of the third plurality of block identifiers is updated.

公开(公告)号：US10353740B2

公开(公告)日：2019-07-16

申请号：US15589909

申请日：2017-05-08

Applicant: NetApp, Inc.

Inventor： Emalayan Vairavanathan ,  Dheeraj Raghavender Sangamkar ,  Song Guen Yoon ,  Yi Zhang

IPC: G06F9/50 ,  G06F11/20 ,  G06F11/10 ,  G06F3/06 ,  H04L29/08 ,  H04L29/14

Abstract: To efficiently recover from a multiple storage node failure, a storage node concurrently restores data fragments to the multiple failed storage nodes, as opposed to restoring each node individually. In the VCS based storage technique, storage nodes are restored as part of an ECG repair process. For each ECG being repaired, a storage node performing the restoration process reads data fragments from active nodes in the ECG and generates new data fragments to replace any lost data fragments. The node then stores one of the new data fragments across each of the failed storage nodes. By concurrently restoring data fragments to each failed storage node, the data fragments needed to repair each ECG are only read once, thereby preserving disk operations and network bandwidth.

公开(公告)号：US10353642B2

公开(公告)日：2019-07-16

申请号：US15583946

申请日：2017-05-01

Applicant: NetApp, Inc.

Inventor： Ratnesh Gupta

IPC: G06F11/00 ,  G06F3/06 ,  G06F11/10

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for selectively limiting the amount of data in a file system, which include: determining a reparity bit value for a write disk block range, wherein the reparity bit is configured to track a number of writes in progress to a stripe range; determining the reparity bit value; updating a threshold written disk block number as a highest disk block number of the reparity bit value; and initiating a RAID operation until it reaches the threshold written disk block number, wherein the threshold written disk block number comprises a maximum written disk block number representing the last disk block number written.

公开(公告)号：US10348562B2

公开(公告)日：2019-07-09

申请号：US14992249

申请日：2016-01-11

Applicant: NETAPP, INC.

Inventor： Karthick Radhakrishnan ,  Jacob Abraham ,  Krithi BG ,  Nirdosh Kumar Chouhan

IPC: H04L12/24 ,  H04L29/08

Abstract: Methods and systems for a networked storage environment are provided. One method includes storing at a storage device by a processor a data structure with information regarding a plurality of compatible software and hardware components configured to operate in a plurality of configurations as part of a storage solution for using resources at a networked storage environment for storing data; obtaining by a processor executable configuration advisor information regarding a plurality of deployed components of a deployed configuration from among the plurality of configurations; comparing the deployed configuration with a latest configuration having the plurality of deployed components from among the plurality of configurations stored at the data structure; and recommending a change in at least one of the plurality of deployed components to upgrade the deployed configuration, when the deployed configuration is not the latest configuration.

公开(公告)号：US10346354B2

公开(公告)日：2019-07-09

申请号：US15338272

申请日：2016-10-28

Applicant: NetApp, Inc.

Inventor： Ajay Pratap Singh Kushwah ,  Ling Zheng ,  Sharad Jain

IPC: G06F16/11 ,  G06F16/13 ,  H04L29/08 ,  G06F12/121 ,  G06F11/14

Abstract: With a forever incremental snapshot configuration and a typical caching policy (e.g., least recently used), a storage appliance may evict stable data blocks of an older snapshot, perhaps unchanged data blocks of the snapshot baseline. If stable data blocks have been evicted, restore of a recent snapshot will suffer the time penalty of downloading the stable blocks for restoring the recent snapshot. Creating synthetic baseline snapshots and refreshing eviction data of stable data blocks can avoid eviction of stable data blocks and reduce the risk of violating a recovery time objective.

公开(公告)号：US10346254B2

公开(公告)日：2019-07-09

申请号：US15722114

申请日：2017-10-02

Applicant: NetApp Inc.

Inventor： Stephen Wu ,  Prathamesh Deshpande ,  Manan Patel

IPC: G06F12/00 ,  G06F11/14 ,  G06F3/06 ,  G06F11/07

Abstract: An application may store data to a dataset comprising a plurality of volumes stored on a plurality of storage systems. The application may request a dataset image of the dataset, the dataset image comprising a volume image of each volume of the dataset. A dataset image manager operates with a plurality of volume image managers in parallel to produce the dataset image, each volume image manager executing on a storage system. The plurality of volume image managers respond by performing requested operations and sending responses to the dataset image manager in parallel. Each volume image manager on a storage system may manage and produce a volume image for each volume of the dataset stored to the storage system. If a volume image for any volume of the dataset fails, or a timeout period expires, a cleanup procedure is performed to delete any successful volume images.