公开(公告)号：US08892527B1

公开(公告)日：2014-11-18

申请号：US13620684

申请日：2012-09-14

Applicant: Sandeep Yadav ,  Subramanian Periyagaram

Inventor： Sandeep Yadav ,  Subramanian Periyagaram

IPC: G06F7/00 ,  G06F17/30 ,  G06F3/06

CPC classification number: G06F3/0641 ,  G06F3/0608 ,  G06F3/0619 ,  G06F3/067 ,  G06F3/0679 ,  G06F11/1453 ,  G06F12/0871 ,  G06F17/30156 ,  G06F17/30197 ,  G06F17/30386 ,  G06F2206/1014 ,  G06F2212/222

Abstract: A method and system for eliminating the redundant allocation and deallocation of special data on disk, wherein the redundant allocation and deallocation of special data on disk is eliminated by providing an innovate technique for specially allocating special data of a storage system. Specially allocated data is data that is pre-allocated on disk and stored in memory of the storage system. “Special data” may include any pre-decided data, one or more portions of data that exceed a pre-defined sharing threshold, and/or one or more portions of data that have been identified by a user as special. For example, in some embodiments, a zero-filled data block is specially allocated by a storage system. As another example, in some embodiments, a data block whose contents correspond to a particular type document header is specially allocated.

Abstract translation: 一种消除磁盘上特殊数据的冗余分配和释放的方法和系统，其中通过提供专门分配存储系统的特殊数据的创新技术，消除了磁盘上特殊数据的冗余分配和释放。 特别分配的数据是在磁盘上预先分配并存储在存储系统的存储器中的数据。 “特殊数据”可以包括任何预先决定的数据，超过预定义共享阈值的数据的一个或多个部分，和/或用户已经被特别识别的数据的一个或多个部分。 例如，在一些实施例中，零填充数据块由存储系统专门分配。 作为另一示例，在一些实施例中，特别分配其内容对应于特定类型文档头的数据块。

公开(公告)号：US08887233B2

公开(公告)日：2014-11-11

申请号：US11102363

申请日：2005-04-08

Applicant: Ravi Krishna

Inventor： Ravi Krishna

IPC: G06F7/04 ,  H04L29/06

CPC classification number: H04L63/0281 ,  H04L63/08

Abstract: A system uses a proxy server to authenticate a client with an authentication protocol that does not support caching. Rather than cache the client's authentication credentials, or access a client account manager for each network request generated by the client, the proxy server issues a cookie to an authenticated client and authenticate the client for subsequent request on the basis of the cookie.

Abstract translation: 系统使用代理服务器使用不支持缓存的身份验证协议来验证客户端。 代理服务器不是缓存客户端的身份验证凭据，还是为客户机生成的每个网络请求访问客户端客户经理，代理服务器向经过身份验证的客户端发出一个cookie，并根据cookie对后续请求进行身份验证。

公开(公告)号：US08880687B1

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

申请号：US13366961

申请日：2012-02-06

Applicant: Aravinda Chandrachari ,  Ashwin Pankaj ,  Sri Mahesh Ponugoti ,  Sree Pardhasaradhi Gunnam

Inventor： Aravinda Chandrachari ,  Ashwin Pankaj ,  Sri Mahesh Ponugoti ,  Sree Pardhasaradhi Gunnam

IPC: G06F15/173

CPC classification number: H04L41/0816 ,  H04L43/065

Abstract: Detecting and managing idle virtual storage servers (VSSs) on a host system. The host system may execute several VSSs, each VSS may comprise a virtual machine implementing a virtualized storage operating system and provide storage services for one or more clients. Detecting and managing idle virtual storage servers comprises three stages: 1) detecting idle VSSs, 2) suspending an idle VSS, and 3) un-suspending a suspended VSS. For the first stage, idle VSSs are detected using a first metric relating to network activity of the VSS, a second metric relating to storage object-related requests received by a VSS, and a third metric relating to inbound data for a VSS. For the second stage, an idle virtual storage server is suspended to release its resources while preserving its state for possible later use. For the third stage, a suspended virtual storage server may be unsuspended if a client attempts to access it.

Abstract translation: 检测和管理主机系统上的空闲虚拟存储服务器（VSS）。 主机系统可以执行多个VSS，每个VSS可以包括实现虚拟化存储操作系统并为一个或多个客户端提供存储服务的虚拟机。 检测和管理空闲虚拟存储服务器包括三个阶段：1）检测空闲VSS，2）挂起空闲VSS，3）取消挂起挂起的VSS。 对于第一阶段，使用与VSS的网络活动相关的第一度量，与VSS接收的与存储对象相关的请求相关的第二度量以及与VSS的入站数据相关的第三度量来检测空闲VSS。 对于第二阶段，空闲的虚拟存储服务器被暂停以释放其资源，同时保留其状态以备将来使用。 对于第三阶段，如果客户端尝试访问它，则可能会暂停虚拟存储服务器。

