公开(公告)号：WO2014172579A2

公开(公告)日：2014-10-23

申请号：PCT/US2014034564

申请日：2014-04-17

Applicant: NETAPP INC

Inventor： MUHLESTEIN MARK ,  AMLEKAR SHEKHAR

IPC: G06F21/62

CPC classification number: G06F12/1458 ,  G06F17/30091 ,  G06F21/6218 ,  G06F21/6227

Abstract: Method and system for access based directory enumeration is provided. When a directory is enumerated for a first time, user credentials are verified against an access control list (ACL) entry that is referenced by an ACL inode (referred to as Xnode). The Xnode number is obtained from a file handle for a directory entry. The verification is recorded in a data structure that stores the Xnode identifier and user identifier. When the directory is enumerated again, the data structure is used to verify that the user has been validated before, instead of loading and checking against an ACL entry.

Abstract translation: 提供了基于访问的目录枚举的方法和系统。 首次枚举目录时，将根据ACL inode（称为Xnode）引用的访问控制列表（ACL）条目验证用户凭据。 Xnode号是从目录条目的文件句柄中获得的。 验证记录在存储Xnode标识符和用户标识符的数据结构中。 当再次枚举目录时，数据结构用于验证用户是否已经被验证过，而不是对ACL条目进行加载和检查。

公开(公告)号：WO2014085386A1

公开(公告)日：2014-06-05

申请号：PCT/US2013/071868

申请日：2013-11-26

Applicant: NETAPP, INC.

Inventor： SUBBIAH, Sethuraman ,  SOUNDARARAJAN, Gokul ,  SHASTRI, Tanya ,  BAIRAVASUNDARAM, Lakshmi Narayanan

IPC: H04L29/08 ,  H04L29/06

CPC classification number: H04L29/08144 ,  H04L67/1002 ,  H04L67/1097 ,  H04L67/2814 ,  H04L67/2842 ,  H04L67/2852 ,  H04L69/02

Abstract: A dynamic caching technique adaptively controls copies of data blocks stored within caches ("cached copies") of a caching layer distributed among servers of a distributed data processing system. A cache coordinator of the distributed system implements the dynamic caching technique to increase the cached copies of the data blocks to improve processing performance of the servers. Alternatively, the technique may decrease the cached copies to reduce storage capacity of the servers. The technique may increase the cached copies when it detects local and/or remote cache bottleneck conditions at the servers, a data popularity condition at the servers, or a shared storage bottleneck condition at the storage system. Otherwise, the technique may decrease the cached copies at the servers.

Abstract translation: 动态缓存技术自适应地控制存储在分布式数据处理系统的服务器之间的缓存层的高速缓存（“高速缓存副本”）中的数据块的副本。 分布式系统的缓存协调器实现动态缓存技术来增加数据块的缓存副本，以提高服务器的处理性能。 或者，该技术可以减少缓存副本以减少服务器的存储容量。 当检测到服务器上的本地和/或远程高速缓存瓶颈状况，服务器上的数据流行状况或存储系统的共享存储瓶颈条件时，该技术可能会增加缓存副本。 否则，该技术可能会降低服务器上的缓存副本。

公开(公告)号：WO2014078504A1

公开(公告)日：2014-05-22

申请号：PCT/US2013/070046

申请日：2013-11-14

Applicant: NETAPP, INC.

Inventor： KNIGHT, Frederick E. ,  MENEGHINI, John ,  RAJENDRAN, Arun Kumar ,  VIJAYA KUMARI RAJENDRAN NAIR, Saji Kumar

IPC: G06F12/14 ,  G06F12/16

CPC classification number: H04L67/1095 ,  G06F17/30203 ,  G06F17/30206 ,  H04L69/08

Abstract: Methods and apparatuses for performing inter-protocol copy offload operations are provided. In one embodiment, a method includes receiving a request in a first interface protocol from a host device. The request is a request to copy a data set from a source data storage location to a destination data storage location. The request includes a token, representing the data set, to be copied that was created using a second interface protocol that is different from the first interface protocol. The method also includes transferring the data set, in response to receiving the request, from the source data storage location to the destination data storage location without transferring the data set to the host device.

