公开(公告)号：WO2018081729A1

公开(公告)日：2018-05-03

申请号：PCT/US2017/059079

申请日：2017-10-30

Applicant: NETAPP, INC.

Inventor： KUSHWAH, Ajay Pratap, Singh ,  ZHENG, Ling ,  JAIN, Sharad

IPC: G06F11/14 ,  G06F17/30

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.

Abstract translation: 利用永久增量快照配置和典型的高速缓存策略（例如，最近最少使用），存储设备可以驱逐较旧快照的稳定数据块，可能是快照基线的未改变的数据块。 如果稳定的数据块已被逐出，则恢复最近的快照将承受下载用于恢复最近快照的稳定块的时间损失。 创建合成基线快照并刷新稳定数据块的逐出数据可以避免逐出稳定数据块并降低违反恢复时间目标的风险。

公开(公告)号：WO2016081166A1

公开(公告)日：2016-05-26

申请号：PCT/US2015/057532

申请日：2015-10-27

Applicant: NETAPP, INC.

Inventor： D'SA, Janice ,  ZHENG, Ling ,  LEWIS, Blake H.

IPC: G06F3/06

CPC classification number: G06F3/0619 ,  G06F3/0607 ,  G06F3/0626 ,  G06F3/0644 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0689 ,  H04L67/1097

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 N(e.g., 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.

Abstract translation: N路合并技术根据在集群的一个或多个节点上执行的存储输入/输出（I / O）栈的卷层管理的N路合并操作来有效地更新元数据。 元数据体现为从主机可访问的逻辑单元（LUN）的逻辑块地址（LBA）到持久扩展密钥的映射，并且被组织为多级密集树。 这些映射被组织成使得较高级别的密集树包含比下一个较低级别更近的映射，即紧接在下面的级别。 N路合并操作是通过在单次迭代中合并N（例如，三个）级别的映射内容来更新密集树的卷元数据映射的有效（即优化的）方式，而不是合并内容 在第一次迭代双向合并操作中具有第二级别的内容的第一级，然后在操作的第二次迭代中将第一次迭代的结果与第三级的内容合并。

公开(公告)号：WO2016040236A1

公开(公告)日：2016-03-17

申请号：PCT/US2015/048810

申请日：2015-09-08

Applicant: NETAPP, INC.

Inventor： D'SA, Janice ,  PUNDIR, Anshul ,  KRISHNAMACHARI, Srinath ,  ZHENG, Ling

IPC: G06F11/14

CPC classification number: G06F17/30156 ,  G06F11/1471 ,  G06F17/30327

Abstract: A low-overhead merge technique enables restart of a merge operation with minimal logging of state information relating to progress of the merge operation by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The technique enables restart of the merge operation by ensuring that metadata, i.e., metadata pages, generated during the merge operation is not subject to de-duplication by providing a unique value in each metadata page that distinguishes the page, i.e., renders the page distinct or "unique", from other metadata pages in an extent store. In addition, the technique ensures that a reference count on each metadata page is a value denoting a lack of de-duplication. To that end, the extent store layer is configured to not increment the reference count for a metadata page if, during the merge operation, the page is identical (and thus subject to deduplication) to an existing metadata page in the extent store.

Abstract translation: 低开销合并技术使得能够通过在集群的一个或多个节点上执行的存储输入/输出（I / O）堆栈的卷层的最小记录关于合并操作的进展的状态信息的记录来重新启动合并操作。 。 该技术通过确保在合并操作期间生成的元数据页面不受重复数据删除的影响，从而通过在每个元数据页面中提供唯一的值来区分页面，即，使页面不同 或“唯一”，从范围存储中的其他元数据页面。 此外，该技术确保每个元数据页面上的引用计数是表示缺少重复数据删除的值。 为此，如果在合并操作期间页面与扩展存储区中的现有元数据页面相同（并因此进行重复数据删除），则扩展区存储层被配置为不递增元数据页面的引用计数。

公开(公告)号：WO2013148143A1

公开(公告)日：2013-10-03

申请号：PCT/US2013/030279

申请日：2013-03-11

Applicant: NETAPP, INC. ,  DAGA, Vinod Kumar ,  JOHNSTON, Craig ,  ZHENG, Ling

Inventor： DAGA, Vinod Kumar ,  JOHNSTON, Craig ,  ZHENG, Ling

IPC: G06F11/00 ,  G06F12/00 ,  G06F13/00 ,  G06F21/00

CPC classification number: G06F17/30303 ,  G06F17/30079 ,  G06F17/3015 ,  G06F17/30156

Abstract: A method performed in a system that has a plurality of volumes stored to storage hardware, the method including generating, for each of the volumes, a respective space saving potential iteratively over time and scheduling space saving operations among the plurality of volumes by analyzing each of the volumes for space saving potential and assigning priority of resources based at least in part on space saving potential.

Abstract translation: 一种在具有存储到存储硬件的多个卷的系统中执行的方法，所述方法包括针对每个卷生成随时间迭代的相应的空间节省潜力，并且通过分析每个卷中的每个 节省空间的潜力，并至少部分依赖节省空间的潜力来分配资源的优先级。

公开(公告)号：WO2021263224A1

公开(公告)日：2021-12-30

申请号：PCT/US2021/039283

申请日：2021-06-27

Applicant: NETAPP, INC.

Inventor： ZHENG, Ling ,  PANDIT, Atul, Ramesh ,  GEORGE, Tijin ,  KURAMKOTE, Ravindra, Ramachandraiah

IPC: G06F11/14 ,  G06F3/06 ,  G06F16/18 ,  G06F11/1435 ,  G06F11/1451 ,  G06F11/1458 ,  G06F11/1461 ,  G06F11/1469 ,  G06F16/1756 ,  G06F2201/84

Abstract: Techniques are provided for incremental backup to an object store. A request may be received from an application to perform a backup from a volume hosted by a node to a backup target within the object store. A set of changed files within the volume since a prior backup of the volume was performed to the backup target is identified, along with metadata associated with the set of changed files. The metadata is utilized to identify changed data blocks comprising data of the set of changed files that was modified since the prior backup. The changed data blocks are backed up to the object store.

公开(公告)号：WO2017190130A1

公开(公告)日：2017-11-02

申请号：PCT/US2017/030381

申请日：2017-05-01

Applicant: NETAPP, INC.

Inventor： PANDIT, Atul, Ramesh ,  DESHMUKH, Vijay, M. ,  FEDERWISCH, Michael, Lee ,  ZHENG, Ling ,  KOMATSU, Kiyoshi, James ,  KOTHIYAL, Rachita

IPC: G06F11/20

Abstract: One or more techniques and/or computing devices are provided for cross- platform replication. For example, a replication relationship may be established between a first storage endpoint and a second storage endpoint, where at least one of the storage endpoints, such as the first storage endpoint, lacks or has incompatible functionality to perform and manage replication because the storage endpoints have different storage platforms that store data differently, use different control operations and interfaces, etc. Accordingly, replication destination workflow, replication source workflow, and/or a proxy representing the first storage endpoint may be implemented at the second storage endpoint comprising the replication functionality. In this way, replication, such as snapshot replication, may be implemented between the storage endpoints by the second storage endpoint using the replication destination workflow, the replication source workflow, and/or the proxy that either locally executes tasks or routes tasks to the first storage endpoint such as for data access.

Abstract translation: 为跨平台复制提供一个或多个技术和/或计算设备。 例如，可以在第一存储端点和第二存储端点之间建立复制关系，其中至少一个存储端点（例如第一存储端点）缺乏或具有不兼容的功能来执行和管理复制，因为存储端点 具有不同的存储数据的不同存储平台，使用不同的控制操作和接口等。因此，表示第一存储端点的复制目标工作流程，复制源工作流程和/或代理可以在包括复制功能的第二存储端点处实现 。 这样，第二存储端点可以使用复制目的地工作流，复制源工作流和/或代理在存储端点之间实现诸如快照复制之类的复制，所述复制目的地工作流，本地执行任务或将任务路由到第一 存储端点，如数据访问。

公开(公告)号：WO2015038741A1

公开(公告)日：2015-03-19

申请号：PCT/US2014/055138

申请日：2014-09-11

Applicant: NETAPP, INC.

Inventor： ZHENG, Ling ,  LEWIS, Blake H. ,  PATEL, Kayuri H.

IPC: G06F3/06

CPC classification number: G06F17/30327 ,  G06F3/0611 ,  G06F3/0619 ,  G06F3/0638 ,  G06F3/0641 ,  G06F3/0655 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0689 ,  G06F17/30 ,  G06F17/30292

Abstract: In one embodiment, a node coupled to one or more storage devices executes a storage input/output (I/O) stack having a volume layer. The volume layer manages volume metadata embodied as mappings from offsets of a logical unit (LUN) to extent keys associated with storage locations for extents on the one or more storage devices. Volume metadata is maintained as a dense tree metadata structure representing successive points in time. The dense tree metadata structure has multiple levels, wherein a top level of the dense tree metadata structure represents newer volume metadata changes and descending levels of the dense tree metadata structure represent older volume metadata changes. The node accesses a latest version of changes to the volume metadata by searching from the top level to the descending levels in the dense tree metadata structure.

Abstract translation: 在一个实施例中，耦合到一个或多个存储设备的节点执行具有体积层的存储输入/输出（I / O）堆栈。 卷层管理体现为从逻辑单元（LUN）的偏移到与一个或多个存储设备上的范围的存储位置相关联的扩展密钥的映射的卷元数据。 卷元数据被保持为表示连续时间点的密集树元数据结构。 密集树元数据结构具有多个层次，其中密集树元数据结构的顶层表示较新的卷元数据更改，密集树元数据结构的下降层表示较旧的卷元数据更改。 节点通过从密级树元数据结构中的顶层到下行级别进行搜索来访问对卷元数据的最新版本的更改。

公开(公告)号：WO2020263765A1

公开(公告)日：2020-12-30

申请号：PCT/US2020/039038

申请日：2020-06-23

Applicant: NETAPP, INC.

Inventor： MATHEW, Jose ,  ZHENG, Ling

IPC: G06F9/46 ,  G06F11/14

Abstract: Techniques are provided for orchestrating operations between a storage environment and a computing environment hosting virtual machines. A virtual machine proxy, associated with a computing environment hosting a virtual machine, is accessed by an orchestrator to identify the virtual machine and properties of the virtual machine. A storage proxy, associated with a storage environment comprising a volume within which snapshots of the virtual machine are to be stored, is accessed by the orchestrator to initialize a backup procedure. The orchestrator utilizes the virtual machine proxy to create a snapshot of the virtual machine. The orchestrator utilizes the storage proxy to back up the snapshot to the volume using the backup procedure.

公开(公告)号：WO2018081737A1

公开(公告)日：2018-05-03

申请号：PCT/US2017/059090

申请日：2017-10-30

Applicant: NETAPP, INC.

Inventor： JAIN, Sharad ,  TAPASWI, Hrishikesh, Ashok ,  ZHENG, Ling ,  BHAT, Onkar ,  KAUSHIK, Akhil

IPC: G06F11/14

Abstract: A storage appliance arranges snapshot data and snapshot metadata into different structures, and arranges the snapshot metadata to facilitate efficient snapshot manipulation, which may be for snapshot management or snapshot restore. The storage appliance receives snapshots according to a forever incremental configuration and arranges snapshot metadata into different types of records. The storage appliance stores these records in key-value stores maintained for each defined data collection (e.g., volume). The storage appliance arranges the snapshot metadata into records for inode information, records for directory information, and records that map source descriptors of data blocks to snapshot file descriptors. The storage appliance uses a locally generated snapshot identifier as a key prefix for the records to conform to a sort constrain of the key-value store, which allows the efficiency of the key-value store to be leveraged. The snapshot metadata arrangement facilitates efficient snapshot restore, file restore, and snapshot reclamation.

Abstract translation: 存储设备将快照数据和快照元数据安排到不同的结构中，并且排列快照元数据以促进高效的快照处理，这可以用于快照管理或快照恢复。 存储设备根据永久增量配置接收快照，并将快照元数据安排到不同类型的记录中。 存储设备将这些记录存储在为每个定义的数据收集（例如，卷）维护的键值存储中。 存储设备将快照元数据安排到inode信息的记录中，记录目录信息以及将数据块的源描述符映射到快照文件描述符的记录。 存储设备使用本地生成的快照标识符作为记录的键前缀，以符合键值存储的排序约束，从而可以利用键值存储的效率。 快照元数据安排有助于高效的快照恢复，文件恢复和快照回收。

公开(公告)号：EP3532934B1

公开(公告)日：2020-12-02

申请号：EP17798053.9

申请日：2017-10-30

Applicant: Netapp, Inc.

Inventor： KUSHWAH, Ajay Pratap, Singh ,  ZHENG, Ling ,  JAIN, Sharad

IPC: G06F11/14