公开(公告)号：WO2012149220A3

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

申请号：PCT/US2012035299

申请日：2012-04-26

Applicant: NETAPP INC ,  MUDHIGANTI DEVENDER ,  KEREMANE HRISHIKESH ,  SOMAVARAPU NAGENDER ,  GEORGE TIJIN

Inventor： MUDHIGANTI DEVENDER ,  KEREMANE HRISHIKESH ,  SOMAVARAPU NAGENDER ,  GEORGE TIJIN

IPC: G06F15/16 ,  G06F9/06

CPC classification number: G06F3/0613 ,  G06F3/0608 ,  G06F3/0647 ,  G06F3/067 ,  G06F17/30067 ,  G06F17/30557

Abstract: System and method for migrating data from a source storage site to a destination storage site. The data may be comprised within storage objects (e.g., flexible volumes). A base storage object may comprise a parent storage object and a storage object clone may comprise a storage object that is derived from the base storage object. As such, a hierarchical relationship exists between the base storage object and the storage object clone. The storage object clone may comprise a writable point-in-time image of the parent storage object. If a migration of the base storage object and the storage object clone is performed, then the hierarchical relationship between the base storage object and the storage object clone is retained after the storage objects are migrated from the source storage site to the destination storage site. As such, the system and method for migrating data may enable storage space and network bandwidth savings.

Abstract translation: 将数据从源存储站点迁移到目标存储站点的系统和方法。 数据可以包括在存储对象（例如，灵活的卷）内。 基本存储对象可以包括父存储对象，并且存储对象克隆可以包括从基本存储对象导出的存储对象。 因此，基本存储对象和存储对象克隆之间存在层次关系。 存储对象克隆可以包括父存储对象的可写入时间点图像。 如果执行基本存储对象和存储对象克隆的迁移，则在将存储对象从源存储站点迁移到目标存储站点之后，将保留基本存储对象和存储对象克隆之间的分层关系。 因此，用于迁移数据的系统和方法可以实现存储空间和网络带宽的节省。

公开(公告)号：WO2012177318A1

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

申请号：PCT/US2012/034788

申请日：2012-04-24

Applicant: NETAPP, INC. ,  PERIYAGARAM, Subramaniam ,  YADAV, Sandeep ,  LEWIS, Blake ,  FAITH, Rickard, E. ,  PRAKASH, Ashish ,  KESAVAN, Ram ,  SUBRAMANIAN, Ananthan

Inventor： PERIYAGARAM, Subramaniam ,  YADAV, Sandeep ,  LEWIS, Blake ,  FAITH, Rickard, E. ,  PRAKASH, Ashish ,  KESAVAN, Ram ,  SUBRAMANIAN, Ananthan

IPC: G06F3/06 ,  G06F17/30

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

Abstract: A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.

Abstract translation: 收到请求以删除重复的数据。 访问与存储服务器中的存储卷相关联的日志数据容器。 日志数据容器包括多个条目。 每个条目由存储在与存储服务器相关联的卷中的数据结构中的盘区标识符标识。 对于日志数据容器中的每个条目，确定条目是否匹配日志数据容器中的另一个条目。 如果条目与日志数据容器中的另一个条目匹配，则确定捐赠者范围和受众范围。 如果与接收者范围相关联的外部参考计数等于第一预定值，则对捐赠者范围和接受者范围执行块共享。 如果供体范围的参考计数等于第二预定值，则确定。 如果供体范围的参考计数等于第二预定值，则供体范围被释放。

公开(公告)号：WO2012173858A3

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

申请号：PCT/US2012/041297

申请日：2012-06-07

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

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

IPC: G06F12/00 ,  G06F15/16

Abstract: The technique introduced here includes a system and method for identifying and mapping duplicate data objects referenced by data objects. The technique illustratively utilizes a hierarchical tree of fingerprints for each data object to compare the data objects and identify duplicate data blocks referenced by the data objects. A progressive comparison of the hierarchical trees starts from a top layer of the hierarchical trees and proceeds toward a base layer. Between the compared data objects (i.e., the compared hierarchical trees), the technique maps matching fingerprints only at the top-most layer of the hierarchical trees at which the fingerprints match. Lower layer matching fingerprints are neither compared nor mapped. Data blocks corresponding to the matching fingerprints are then deleted. Such an identification and mapping technique substantially reduces the amount of mapping metadata stored in data objects that have been subject to deduplication.