Abstract translation: 提供了用于执行协议间拷贝卸载操作的方法和装置。 在一个实施例中，一种方法包括从主机设备接收第一接口协议中的请求。 请求是将数据集从源数据存储位置复制到目的地数据存储位置的请求。 请求包括表示要复制的令牌，该令牌是使用与第一接口协议不同的第二接口协议创建的。 该方法还包括响应于接收到请求而将数据集从源数据存储位置传送到目的地数据存储位置，而不将数据集传送到主机设备。

公开(公告)号：WO2014063073A1

公开(公告)日：2014-04-24

申请号：PCT/US2013/065715

申请日：2013-10-18

Applicant: NETAPP, INC.

Inventor： CHANDRASEKARASASTRY, Nagesh Panyam ,  KATHPAL, Atish ,  MAKKAR, Gaurav

IPC: G06F12/00 ,  G06F3/06

CPC classification number: G06F12/02 ,  G06F3/0605 ,  G06F3/0613 ,  G06F3/0647 ,  G06F3/067 ,  G06F12/0223

Abstract: Methods and apparatuses for efficiently migrating deduplicated data are provided. In one example, a data management system includes a data storage volume, a memory including machine executable instructions, and a computer processor. The data storage volume includes data objects and free storage space. The computer processor executes the instructions to perform deduplication of the data objects and determine migration efficiency metrics for groups of the data objects. Determining the migration efficiency metrics includes determining, for each group, a relationship between the free storage space that will result if the group is migrated from the volume and the resources required to migrate the group from the volume.

Abstract translation: 提供了有效迁移重复数据删除数据的方法和设备。 在一个示例中，数据管理系统包括数据存储卷，包括机器可执行指令的存储器和计算机处理器。 数据存储卷包括数据对象和空闲存储空间。 计算机处理器执行指令以执行数据对象的重复数据删除，并确定数据对象组的迁移效率度量。 确定迁移效率指标包括为每个组确定如果组从卷迁移而导致的空闲存储空间与从组中迁移组所需的资源之间的关系。

公开(公告)号：WO2014063062A1

公开(公告)日：2014-04-24

申请号：PCT/US2013/065699

申请日：2013-10-18

Applicant: NETAPP, INC.

Inventor： MALLAIAH, Damarugendra ,  BASAK, Jayanta

IPC: G06F12/00

CPC classification number: G06F17/30156 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/067 ,  G06F17/30368

Abstract: Methods and apparatuses for performing selective deduplication in a storage system are introduced here. Techniques are provided for determining a probability of deduplication for a data object based on a characteristic of the data object and performing a deduplication operation on the data object in the storage system prior to the data object being stored in persistent storage of the storage system if the probability of deduplication for the data object has a specified relationship to a specified threshold.

Abstract translation: 这里介绍用于在存储系统中执行选择性重复数据消除的方法和装置。 提供技术用于基于数据对象的特性来确定数据对象的重复数据删除的概率，并且在数据对象被存储在存储系统的持久存储器中之前对存储系统中的数据对象执行重复数据删除操作，如果 数据对象的重复数据删除概率与指定的阈值有特定的关系。

公开(公告)号：WO2014018742A1

公开(公告)日：2014-01-30

申请号：PCT/US2013/052034

申请日：2013-07-25

Applicant: NETAPP, INC.

Inventor： MAKKAR, Gaurav ,  LENT, Arthur

IPC: G06F17/00 ,  G06F15/16

CPC classification number: G06F17/30557

Abstract: The techniques introduced herein provide for systems and methods for creating and managing a contention-free multi-path access to a distributed data set in a distributed processing system. In one embodiment, a distributed processing system comprises a plurality of compute nodes. The compute nodes are assembled into compute groups and configured such that each compute group has an attached or local storage system. Various data segments of the distributed data set are stored in data storage objects on the local storage system. The data storage objects are cross-mapped into each of the compute nodes in the compute group so that any compute node in the group can access any of the data segments stored in the local storage system via the respective data storage object.

