SYSTEM AND METHOD FOR COMPRESSION OF PARTIALLY ORDERED DATA SETS
    181.
    发明申请
    SYSTEM AND METHOD FOR COMPRESSION OF PARTIALLY ORDERED DATA SETS 审中-公开
    用于压缩部分有序数据集的系统和方法

    公开(公告)号:WO2010021698A3

    公开(公告)日:2010-04-22

    申请号:PCT/US2009004712

    申请日:2009-08-18

    Applicant: NETAPP INC

    CPC classification number: H03M7/3088

    Abstract: A system and method for compression of partially ordered data sets is provided. A first record of the data set is compressed by encoding the record using a Fibonacci en coding technique. Thereafter, for each subsequent record N, the N-1st record is subtracted from the Nth record before encoding the result, thereby allowing each subsequent record to store the difference (or delta) from the previous record.

    Abstract translation: 提供了用于压缩部分有序数据集的系统和方法。 数据集的第一条记录是通过使用斐波那契编码技术对记录进行编码来压缩的。 之后,对于每个后续记录N,在对结果进行编码之前从第N个记录中减去N-1个记录,从而允许每个后续记录存储与先前记录的差值(或差值)。

    ADAPTIVE SCHEDULING OF STORAGE OPERATIONS BASED ON UTILIZATION OF MULTIPLE CLIENT AND SERVER RESOURCES IN A DISTRIBUTED NETWORK STORAGE SYSTEM
    182.
    发明申请
    ADAPTIVE SCHEDULING OF STORAGE OPERATIONS BASED ON UTILIZATION OF MULTIPLE CLIENT AND SERVER RESOURCES IN A DISTRIBUTED NETWORK STORAGE SYSTEM 审中-公开
    基于多用户和服务器资源的分布式网络存储系统的存储操作自适应调度

    公开(公告)号:WO2010036731A2

    公开(公告)日:2010-04-01

    申请号:PCT/US2009/058087

    申请日:2009-09-23

    Abstract: Scheduling operations such as asynchronous file system operations in a network storage system is accomplished by applying a bid-price online auction methodology, in which bid (willingness-to-pay) values and price (cost) values are dynamically set by storage clients and a storage server, respectively, based on utilization of computing resources. The system provides a framework for adaptively scheduling asynchronous file system operations, managing multiple key resources of the distributed file system, including network bandwidth, server I/O, server CPU, and client and server memory utilization. The system can accelerate, defer, or cancel asynchronous requests to improve application-perceived performance. Congestion pricing via online auctions can be employed to coordinate the use of system resources by clients, so clients can detect shortages and adapt their resource usage.

    Abstract translation: 在网络存储系统中的诸如异步文件系统操作之类的调度操作通过应用投标价格在线拍卖方法来完成,其中投标(支付意愿)值和价格(成本)值 由存储客户端和存储服务器分别基于计算资源的利用而动态设置。 系统提供了一个自适应调度异步文件系统操作的框架,管理分布式文件系统的多个关键资源,包括网络带宽,服务器I / O,服务器CPU以及客户端和服务器内存利用率。 该系统可以加速,推迟或取消异步请求以提高应用感知性能。 通过在线拍卖获得拥挤定价可以用来协调客户对系统资源的使用,因此客户可以检测短缺并调整资源使用。

    DISCARDING SENSITIVE DATA FROM PERSISTENT POINT-IN-TIME IMAGE
    183.
    发明申请
    DISCARDING SENSITIVE DATA FROM PERSISTENT POINT-IN-TIME IMAGE 审中-公开
    从持续时间图像中删除敏感数据

    公开(公告)号:WO2009134930A3

    公开(公告)日:2010-03-04

    申请号:PCT/US2009042173

    申请日:2009-04-29

    CPC classification number: G06F21/6218 G06F21/62 G06F2221/2107

    Abstract: A network storage server implements a method to discard sensitive data from a Persistent Point-In-Time Image (PPI). The server first efficiently identifies a dataset containing the sensitive data from a plurality of datasets managed by the PPI. Each of the plurality of datasets is read-only and encrypted with a first encryption key. The server then decrypts each of the plurality of datasets, except the dataset containing the sensitive data, with the first encryption key. The decrypted datasets are re-encrypted with a second encryption key, and copied to a storage structure. Afterward, the first encryption key is shredded.

    Abstract translation: 网络存储服务器实现从持续时间点映像(PPI)中丢弃敏感数据的方法。 服务器首先从PPI管理的多个数据集中有效地识别包含敏感数据的数据集。 多个数据集中的每个数据集是只读的并用第一加密密钥加密。 服务器然后使用第一加密密钥对包含敏感数据的数据集之外的多个数据集中的每一个进行解密。 解密的数据集用第二加密密钥重新加密,并复制到存储结构。 之后,第一个加密密钥被打碎。

    SYSTEM AND METHOD FOR COMPRESSION OF PARTIALLY ORDERED DATA SETS
    184.
    发明申请
    SYSTEM AND METHOD FOR COMPRESSION OF PARTIALLY ORDERED DATA SETS 审中-公开
    用于压缩部分数据集的系统和方法

    公开(公告)号:WO2010021698A2

    公开(公告)日:2010-02-25

    申请号:PCT/US2009/004712

    申请日:2009-08-18

    Applicant: NETAPP, INC.

    CPC classification number: H03M7/3088

    Abstract: A system and method for compression of partially ordered data sets is provided. A first record of the data set is compressed by encoding the record using a Fibonacci en coding technique. Thereafter, for each subsequent record N, the N-1 st record is subtracted from the N th record before encoding the result, thereby allowing each subsequent record to store the difference (or delta) from the previous record.

    Abstract translation: 提供了用于压缩部分有序数据集的系统和方法。 通过使用斐波那契编码技术对记录进行编码来压缩数据集的第一记录。 此后,对于每个后续记录N,在对结果进行编码之前从第N个记录中减去N-1st记录,从而允许每个后续记录存储来自先前记录的差值(或增量)。

    LOAD-DERIVED PROBABILITY-BASED DOMAIN NAME SERVICE IN A NETWORK STORAGE CLUSTER
    185.
    发明申请
    LOAD-DERIVED PROBABILITY-BASED DOMAIN NAME SERVICE IN A NETWORK STORAGE CLUSTER 审中-公开
    网络存储集群中基于负载派生的基于概率的域名服务

    公开(公告)号:WO2010011827A2

    公开(公告)日:2010-01-28

    申请号:PCT/US2009051515

    申请日:2009-07-23

    Abstract: DNS name resolution is integrated into each node in a network storage cluster, to allow load balancing of network addresses, using a weighted random distribution to resolve DNS requests. A node in the cluster gathers statistics on utilization of resources, such as CPU utilization and throughput, on nodes in the cluster and distributes those statistics to all other nodes. Each node uses the same algorithm to generate weights for the various IP addresses of the cluster, based on the statistics distributed to it. The weights are used to generate a weighted list of available network addresses. In response to a DNS request, a DNS in a given node randomly indexes into the weighted address list to resolve requests to a network address. The weights are chosen so that the DNS is likely to pick an IP address which has a low load, to balance port and node usage over time.

    Abstract translation: DNS名称解析集成到网络存储群集中的每个节点中,以允许对网络地址进行负载平衡,使用加权随机分布来解析DNS请求。 群集中的节点收集群集节点上的资源利用率统计信息,例如CPU利用率和吞吐量,并将这些统计信息分发到所有其他节点。 每个节点使用相同的算法根据分配给它的统计信息为集群的各种IP地址生成权重。 权重用于生成可用网络地址的加权列表。 为了响应DNS请求,给定节点中的DNS随机索引到加权地址列表中以解析对网络地址的请求。 选择权重以便DNS可能选择负载较低的IP地址,以随时间平衡端口和节点的使用情况。

    MAINTAINING CHECKPOINTS DURING BACKUP OF LIVE SYSTEM
    186.
    发明申请
    MAINTAINING CHECKPOINTS DURING BACKUP OF LIVE SYSTEM 审中-公开
    在实时系统备份期间维护检查

    公开(公告)号:WO2009134932A2

    公开(公告)日:2009-11-05

    申请号:PCT/US2009/042175

    申请日:2009-04-29

    Inventor: NAGARAJ, Prasad

    CPC classification number: G06F11/1443 G06F11/1464

    Abstract: Techniques introduced here support block level transmission of a logical container from a network storage controller to a backup system. In accordance with the techniques, transmission can be restarted using checkpoints created at the block level by allowing restarts from various points within a logical container, for example a point at which 10%, 50%, or 75% of the logical container had been transmitted. The transmission can be restarted while maintaining data consistency of the logical container data and included meta-data. Advantageously, changes made prior to a checkpoint restart to, for example, meta-data, do not lead to inconsistent logical container backups.

    Abstract translation: 这里介绍的技术支持逻辑容器从网络存储控制器到备份系统的块级传输。 根据这些技术,可以使用通过允许从逻辑容器内的各个点重新启动的块级创建的检查点来重新启动传输,例如逻辑容器的10%,50%或75%的传输点 。 可以在保持逻辑容器数据和包含的元数据的数据一致性的同时重新启动传输。 有利的是,在检查点重新启动之前进行的更改例如是元数据,不会导致不一致的逻辑容器备份。

    FLEXIBLE TIERING OF SNAPSHOTS TO ARCHIVAL STORAGE IN REMOTE OBJECT STORES

    公开(公告)号:WO2023009769A1

    公开(公告)日:2023-02-02

    申请号:PCT/US2022/038748

    申请日:2022-07-29

    Applicant: NETAPP, INC.

    Abstract: Techniques are provided for tiering snapshots to archival storage in remote object stores. A restore time metric, indicating that objects comprising snapshot data of snapshots created within a threshold timespan are to be available within a storage tier of a remote object store for performing restore operations, may be identified. A scanner may be executed to evaluate snapshots using the restore time metric to identify a set of candidate snapshots for archival from the storage tier to an archival storage tier of the remote object store. For each candidate snapshot within the set of candidate snapshots, the scanner may evaluate metadata associated with the candidate snapshot to identity one or more objects eligible for archival from the storage tier to the archival storage tier, and may archive the one or more objects from the storage tier to the archival storage tier.

    IMMUTABLE SNAPSHOT COPIES STORED IN WRITE ONCE READ MANY (WORM) STORAGE

    公开(公告)号:WO2023009768A1

    公开(公告)日:2023-02-02

    申请号:PCT/US2022/038746

    申请日:2022-07-29

    Applicant: NETAPP, INC.

    Abstract: Techniques are provided for storing immutable snapshot copes in write once read many (WORM) storage. A snapshot of a volume may be stored into one or more objects formatted according to an object format. An expiry time may be assigned to the snapshot and the one or more objects based upon a creation time of the snapshot and a retention time. The one or more objects may be stored within a remote object store. The one or more objects are retained in an immutable state and cannot be deleted until expiration of the expiry time. In response to identifying an existing object within the remote object store comprising shared snapshot data referenced by the snapshot, an assigned expiry time of the existing object may be modified based upon the expiry time of the snapshot to create a modified expiry time for the existing object.

    INTERRUPTION PREDICTIONS FOR CLOUD COMPUTE INSTANCES

    公开(公告)号:WO2022093625A1

    公开(公告)日:2022-05-05

    申请号:PCT/US2021/056059

    申请日:2021-10-21

    Applicant: NETAPP, INC.

    Abstract: Systems, methods, and machine-readable media for predicting interruptions to the use of spare cloud resources and rebalancing based on those predictions are disclosed. A computing platform collects data for customers over time. The computing platform runs a machine learning algorithm on the historical data to generate a prediction classifier. The prediction classifier relates to a time window for prediction into the future, on the order of minutes or hours. The prediction classifier is run on monitored data from ongoing activity with a cloud provider to generate a risk score. Each risk score may identify an amount of risk that a spare cloud resource related to new resource metrics data will be interrupted within the future time frame corresponding to that prediction classifier. If predicted to be interrupted, the customer may be assisted in rebalancing to other resources. As a result, interruptions can be predicted hours into the future.

Patent Agency Ranking