END-TO-END CHECKSUM IN A MULTI-TENANT ENCRYPTION STORAGE SYSTEM

    公开(公告)号:US20190215152A1

    公开(公告)日:2019-07-11

    申请号:US15866185

    申请日:2018-01-09

    Applicant: VMware, Inc.

    Abstract: A multi-tenant storage system can store clear text data and associated clear text checksum received from a storage tenant using their associated cryptographic key (“cryptokey”). When the clear text data is compressible, cryptographic data (“cryptodata”) is generated from a concatenation of the clear text checksum and compressed clear text data using the cryptokey. A cryptographic checksum (“cryptochecksum”) is generated from the cryptodata. When the clear text data is uncompressible, cryptographic data (“cryptodata”) is generated by encrypting the clear text data using the cryptokey with an extra verification step to make sure the clear text checksum can be rebuilt during the read request. A cryptographic checksum (“cryptochecksum”) is generated from the cryptodata. The cryptodata and associated cryptochecksum are stored in the multi-tenant storage system, so that repairs to damaged cryptodata can be made using the associated cryptochecksum.

    WRITE-OPTIMIZED NESTED TREES
    163.
    发明申请

    公开(公告)号:US20190095457A1

    公开(公告)日:2019-03-28

    申请号:US15717613

    申请日:2017-09-27

    Applicant: VMware, Inc.

    Abstract: A Bε-tree associated with a file system on a storage volume includes a hierarchy of nodes. Each node includes a buffer portion that can be characterized by a fixed maximum allowable size to store key-value pairs as messages in the buffer. Messages can be initially buffered in the root node of the Bε-tree, and flushed to descendent children from the root node. Messages stored in the buffers can be indexed using a B+-tree data structure. As the B+-tree data structure in a buffer grows (due to receiving flushed messages) and shrinks (due to messages being flushed), disk blocks can be allocated from the storage volume to increase the actual size of the buffer and deallocated from the buffer to reduce the actual size of the buffer.

    Scalable storage space allocation in distributed storage systems

    公开(公告)号:US10223035B2

    公开(公告)日:2019-03-05

    申请号:US14839853

    申请日:2015-08-28

    Applicant: VMware, Inc.

    Abstract: System and method for managing storage metadata utilize a metadata data structure containing allocation information of storage blocks of a storage system in which a portion of the metadata data structure that corresponds to a group of the storage blocks can be reserved to a requesting client, which then manages the portion of the metadata data structure using a copy of the portion of the metadata data structure.

    FILE SYSTEM THAT SUPPORTS BOTH CASE SENSITIVE AND CASE INSENSITIVE DIRECTORY LOOKUP

    公开(公告)号:US20190026301A1

    公开(公告)日:2019-01-24

    申请号:US15655218

    申请日:2017-07-20

    Applicant: VMware, Inc.

    CPC classification number: G06F16/152

    Abstract: A file system stores directories and files in a file system directory that uses case sensitive names. The same file system directory can support directory and file name lookups that treat the directory and file names in a case sensitive manner or in a case insensitive manner. The search criteria used for the lookup can be based on case-folding the name to produce a case-neutral name and on the original name with its case preserved. Search criteria can be generated for a case sensitive name lookup or for a case insensitive name lookup on the same file system directory, thus avoiding having to support separate file systems or separate file system directories for case sensitive and case insensitive file access.

    Maintaining hole boundary information for restoring snapshots from parity

    公开(公告)号:US10078549B2

    公开(公告)日:2018-09-18

    申请号:US14716740

    申请日:2015-05-19

    Applicant: VMware, Inc.

    Abstract: Exemplary methods, apparatuses, and systems maintain hole boundary information by calculating a block attribute parity value. For example, a request is received to write to a first block of a stripe of data. A block attribute of a second block is determined. The block attribute of the second block indicates whether the second block includes written data or is a hole. A block attribute parity value is calculated based upon both the block attribute of the first block and the block attribute of the second block. The block attribute of the first block indicates the first block includes written data based upon the received request. The block attribute parity value and the data parity value are stored on one of the physical storage devices in response to the received write request. As a result, if a disk is lost, holes can be recovered using the block attribute parity value.

    Fine-Grained Metadata Management in a Distributed File System

    公开(公告)号:US20170220598A1

    公开(公告)日:2017-08-03

    申请号:US15011300

    申请日:2016-01-29

    Applicant: VMware, Inc.

    Abstract: Techniques for performing fine-grained metadata management in a distributed file system (DFS) are provided. In one embodiment, each node in a plurality of nodes implementing the DFS can execute a namespace metadata service that is dedicated to managing file system metadata pertaining to one or more namespaces of the DFS. Each node can further execute a data metadata service that is distinct from the namespace metadata service, where the data metadata service is dedicated to managing file system metadata pertaining to properties of data and free space in the DFS.

    Maintaing encryption keys to provide encryption on top of data deduplication

    公开(公告)号:US09652634B2

    公开(公告)日:2017-05-16

    申请号:US14716768

    申请日:2015-05-19

    Applicant: VMware, Inc.

    Abstract: Exemplary methods, apparatuses, and systems generate an encryption key based upon data content of a portion of data to be encrypted by the encryption key. The encryption key is stored as one of a plurality of encryption keys within a subset of storage. Each of the plurality of encryption keys is generated based upon corresponding data content. A checksum representing the plurality of encryption keys is calculated. In response to receiving an input/output (I/O) request for data encrypted by the encryption key, a verification checksum representing the plurality of encryption keys is calculated. The requested data is decrypted using the encryption key in response to verifying the checksum and verification checksum match.

    SNAPSHOTS AND CLONES IN A BLOCK-BASED DATA DEDUPLICATION STORAGE SYSTEM
    169.
    发明申请
    SNAPSHOTS AND CLONES IN A BLOCK-BASED DATA DEDUPLICATION STORAGE SYSTEM 审中-公开
    基于块的数据存储系统中的快照和克隆

    公开(公告)号:US20160350006A1

    公开(公告)日:2016-12-01

    申请号:US14726572

    申请日:2015-05-31

    Applicant: VMware, Inc.

    Abstract: A deduplication storage system with snapshot and clone capability includes storing logical pointer objects and organizing a first set of the logical pointer objects into a hierarchical structure. A second set of the logical pointer objects may be associated with corresponding logical data blocks of a client data object. The second set of the logical pointer objects may point to physical data blocks having deduplicated data that comprise data of the corresponding logical data blocks. Some of the logical pointer objects in the first set may point to the logical pointer objects in the second set, so that the hierarchical structure represents the client data object. A root of the hierarchical structure may be associated with the client data object. A snapshot or clone may be created by making a copy of the root and associating the copied root with the snapshot or clone.

    Abstract translation: 具有快照和克隆功能的重复数据删除存储系统包括存储逻辑指针对象并将第一组逻辑指针对象组织成层次结构。 第二组逻辑指针对象可以与客户机数据对象的相应逻辑数据块相关联。 第二组逻辑指针对象可以指向具有包括相应逻辑数据块的数据的重复数据删除数据的物理数据块。 第一组中的一些逻辑指针对象可以指向第二组中的逻辑指针对象,使得层次结构表示客户端数据对象。 层次结构的根可以与客户端数据对象相关联。 可以通过创建根的副本并将复制的根与快照或克隆相关联来创建快照或克隆。

    USING CHECKSUMS TO REDUCE THE WRITE LATENCY OF LOGGING
    170.
    发明申请
    USING CHECKSUMS TO REDUCE THE WRITE LATENCY OF LOGGING 审中-公开
    使用检查来减少记录的写入延迟

    公开(公告)号:US20160342641A1

    公开(公告)日:2016-11-24

    申请号:US14719209

    申请日:2015-05-21

    Applicant: VMware, Inc.

    Abstract: Techniques for reducing write latency when logging write operations are provided. In one embodiment, a computer system can receive a write operation originating from a storage client, where the write operation is directed to a data object stored on a nonvolatile storage of the computer system. The computer system can further calculate a checksum value based on the contents of the data object as modified by the write operation, and generate a log record for the write operation that includes the first checksum value and a pointer to a location of the data object on the nonvolatile storage. The computer system can then issue the write operation and a write of the log record concurrently to the nonvolatile storage, thereby reducing the latency incurred for the overall write/logging process before a write acknowledgement is sent to the storage client.

    Abstract translation: 提供了记录写入操作时减少写入延迟的技术。 在一个实施例中,计算机系统可以接收源自存储客户机的写入操作,其中写入操作被定向到存储在计算机系统的非易失性存储器上的数据对象。 计算机系统可以基于通过写入操作修改的数据对象的内容来进一步计算校验和值,并且生成包括第一校验和值和指向数据对象位置的指针的写入操作的日志记录 非易失性存储。 然后,计算机系统可以将写入操作和日志记录的写入同时写入非易失性存储器,由此减少在将写入确认发送到存储客户机之前对整个写入/记录过程造成的延迟。

Patent Agency Ranking