公开(公告)号：WO2012148734A1

公开(公告)日：2012-11-01

申请号：PCT/US2012/033942

申请日：2012-04-17

Applicant: NETAPP, INC. ,  FAITH, Rickard, E. ,  PERIYAGARAM, Subramaniam ,  YADAV, Sandeep ,  PRAKASH, Ashish ,  LEWIS, Blake ,  KIMMEL, Jeff ,  DANIEL, Steve

Inventor： FAITH, Rickard, E. ,  PERIYAGARAM, Subramaniam ,  YADAV, Sandeep ,  PRAKASH, Ashish ,  LEWIS, Blake ,  KIMMEL, Jeff ,  DANIEL, Steve

IPC: G06F3/06

CPC classification number: G06F3/064 ,  G06F3/061 ,  G06F3/0644 ,  G06F3/0689 ,  G06F17/30091 ,  G06F17/30203

Abstract: An extent-based storage architecture is implemented by a storage server receiving a read request for an extent from a client, wherein the extent includes a group of contiguous blocks and the read request includes a file block number. The storage server retrieves an extent identifier from a first sorted data structure, wherein the storage server uses the received file block number to traverse the first sorted data structure to the extent identifier. The storage server retrieves a reference to the extent from a second sorted data structure, wherein the storage server uses the retrieved extent identifier to traverse the second sorted data structure to the reference, and wherein the second sorted data structure is global across a plurality of volumes. The storage server retrieves the extent from a storage device using the reference and returns the extent to the client.

Abstract translation: 基于范围的存储架构由存储服务器实现，所述存储服务器从客户端接收对范围的读取请求，其中所述扩展区包括一组连续的块，并且所述读请求包括文件块号。 存储服务器从第一排序数据结构检索区段标识符，其中存储服务器使用接收到的文件块号来遍历第一排序数据结构到区段标识符。 存储服务器从第二排序数据结构检索对范围的引用，其中存储服务器使用所检索的扩展名标识符遍历到引用的第二排序数据结构，并且其中第二排序数据结构在多个卷中是全局的 。 存储服务器使用引用从存储设备检索范围，并将该范围返回给客户端。

公开(公告)号：WO2012019142A1

公开(公告)日：2012-02-09

申请号：PCT/US2011/046823

申请日：2011-08-05

Applicant: NETAPP, INC. ,  ZWISLER, Ross ,  MCKEAN, Brian ,  KIDNEY, Kevin

Inventor： ZWISLER, Ross ,  MCKEAN, Brian ,  KIDNEY, Kevin

IPC: G06F21/00

CPC classification number: G06F3/0608 ,  G06F3/064 ,  G06F3/0686 ,  G06F12/08

Abstract: The present invention is a system and method which allows for a VTL system that supports thin provisioning to implicitly unmap unused storage. Such unmap operations may occur even though the VTL system does not receive any explicit unmap requests from its initiators. For example, if a system administrator knows that once a virtual tape drive of the VTL system has been partially overwritten, all previously written data sets on that virtual tape drive will never again be accessed, the system administrator may configure the VTL system so that it unmaps the entire remainder of the virtual tape drive on the first data overwrite.

Abstract translation: 本发明是允许支持精简配置的VTL系统隐含地取消对未使用的存储器的映射的系统和方法。 即使VTL系统没有从其启动器接收到任何明确的未映射请求，也可能发生这种取消映射操作。 例如，如果系统管理员知道一旦VTL系统的虚拟磁带驱动器被部分覆盖，则该虚拟磁带驱动器上的所有先前写入的数据集将不再被访问，系统管理员可以配置VTL系统，使其 在第一个数据覆盖时，将虚拟磁带驱动器的剩余部分取消映射。

公开(公告)号：WO2011159689A1

公开(公告)日：2011-12-22

申请号：PCT/US2011/040332

申请日：2011-06-14

