公开(公告)号：WO2008011103A2

公开(公告)日：2008-01-24

申请号：PCT/US2007016372

申请日：2007-07-18

Applicant: NETWORK APPLIANCE INC ,  NADATHUR GOKUL S ,  VAID ASEEM

Inventor： NADATHUR GOKUL S ,  VAID ASEEM

CPC classification number: G06F11/1461 ,  G06F11/1451 ,  G06F11/1458 ,  G06F11/1464 ,  G06F11/1662 ,  G06F11/2056

Abstract: A storage server creates a first mirror of a primary volume of data on a first storage set that includes at least one disk and creates a second mirror of the primary volume, on a second storage set that also includes at least one disk. The server then quiesces the second storage set. A user then decouples the second storage set from the server and transports the second storage set off-site. The storage server then saves one or more incremental backups of the primary volume on the first storage set according to a specified backup schedule. According to a specified rotation schedule, a user subsequently recouples the second storage set to the server. The server detects the recoupling and, in response, automatically resynchronizes the second mirror with the primary volume, and swaps the active-inactive statuses of the first and second mirrors. The process repeats as needed.

Abstract translation: 存储服务器在包括至少一个磁盘的第一存储集上创建主数据卷的第一镜像，并且在还包括至少一个磁盘的第二存储集上创建主卷的第二镜像。 然后，服务器静默第二个存储集。 然后用户将第二存储集与服务器分离并将第二存储集传输到场外。 然后，存储服务器根据指定的备份计划将主卷的一个或多个增量备份保存在第一个存储集上。 根据指定的轮换计划，用户随后将第二存储设备重新连接到服务器。 服务器检测到重新耦合，并作为响应自动将第二个镜像与主卷重新同步，并交换第一个和第二个镜像的活动 - 非活动状态。 该过程根据需要重复。

公开(公告)号：WO2008005211A2

公开(公告)日：2008-01-10

申请号：PCT/US2007/014664

申请日：2007-06-25

Applicant: NETWORK APPLIANCE, INC.

Inventor： ZHENG, Ling ,  FONG, Yinfung

CPC classification number: G06F17/30159 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/0689

Abstract: A system and method for calculating and storing block fingerprints for data dedu- plication. A fingerprint extraction layer generates a fingerprint of a predefined size, e.g., 64 bits, for each data block stored by a storage system. Each fingerprint is stored in a fingerprint record, and the fingerprint records are, in turn, stored in a fingerprint database for access by the data deduplication module. The data deduplication module may peri¬ odically compare the fingerprints to identify duplicate fingerprints, which, in turn, indi¬ cate duplicate data blocks.

Abstract translation: 一种用于计算和存储用于数据挖掘的块指纹的系统和方法。 指纹提取层针对由存储系统存储的每个数据块生成预定义大小的指纹，例如64位。 每个指纹被存储在指纹记录中，指纹记录又被存储在指纹数据库中以供重复数据删除模块访问。 重复数据删除模块可以对指纹进行比较，以识别重复的指纹，这反映了重复的数据块。

公开(公告)号：WO2007126513A3

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

申请号：PCT/US2007/005048

申请日：2007-02-26

Applicant: NETWORK APPLIANCE, INC.

Inventor： GOLE, Abhijeet ,  SARMA, Joydeep, Sen

IPC: G06F12/00

Abstract: A filer converts a traditional volume to a flexible volume by: creating an aggregate on storage devices other than the storage devices of the traditional volume; on the aggregate, creating a flexible volume large enough to store metadata describing files residing on the traditional volume; on the flexible volume, creating metadata structures that describe the files of the traditional volume, except that the metadata indicates that data blocks and indirect blocks are absent and must be fetched from another location. As the filer handles I/O requests directed to the flexible volume, the filer calculates physical volume block number (PVBN) addresses where the requested blocks would be located in the aggregate and replaces the absent pointers with the calculated addresses. After the absent pointers have been replaced, the filer adds the storage devices of the traditional volume.

公开(公告)号：WO2007100349A1

公开(公告)日：2007-09-07

申请号：PCT/US2006/032196

申请日：2006-08-17

Applicant: NETWORK APPLIANCE, INC. ,  SZELONG, Michael ,  SON, Keith

Inventor： SZELONG, Michael ,  SON, Keith

IPC: G06F1/16

CPC classification number: G06F1/18 ,  G06F1/187

Abstract: A chassis assembly and method for including a component carrier in an electronic device. The assembly may include a carrier for housing a component for integration into the system. The carrier includes a frame constructed to at least partially contain the electronic portions of the component. A handle is pivotally coupled to the frame. The handle may rotate between an engaging orientation and a securing orientation. A pinion portion is included on the handle and may engage with a corresponding rack in the chassis to control movement of the carrier with respect to the chassis. A securing mechanism is disposed on an end of the handle opposite the pinion portion and may be implemented to secure the handle in a securing orientation wherein the end of the handle is disposed adjacent the frame. A securing mechanism may be included to prevent rotation of the handle with respect to the frame.