Abstract translation: 本文介绍的技术提供了用于创建和管理对分布式处理系统中的分布式数据集的无竞争的多路径访问的系统和方法。 在一个实施例中，分布式处理系统包括多个计算节点。 计算节点被组合成计算组并被配置为使得每个计算组具有附接或本地存储系统。 分布式数据集的各种数据段存储在本地存储系统上的数据存储对象中。 数据存储对象被交叉映射到计算组中的每个计算节点中，使得组中的任何计算节点可以经由相应数据存储对象访问存储在本地存储系统中的任何数据段。

公开(公告)号：WO2013176860A2

公开(公告)日：2013-11-28

申请号：PCT/US2013/039258

申请日：2013-05-02

Applicant: NETAPP, INC.

Inventor： BAKRE, Ajay ,  BK, Girish, Kumar ,  SLIK, David

IPC: G06F15/173

CPC classification number: G06F17/30132 ,  H04L67/1097

Abstract: Systems and methods efficiently distribute information, such as path name, attributes and object information, corresponding to changes in a content repository to remote nodes in a network using storage-layer/object-based protocols. A difference monitoring client monitors name space and object space changes by identifying inodes which have been modified on storage volumes between two or more snapshots. The monitoring client builds a list which may include name information, object space information and attributes such as file size and permissions for each of the changed inodes that is utilized to update the edge nodes. Systems and methods also provide for geo-scale content distribution from a central repository to edge nodes using a storage- layer/object protocol. A caching mechanism is utilized to cache requested content at an edge node. Cached content may be maintained at the edge node during use and/or for an additional predetermined period. Difference monitoring client tracks such cached content for later use in the storage system.

Abstract translation: 系统和方法使用存储层/基于对象的协议，有效地将对应于内容存储库中的更改的信息（例如路径名称，属性和对象信息）分发到网络中的远程节点。 差异监控客户端通过标识在两个或多个快照之间的存储卷上修改的inode来监视名称空间和对象空间更改。 监视客户端构建一个列表，其中可以包括名称信息，对象空间信息以及用于更新边缘节点的每个更改的节点的文件大小和权限等属性。 系统和方法还提供了使用存储层/对象协议从中央存储库到边缘节点的地理规模内容分发。 缓存机制用于在边缘节点处缓存所请求的内容。 缓存内容可以在使用期间和/或另外的预定时段期间保持在边缘节点处。 差异监控客户端跟踪这些缓存的内容以备以后在存储系统中使用。

公开(公告)号：WO2013089821A1

公开(公告)日：2013-06-20

申请号：PCT/US2012/033899

申请日：2012-04-17

Applicant: NETAPP, INC. ,  FORGETTE, Eric, Paul ,  SARISKY, Daniel, Andrew ,  RIPPY, Jonathan, Kenneth

Inventor： FORGETTE, Eric, Paul ,  SARISKY, Daniel, Andrew ,  RIPPY, Jonathan, Kenneth

IPC: G06F9/46

CPC classification number: G06F3/0605 ,  G06F3/0631 ,  G06F3/067

Abstract: Systems and methods that enable the optimal creation of a storage object within a virtual storage system are disclosed. In accordance with embodiments, an optimal location with the storage system is determined in response to receiving an indication that a storage object is to be created within the storage system. The system and method prioritize physical storage resources in which to create the storage object, prioritize components to be provided access to the created storage object, and prioritize the interface between the physical storage resources and the accessing component. The storage object is optimally created within the storage system based on the priorities and based, at least in part, on other created storage objects.

Abstract translation: 公开了能够在虚拟存储系统内最佳创建存储对象的系统和方法。 根据实施例，响应于接收到在存储系统内要创建存储对象的指示来确定与存储系统的最佳位置。 系统和方法优先考虑在其中创建存储对象的物理存储资源，对要提供的对所创建的存储对象的访问的组件进行优先级排序，以及优先处理物理存储资源和访问组件之间的接口。 基于优先级，在存储系统内最佳地创建存储对象，至少部分地基于其他创建的存储对象。