Applicant: NETAPP, INC. ,  JIBBE, Mahmoud K. ,  SENGUPTA, Dhishankar ,  GUNJAN, Madhukar ,  DHAR, Krishanu

Inventor： JIBBE, Mahmoud K. ,  SENGUPTA, Dhishankar ,  GUNJAN, Madhukar ,  DHAR, Krishanu

IPC: G06F15/16

CPC classification number: H04L61/2038 ,  G06F3/0607 ,  G06F3/0661 ,  G06F3/0689 ,  H04L61/106 ,  H04L67/1097 ,  H04L69/08

Abstract: A method and apparatus for enabling communication between iSCSI/SAS host devices and iSCSI/SAS target devices via an iSCSI/SAS router is disclosed. In one embodiment, an iSCSI/SAS router includes iSCSI interfaces, SAS interfaces, and a mapping and routing logic. The mapping and routing logic is coupled to the iSCSI interfaces and the SAS interfaces. The mapping and routing logic virtualizes one or more SAS host and target devices to communicate with discovered one or more iSCSI host and target devices. Further, the mapping and routing logic virtualizes the one or more iSCSI host and target devices to communicate with discovered one or more SAS host and target devices.

Abstract translation: 公开了一种通过iSCSI / SAS路由器实现iSCSI / SAS主机设备与iSCSI / SAS目标设备之间的通信的方法和装置。 在一个实施例中，iSCSI / SAS路由器包括iSCSI接口，SAS接口以及映射和路由逻辑。 映射和路由逻辑耦合到iSCSI接口和SAS接口。 映射和路由逻辑将一个或多个SAS主机和目标设备虚拟化，以与已发现的一个或多个iSCSI主机和目标设备进行通信。 此外，映射和路由逻辑虚拟化一个或多个iSCSI主机和目标设备以与已发现的一个或多个SAS主机和目标设备进行通信。

公开(公告)号：WO2011097235A1

公开(公告)日：2011-08-11

申请号：PCT/US2011/023355

申请日：2011-02-01

Applicant: NETAPP, INC. ,  KUMAR, Mohit ,  JAISWAL, Anuja ,  GADA, Jayesh

Inventor： KUMAR, Mohit ,  JAISWAL, Anuja ,  GADA, Jayesh

IPC: G06F3/06 ,  H04L29/08 ,  G06F17/30 ,  G06F21/00 ,  G06F11/07 ,  G06F1/14

CPC classification number: G06F3/0653 ,  G06F1/14 ,  G06F3/0619 ,  G06F3/0632 ,  G06F3/067 ,  G06F11/2023 ,  G06F21/64 ,  H04L67/1095 ,  H04L67/1097

Abstract: A method and system for providing an improved compliance clock service are described. An example method comprises establishing a system compliance clock (SCC) for a storage system that provides a compliant storage service, and establishing, for a volume in the storage system, a volume compliance clock (VCC). A current value of the SCC may be periodically updated based on hardware ticks monitored at the associated storage node. The volume compliance clock is to update its value based on a current value of the SCC.

Abstract translation: 描述了一种用于提供改进的合规性时钟服务的方法和系统。 一种示例性方法包括为提供兼容存储服务的存储系统建立系统合规时钟（SCC），以及为存储系统中的卷建立音量一致性时钟（VCC）。 可以基于在相关联的存储节点处监视的硬件刻度来周期性地更新SCC的当前值。 音量合规时钟是根据SCC的当前值更新其值。

公开(公告)号：WO2010036731A3

公开(公告)日：2010-06-10

申请号：PCT/US2009058087

申请日：2009-09-23

Applicant: NETAPP INC ,  BATSAKIS ALEXANDROS ,  KANEVSKY ARKADY ,  LENTINI JAMES ,  TALPEY THOMAS

Inventor： BATSAKIS ALEXANDROS ,  KANEVSKY ARKADY ,  LENTINI JAMES ,  TALPEY THOMAS

IPC: G06F15/16 ,  G06F9/06 ,  G06F13/14