公开(公告)号：US20140325640A1

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

申请号：US13873819

申请日：2013-04-30

Applicant: NETAPP, INC.

Inventor： Amit Aggarwal ,  Shekhar Amlekar

IPC: G06F21/31

CPC classification number: G06F21/31 ,  G06F2221/2107 ,  G06F2221/2111 ,  G06F2221/2141

Abstract: Embodiments described herein provide a technique for securely responding to an enumeration request of a data container stored at a location referenced by a junction or mount point within a share served by a storage system. To that end, the technique applies access permissions of the data container at the referenced location instead of permissions that may reside at the junction or mount point. Upon determining that the permissions are insufficient to allow access to the data container, the technique ensures that a descriptor of the junction or mount point is not included in a response to the enumeration request.

Abstract translation: 本文描述的实施例提供了一种用于安全地响应存储在由存储系统服务的共享内的连接点或安装点引用的位置处的数据容器的枚举请求的技术。 为此，该技术在引用的位置应用数据容器的访问权限，而不是可能驻留在连接点或装载点的权限。 在确定权限不足以允许访问数据容器时，该技术确保结点或装入点的描述符不包括在对枚举请求的响应中。

公开(公告)号：US20140325599A1

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

申请号：US13870832

申请日：2013-04-25

Applicant: Craig F. Everhart ,  Steven M. Ewing

Inventor： Craig F. Everhart ,  Steven M. Ewing

IPC: H04L29/06

CPC classification number: H04L63/104 ,  H04L63/101 ,  H04L63/20

Abstract: A system and method for designating and administering authority in a trusted environment is provided. In some embodiments, a determination is made that a transfer of the authority to a second computing entity is warranted. The second computing entity is opportunistically contacted, and during the opportunistic contact, the authority is passed from the first computing entity to the second computing entity. The passing of the authority from the first computing entity to the second computing entity tasks the second computing entity with updating members of the group of the passing of the authority. The passing of authority may include providing an outstanding group update to the second computing entity and may also include tasking the second computing entity with completing the outstanding group update.

Abstract translation: 提供了一种用于在受信任环境中指定和管理权限的系统和方法。 在一些实施例中，确定授权转移给第二计算实体是有必要的。 第二计算实体被机会地联系，并且在机会接触期间，权限从第一计算实体传递到第二计算实体。 将权限从第一计算实体传递到第二计算实体，通过更新权限的通过组的成员来对第二计算实体进行任务。 权限的传递可以包括向第二计算实体提供未完成的组更新，并且还可以包括对完成未完成组更新的第二计算实体进行任务。

公开(公告)号：US20140325147A1

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

申请号：US14261452

申请日：2014-04-25

Applicant: NetApp, Inc.

Inventor： Manoj Nayak

IPC: G06F3/06

CPC classification number: G06F3/0641 ,  G06F3/0608 ,  G06F3/0619 ,  G06F3/067 ,  G06F3/0689 ,  G06F12/0833 ,  G06F12/0866 ,  G06F12/12

Abstract: A storage system comprises a cache for caching data blocks and storage devices for storing blocks. A storage operating system may deduplicate sets of redundant blocks on the storage devices based on a deduplication requirement. Blocks in cache are typically deduplicated based on the deduplication on the storage devices. Sets of redundant blocks that have not met the deduplication requirement for storage devices and have not been deduplicated on the storage devices and cache are targeted for further deduplication processing. Sets of redundant blocks may be further deduplicated based on their popularity (number of accesses) in cache. If a set of redundant blocks in cache is determined to have a combined number of accesses being greater than a predetermined threshold number of accesses, the set of redundant blocks is determined to be “popular.” Popular sets of redundant blocks are selected for deduplication in cache and the storage devices.

Abstract translation: 存储系统包括用于缓存数据块的高速缓存和用于存储块的存储装置。 存储操作系统可以基于重复数据删除要求对存储设备上的冗余块进行重复数据删除。 缓存中的块通常基于存储设备上的重复数据删除来重复数据删除。 不符合存储设备重复数据删除要求且尚未在存储设备和缓存中进行重复数据删除的冗余块的集合将针对进一步的重复数据消除处理。 可以根据高速缓存中的受欢迎程度（访问次数）进一步对冗余块进行重复数据删除。 如果高速缓存中的一组冗余块被确定为具有大于预定阈值数量的访问的组合数量，那么该冗余块被确定为“受欢迎”。选择大量的冗余块组用于重复数据删除 缓存和存储设备。

公开(公告)号：US08874864B2

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

申请号：US14023117

申请日：2013-09-10

Applicant: NetApp, Inc.