Abstract translation: 一种用于在电子设备中包括部件载体的底盘组件和方法。 组件可以包括用于容纳用于集成到系统中的部件的载体。 载体包括构造成至少部分地包含部件的电子部分的框架。 手柄枢转地联接到框架。 手柄可以在接合方向和固定方向之间旋转。 小齿轮部分包括在手柄上并且可以与底盘中的对应的齿条接合，以控制托架相对于底盘的移动。 固定机构设置在手柄的与小齿轮部分相对的端部上，并且可以被实现为将手柄固定在固定方向上，其中手柄的端部邻近框架设置。 可以包括固定机构以防止手柄相对于框架旋转。

公开(公告)号：WO2007086844A3

公开(公告)日：2007-08-02

申请号：PCT/US2006/002725

申请日：2006-01-25

Applicant: NETWORK APPLIANCE, INC. ,  MERRICK, Jeffrey ,  MCGOVERN, William

Inventor： MERRICK, Jeffrey ,  MCGOVERN, William

IPC: G06F3/06

Abstract: A system is provided to commit data to persistent storage. The system comprises a configuration component to set an autocommit period, a scanner to detect that the autocommit period has expired for a file and a commit component to commit the file to write once read many (WORM) status In one embodiment, when an autocommit period is set, the system may be configured to automatically commit a file to WORM status if the file has not been changed for the autocommit period.

公开(公告)号：WO2007086844A2

公开(公告)日：2007-08-02

申请号：PCT/US2006002725

申请日：2006-01-25

Applicant: NETWORK APPLIANCE INC ,  MERRICK JEFFREY ,  MCGOVERN WILLIAM

Inventor： MERRICK JEFFREY ,  MCGOVERN WILLIAM

CPC classification number: G06F21/80 ,  G06F17/30085 ,  G06F17/30188 ,  G06F17/30227

Abstract: A system is provided to commit data to persistent storage. The system comprises a configuration component to set an autocommit period, a scanner to detect that the autocommit period has expired for a file and a commit component to commit the file to write once read many (WORM) status In one embodiment, when an autocommit period is set, the system may be configured to automatically commit a file to WORM status if the file has not been changed for the autocommit period.

Abstract translation: 提供一种系统将数据提交给持久存储。 该系统包括用于设置自动提交周期的配置组件，用于检测文件的自动提交周期已经期满的扫描器以及一旦读取许多（WORM）状态，提交组件提交文件以写入的一个。在一个实施例中，当自动提交周期 被设置，如果文件未被更改为自动提交期间，系统可能被配置为自动将文件提交到WORM状态。

公开(公告)号：WO2007053321A8

公开(公告)日：2007-08-02

申请号：PCT/US2006040851

申请日：2006-10-18

Applicant: NETWORK APPLIANCE INC

Inventor： GOLE ABHIJEET ,  HAMILTON ERIC

IPC: G06F17/30

CPC classification number: G06F11/2079 ,  G06F11/1471 ,  G06F11/2074 ,  Y10S707/99955

Abstract: A method and system mirror flexible volumes in a circular or bi-directional configuration, without creating a deadlock. A source filer maintains a number of log files on a destination filer, where the number of log files is greater than or equal to the number of cache flush operations the primary filer performs between cache flush operations on the destination filer. The source filer can create the log files in advance. Alternatively or in addition, the source filer can create the log files as needed, i.e., the source filer can create a log file when the source filer flushes its cache. Once the destination filer flushes its cache, the log files created prior to the destination filer cache flush can be deallocated or reused.

Abstract translation: 一种方法和系统以圆形或双向配置镜像灵活卷，而不会造成死锁。 源文件管理器在目标文件管理器上维护许多日志文件，其中日志文件的数量大于或等于主文件管理器在目标文件管理器上的高速缓存清除操作之间执行的高速缓存清除操作的数量。 源文件管理器可以预先创建日志文件。 或者或另外，源文件管理器可以根据需要创建日志文件，即当源文件管理器清除其缓存时，源文件管理器可以创建日志文件。 目标文件管理器清空其缓存后，可以释放或重用在目标文件管理器缓存刷新之前创建的日志文件。

公开(公告)号：WO2007078803A2

公开(公告)日：2007-07-12

申请号：PCT/US2006/047647

申请日：2006-12-14

Applicant: NETWORK APPLIANCE, INC. ,  CORBETT, Peter, F. ,  GOEL, Atul

Inventor： CORBETT, Peter, F. ,  GOEL, Atul

IPC: G06F11/10

CPC classification number: G06F11/1076 ,  G06F2211/1061