CPC classification number: G06F9/505 ,  G06Q30/0601 ,  G06Q30/08 ,  G06Q40/00 ,  H04L67/1097

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以及客户端和服务器内存利用率提供了框架。 系统可以加速，推迟或取消异步请求，以提高应用感知性能。 通过在线拍卖的拥堵定价可以用来协调客户对系统资源的使用，客户可以发现短缺并调整其资源使用情况。

公开(公告)号：WO2010062544A2

公开(公告)日：2010-06-03

申请号：PCT/US2009/062035

申请日：2009-10-26

Applicant: NETAPP, INC. ,  KAMILA, Shailaja ,  VOLL, James J. ,  DEULGAONKAR, Ameet ,  PALSULE, Anurag ,  PADINJAREL, Ramanathan S.

Inventor： KAMILA, Shailaja ,  VOLL, James J. ,  DEULGAONKAR, Ameet ,  PALSULE, Anurag ,  PADINJAREL, Ramanathan S.

IPC: G06F15/17 ,  G06F15/16

CPC classification number: G06F3/0629 ,  G06F3/0605 ,  G06F3/0689 ,  G06F11/3409 ,  G06F11/3485 ,  G06F2201/81 ,  H04L43/0817 ,  H04L43/16 ,  H04L67/1097

Abstract: A system for managing configuration of a storage network having multiple storage resources is disclosed. The system uses a storage management policy to set parameters for detecting storage resource problems in the storage network. The system monitors the storage resources in the storage network based on the storage management policy. Based on the monitoring, the system detects limited storage resource conditions, and identifies one or more potential solutions to the condition. After identifying potential solutions, the system simulates effects on the storage resources of implementing individual solutions. Based on the simulations, the system then implements one or more selected solutions. These solutions may be selected automatically or by a user.

Abstract translation: 公开了一种用于管理具有多个存储资源的存储网络的配置的系统。 系统使用存储管理策略设置存储网络存储资源问题检测参数。 系统根据存储管理策略对存储网络中的存储资源进行监控。 基于监控，系统检测有限的存储资源条件，并识别一个或多个潜在的解决方案。 在识别出潜在的解决方案之后，系统会模拟对实现个别解决方案的存储资源的影响。 基于模拟，系统然后实现一个或多个选择的解决方案。 这些解决方案可以自动或由用户选择。

公开(公告)号：WO2010056748A1

公开(公告)日：2010-05-20

申请号：PCT/US2009/064030

申请日：2009-11-11

Applicant: NETAPP, INC. ,  ROBINSON, Matthew ,  LEARMONTH, Peter ,  STEWART, Michael ,  FORGETTE, Eric

Inventor： ROBINSON, Matthew ,  LEARMONTH, Peter ,  STEWART, Michael ,  FORGETTE, Eric

IPC: G06F9/50 ,  G06F9/455

CPC classification number: G06F9/45533 ,  G06F9/45558 ,  G06F9/485 ,  G06F9/5077 ,  G06F11/1469 ,  G06F17/30088

Abstract: While current solutions for cloning virtual machines can involve copying and duplicating files associated to a virtual machine (VM), systems and techniques can be devised to create thin clones of a VM using the VM's associated storage system to copy and deduplicate storage for the VMs. One can create a base VM in a directory of a storage container attached to a hypervisor, and then map the storage container to a volume on a storage system. One can clone the base VM using a snapshot of respective files associated to the base VM, which can comprise creating metadata that identified a physical storage location of the files. Further, the metadata can then be copied to a desired location on the storage container, to create a VM clone. Once copied, the cloned VM can be customized and registered within the hypervisor.

Abstract translation: 虽然克服虚拟机的当前解决方案可能涉及复制和复制与虚拟机（VM）关联的文件，但可以设计系统和技术，以使用虚拟机关联的存储系统创建虚拟机的薄克隆，以便为虚拟机复制和重复数据删除存储。 可以在连接到管理程序的存储容器的目录中创建基本VM，然后将存储容器映射到存储系统上的卷。 可以使用与基本VM相关联的相应文件的快照来克隆基本VM，其可以包括创建标识文件的物理存储位置的元数据。 此外，元数据然后可以被复制到存储容器上的期望位置，以创建VM克隆。 复制后，克隆的VM可以在管理程序中进行自定义和注册。