公开(公告)号：WO2012142027A3

公开(公告)日：2013-01-17

申请号：PCT/US2012032890

申请日：2012-04-10

Applicant: NETAPP INC ,  STORER MARK W ,  SCHINDLER JIRI

Inventor： STORER MARK W ,  SCHINDLER JIRI

IPC: G06F12/00 ,  G06F12/16 ,  G06F15/16

CPC classification number: G06F11/1092 ,  G06F11/008

Abstract: A storage system provides highly flexible data layouts that can be tailored based on reliability considerations. The system allocates reliability values to logical containers at an upper logical level of the system based, for example, on objectives established by reliability SLOs. Based on the reliability value, the system identifies a specific parity group from a lower physical storage level of the system for storing data corresponding to the logical container. After selecting a parity group, the system allocates the data to physical storage blocks within the parity group. In embodiments, the system attaches the reliability value information to the parity group and the physical storage units storing the data. In this manner, the underlying physical layer has a semantic understanding of reliability considerations related to the data stored at the logical level. Based on this semantic understanding, the system has the capability to prioritize data operations on the physical storage units according to the reliability values attached to the parity groups.

Abstract translation: 存储系统提供高度灵活的数据布局，可根据可靠性考虑进行定制。 该系统基于例如由可靠性SLO建立的目标，将系统的逻辑容器分配到系统的较高逻辑级别的逻辑容器。 基于可靠性值，系统从用于存储对应于逻辑容器的数据的系统的较低物理存储级别识别特定奇偶校验组。 选择奇偶校验组后，系统会将数据分配给奇偶校验组内的物理存储块。 在实施例中，系统将可靠性值信息附加到奇偶校验组和存储数据的物理存储单元。 以这种方式，底层物理层对与存储在逻辑级别的数据相关的可靠性考虑具有语义上的理解。 基于这种语义理解，系统具有根据附加到奇偶校验组的可靠性值对物理存储单元进行数据操作的优先级的能力。

公开(公告)号：WO2012173859A2

公开(公告)日：2012-12-20

申请号：PCT/US2012/041301

申请日：2012-06-07

Applicant: NETAPP, INC. ,  YASA, Giridhar Appaji Nag ,  CHANDRASEKARASASTRY, Nagesh Panyam

Inventor： YASA, Giridhar Appaji Nag ,  CHANDRASEKARASASTRY, Nagesh Panyam

IPC: G06F12/00 ,  G06F11/00 ,  G06F15/16

CPC classification number: G06F17/30156

Abstract: The technique introduced here includes a system and method for identification of duplicate data directly at a data-object level. The technique illustratively utilizes a hierarchical tree of fingerprints for each data object to compare data objects and identify duplicate data blocks referenced by the data objects. The hierarchical fingerprint trees are constructed in such a manner that a top-level fingerprint (or object-level fingerprint) of the hierarchical tree is representative of all data blocks referenced by a storage system. In embodiments, inline techniques are utilized to generate hierarchical fingerprints for new data objects as they are created, and an object-level fingerprint of the new data object is compared against preexisting object-level fingerprints in the storage system to identify exact or close matches. While exact matches result in complete deduplication of data blocks referenced by the data object, hierarchical comparison methods are used for identifying and mapping duplicate data blocks referenced by closely related data objects.

Abstract translation: 这里介绍的技术包括直接在数据对象层面识别重复数据的系统和方法。 该技术说明性地利用每个数据对象的指纹分层树来比较数据对象并识别由数据对象引用的重复数据块。 层次化指纹树以这样一种方式构成，使得层次树的顶级指纹（或对象级指纹）代表由存储系统引用的所有数据块。 在实施例中，在创建新数据对象时，使用内联技术来生成新数据对象的分层指纹，并将新数据对象的对象级指纹与存储系统中的预先存在的对象级指纹进行比较，以识别精确或近似的匹配。 虽然精确匹配导致数据对象引用的数据块的完全重复数据删除，但层次比较方法用于识别和映射由紧密相关的数据对象引用的重复数据块。