Inventor： Peter Corbett ,  Michael Kazar

IPC: G06F12/00 ,  G06F17/30 ,  G06F13/00 ,  G06F13/28 ,  G06F11/14

CPC classification number: G06F17/30088 ,  G06F11/1435 ,  G06F11/1443 ,  G06F11/1446 ,  G06F12/00 ,  G06F13/00

Abstract: An on-disk structure of a file system has the capability to maintain snapshot and file system metadata on a storage system. The on-disk structure arranges file system data sequentially on disk within regions, wherein each region comprises a predetermined amount of disk space represented by blocks. The snapshot and file system metadata is maintained within level 1 (L1) indirect blocks of the on-disk structure. Each L1 indirect block describes (i.e., represents) a corresponding region of the on-disk structure of the file system; in the case of an active region, e.g., an L1 indirect block represents an active file data portion of a large file. The L1 indirect block that references an active region also performs file block number-to-disk block number mapping for the region.

Abstract translation: 文件系统的磁盘结构具有在存储系统上维护快照和文件系统元数据的功能。 磁盘结构将文件系统数据顺序地布置在区域内的盘上，其中每个区域包括由块表示的预定量的磁盘空间。 快照和文件系统元数据保持在磁盘结构的第1级（L1）间接块中。 每个L1间接块描述（即，表示）文件系统的盘上结构的相应区域; 在有源区域的情况下，例如，L1间接块表示大文件的活动文件数据部分。 引用活动区域的L1间接块也对该区域执行文件块号到磁盘块号映射。

公开(公告)号：US08874842B1

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

申请号：US14160133

申请日：2014-01-21

Applicant: NetApp, Inc.

Inventor： Jeffrey S. Kimmel ,  T. Bryon Rakitzis

IPC: G06F12/00 ,  G06F3/06

CPC classification number: G06F3/061 ,  G06F3/0608 ,  G06F3/0611 ,  G06F3/0638 ,  G06F3/064 ,  G06F3/0665 ,  G06F3/0688 ,  G06F17/30067 ,  G06F17/30097 ,  G06F2003/0692

Abstract: In one embodiment, use of hashing in a file system metadata arrangement reduces an amount of metadata stored in a memory of a node in a cluster and reduces the amount of metadata needed to process an input/output (I/O) request at the node. Illustratively, cuckoo hashing may be modified and applied to construct the file system metadata arrangement. The file system metadata arrangement may be illustratively configured as a key-value extent store embodied as a data structure, e.g., a cuckoo hash table, wherein a value, such as a hash table index, may be configured as an index and applied to the cuckoo hash table to obtain a key, such as an extent key, configured to reference a location of an extent on one or more storage devices, such as solid state drives.

Abstract translation: 在一个实施例中，在文件系统元数据布置中使用散列减少了存储在群集中的节点的存储器中的元数据量，并且减少了处理在节点处的输入/输出（I / O）请求所需的元数据量 。 说明性地，可以修改并应用杜鹃散列来构建文件系统元数据排列。 文件系统元数据布置可以被示意性地配置为体现为数据结构的键值区段存储，例如布鲁克哈希表，其中诸如哈希表索引的值可以被配置为索引并应用于 布鲁克哈希表以获得诸如扩展密钥的密钥，其被配置为引用一个或多个存储设备（例如固态驱动器）上的盘区的位置。

公开(公告)号：US08874680B1

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

申请号：US13288764

申请日：2011-11-03

Applicant: Dhananjoy Das

Inventor： Dhananjoy Das

IPC: G06F15/167 ,  G06F12/00

CPC classification number: H04L67/1097 ,  G06F3/061 ,  G06F3/0655 ,  G06F3/0688 ,  G06F12/0833 ,  G06F13/28 ,  G06F15/17331 ,  G06F2212/62 ,  H04L67/1095 ,  H04L67/2842

Abstract: A method for enforcing data integrity in an RDMA data storage system includes flushing data write requests to a data storage device before sending an acknowledgment that the data write requests have been executed. An RDMA data storage system includes a node configured to flush data write requests to a data storage device before sending an acknowledgment that a data write request has been executed.

Abstract translation: 用于在RDMA数据存储系统中实施数据完整性的方法包括在发送已执行数据写入请求的确认之前将数据写入请求冲刷到数据存储设备。 RDMA数据存储系统包括被配置为在发送已经执行数据写入请求的确认之前将数据写入请求刷新到数据存储设备的节点。

公开(公告)号：US20140317371A1

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

申请号：US13866281

申请日：2013-04-19

Applicant: NETAPP, INC.

Inventor： Mark Muhlestein ,  Shekhar Amlekar

IPC: G06F12/14

CPC classification number: G06F12/1458 ,  G06F16/13 ,  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条目进行加载和检查。