Abstract: A triple parity (TP) technique reduces overhead of computing diagonal and anti- diagonal parity for a storage array adapted to enable efficient recovery from the concurrent failure of three storage devices in the array. The diagonal parity is computed along diagonal parity sets that collectively span all data disks and a row parity disk of the array. The parity for all of the diagonal parity sets except one is stored on the diagonal parity disk. Similarly, the anti-diagonal parity is computed along anti-diagonal parity sets that collectively span all data disks and a row parity disk of the array. The parity for all of the anti-diagonal parity sets except one is stored on the anti-diagonal parity disk. The TP technique provides a uniform stripe depth and an optimal amount of parity information.

Abstract translation: 三重奇偶校验（TP）技术减少了针对阵列中的三个存储设备的并发故障进行有效恢复的存储阵列计算对角线和反对角奇偶校验的开销。 沿对角线奇偶校验集计算对角线奇偶校验集，该集合跨越阵列的所有数据磁盘和行奇偶校验磁盘。 所有对角奇偶校验集的奇偶校验除了一个存储在对角奇偶校验磁盘上。 类似地，反对角奇偶校验是沿着反对角奇偶校验集计算的，它们共同跨越阵列的所有数据盘和行奇偶校验盘。 所有反对角奇偶校验集的奇偶校验除了一个存储在反对角奇偶校验磁盘上。 TP技术提供均匀条纹深度和最优量的奇偶校验信息。

公开(公告)号：WO2007053356A3

公开(公告)日：2007-06-28

申请号：PCT/US2006041341

申请日：2006-10-23

Applicant: NETWORK APPLIANCE INC

Inventor： RAJAN VIJAYAN

IPC: G06F3/06 ,  H04L29/08

CPC classification number: G06F3/0635 ,  G06F3/0613 ,  G06F3/067 ,  H04L67/1097

Abstract: A Multi-Pathing Optimization Module (MPOM) interfaces with a client to route a data access request along a most optimal path to a storage system serving data container stored on a striped volume set (SVS). The MPOM constructs and references a Location Data Structure (LDS) containing striping rules associated with the SVS, a list of network elements (N-blades) operatively connected to the client, and a list of disk elements (D- blades) sharing a node of the storage system with the listed N-blades. The MPOM executes a Client_Locate( ) function on a per data access request basis to identify the D- blade serving the volume which will receive the request. When possible, the MPOM routes the data access request directly to the N-blade sharing a node with the identified D-blade, thereby using the most optimal path from the client to the SVS.

Abstract translation: 多路径优化模块（MPOM）与客户端连接以将数据访问请求沿着最优路径路由到服务于存储在条带卷集（SVS）上的数据容器的存储系统。 MPOM构造和参考包含与SVS相关联的条带化规则的位置数据结构（LDS），与客户端可操作地连接的网络元件（N-刀片）的列表以及共享节点的磁盘元件（D-刀片）的列表 具有所列N型刀片的存储系统。 MPOM根据每个数据访问请求执行Client_Locate（）函数，以识别服务于将接收请求的卷的D-刀片。 在可能的情况下，MPOM将数据访问请求直接路由到与所标识的D刀片共享节点的N刀片，从而使用从客户端到SVS的最优路径。

公开(公告)号：WO2005052855A3

公开(公告)日：2007-05-31

申请号：PCT/US2004039518

申请日：2004-11-24

Applicant: NETWORK APPLIANCE INC ,  CORBETT PETER F ,  ENGLISH ROBERT M ,  KLEIMAN STEVEN R

Inventor： CORBETT PETER F ,  ENGLISH ROBERT M ,  KLEIMAN STEVEN R

IPC: G06F11/10 ,  G11B20/18

CPC classification number: G06F11/1076 ,  G06F2211/1057

Abstract: A uniform and symmetric, double failure-correcting technique protects against two or fewer disk failures in a disk array of a storage system. A RAID system of the storage system generates two disks worth of "redundant" information for storage in the array, wherein the redundant information (e.g., parity) is illustratively derived from computations along both diagonal parity sets ("diagonals") and row parity sets ("rows"). Specifically, the RAID system computes row parity along rows of the array and diagonal parity along diagonals of the array. However, the contents of the redundant (parity) information disks interact such that neither disk contains purely (solely) diagonal or row redundancy information; the redundant information is generated using diagonal parity results in row parity computations (and vice versa).

Abstract translation: 统一和对称的双故障校正技术可保护存储系统的磁盘阵列中的两个或更少磁盘故障。 存储系统的RAID系统生成两个用于存储在阵列中的“冗余”信息的磁盘，其中冗余信息（例如，奇偶校验）从两个对角奇偶校验集（“对角线”）和行奇偶校验集 （ “行”）。 具体来说，RAID系统沿着阵列的行和阵列的对角线对角线奇偶校验来计算行奇偶校验。 然而，冗余（奇偶校验）信息磁盘的内容相互作用，使得两个磁盘都不包含纯（单独）对角线或行冗余信息; 使用行奇偶校验计算中的对角奇偶校验结果生成冗余信息（反之亦然）。