-
公开(公告)号：US20170149883A1
公开(公告)日：2017-05-25
申请号：US14948147
申请日：2015-11-20
Applicant: DataDirect Networks, Inc.
Inventor： Rajkumar Joshi , David Fellinger , Dan Olster
IPC: H04L29/08
CPC classification number: H04L67/1095 , G06F3/0605 , G06F3/0631 , G06F3/0647 , G06F3/067 , H04L67/1097 , H04L67/16
Abstract: Systems and methods for data replication in a data storage system having a disjointed network are described herein. The data storage system includes a plurality of clusters each having at least one stationary zone. The data storage system further includes at least one movable zone. Each zone has a plurality of storage nodes, and each storage node has a plurality of storage devices. The system provides for replication according to policies associated with data objects such that data items are stored among a plurality of zones. Movable zone that are disconnected from and reconnected to the other zones and clusters in the storage system are supported.
-
公开(公告)号：US09189493B2
公开(公告)日：2015-11-17
申请号：US14498917
申请日：2014-09-26
Applicant: DataDirect Networks, Inc.
Inventor： Jan Olderdissen , Dan Olster , Craig Robertson , Doug Schafer , Dave Fellinger
CPC classification number: G06F17/30182 , G06F11/1076 , G06F17/30218 , G06F17/30864 , G06F2211/1038 , H04L67/1097
Abstract: An object based file system for storing and accessing objects is disclosed. The file system may be implemented as a method in hardware, firmware, software, or a combination thereof. The method may include receiving from an application program an object write request. A selected storage node on which to store the object may be selected, including identifying a least busy storage node and/or a least full storage node. The object and the object write request may be sent to the selected storage node. A write success message may be received from the selected storage node. The successful writing of the object may be reported to the application program.
Abstract translation: 公开了一种用于存储和访问对象的基于对象的文件系统。 文件系统可以以硬件，固件，软件或其组合的方式实现。 该方法可以包括从应用程序接收对象写入请求。 可以选择在其上存储对象的所选择的存储节点，包括识别最不繁忙的存储节点和/或最小完整存储节点。 对象和对象写入请求可以被发送到所选择的存储节点。 可以从所选择的存储节点接收写入成功消息。 对象的成功写入可能会报告给应用程序。
-
公开(公告)号：US20150019598A1
公开(公告)日：2015-01-15
申请号：US14498917
申请日：2014-09-26
Applicant: DataDirect Networks, Inc.
Inventor： Jan Olderdissen , Dan Olster , Craig Robertson , Doug Schafer , Dave Fellinger
CPC classification number: G06F17/30182 , G06F11/1076 , G06F17/30218 , G06F17/30864 , G06F2211/1038 , H04L67/1097
Abstract: An object based file system for storing and accessing objects is disclosed. The file system may be implemented as a method in hardware, firmware, software, or a combination thereof. The method may include receiving from an application program an object write request. A selected storage node on which to store the object may be selected, including identifying a least busy storage node and/or a least full storage node. The object and the object write request may be sent to the selected storage node. A write success message may be received from the selected storage node. The successful writing of the object may be reported to the application program.
Abstract translation: 公开了一种用于存储和访问对象的基于对象的文件系统。 文件系统可以以硬件，固件，软件或其组合的方式实现。 该方法可以包括从应用程序接收对象写入请求。 可以选择在其上存储对象的所选择的存储节点，包括识别最不繁忙的存储节点和/或最小完整存储节点。 对象和对象写入请求可以被发送到所选择的存储节点。 可以从所选择的存储节点接收写入成功消息。 对象的成功写入可能会报告给应用程序。
-
公开(公告)号：US20140380093A1
公开(公告)日：2014-12-25
申请号：US14482441
申请日：2014-09-10
Applicant: DataDirect Networks, Inc.
Inventor： Donald J. Molaro , David Fellinger , Adam Fried-Gintis , Dan Olster
IPC: G06F11/10
CPC classification number: G06F11/1088 , G06F3/0617 , G06F3/0619 , G06F3/0637 , G06F3/065 , G06F3/0665 , G06F3/067 , G06F11/1076 , G06F11/108 , G06F11/1096
Abstract: A resilient distributed replicated data storage system is described herein. The storage system includes zones that are independent, and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When a data item is stored, it is partitioned into a plurality of data objects and a plurality of parity objects are calculated. Reassembly instructions are created for the data item. The data objects, parity objects and reassembly instructions are spread across nodes and zones in the storage system according to a policy for the data item. When a zone is inaccessible, a virtual zone is created and used until the intended zone is available. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions, and a virtual zone is accessed in place of a real zone when the real zone is inaccessible.
-
公开(公告)号：US09223654B2
公开(公告)日：2015-12-29
申请号：US14482441
申请日：2014-09-10
Applicant: DataDirect Networks, Inc.
Inventor： Donald J. Molaro , David Fellinger , Adam Fried-Gintis , Dan Olster
CPC classification number: G06F11/1088 , G06F3/0617 , G06F3/0619 , G06F3/0637 , G06F3/065 , G06F3/0665 , G06F3/067 , G06F11/1076 , G06F11/108 , G06F11/1096
Abstract: A resilient distributed replicated data storage system is described herein. The storage system includes zones that are independent, and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When a data item is stored, it is partitioned into a plurality of data objects and a plurality of parity objects are calculated. Reassembly instructions are created for the data item. The data objects, parity objects and reassembly instructions are spread across nodes and zones in the storage system according to a policy for the data item. When a zone is inaccessible, a virtual zone is created and used until the intended zone is available. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions, and a virtual zone is accessed in place of a real zone when the real zone is inaccessible.
Abstract translation: 这里描述了一种有弹性的分布式复制数据存储系统。 存储系统包括彼此独立的并且彼此自主的区域。 这些区域包括独立和自主的节点。 节点包括存储设备。 当存储数据项时，将其划分为多个数据对象，并且计算多个奇偶校验对象。 为数据项创建重新组装说明。 数据对象，奇偶校验对象和重组指令根据数据项的策略分布在存储系统中的节点和区域之间。 当区域不可访问时，将创建并使用虚拟区域，直到预期的区域可用。 当接收到读取请求时，根据重新组装指令从最低延迟节点准备数据项，并且当实际区域不可访问时，访问虚拟区域来代替实际区域。
-
Patent Agency Ranking
公开(公告)号：US20140173235A1
公开(公告)日：2014-06-19
申请号：US14136254
申请日：2013-12-20
Applicant: DataDirect Networks, Inc.
Inventor： Donald J. Molaro , David Fellinger , Adam Fried-Gintis , Dan Olster
IPC: G06F3/06
CPC classification number: G06F11/1088 , G06F3/0617 , G06F3/0619 , G06F3/0637 , G06F3/065 , G06F3/0665 , G06F3/067 , G06F11/1076 , G06F11/108 , G06F11/1096
Abstract: A resilient distributed replicated data storage system is described herein. The storage system includes zones that are independent, and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When a data item is stored, it is partitioned into a plurality of data objects and a plurality of parity objects are calculated. Reassembly instructions are created for the data item. The data objects, parity objects and reassembly instructions are spread across nodes and zones in the storage system according to a policy for the data item. When a zone is inaccessible, a virtual zone is created and used until the intended zone is available. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions, and a virtual zone is accessed in place of a real zone when the real zone is inaccessible.
Abstract translation: 这里描述了一种有弹性的分布式复制数据存储系统。 存储系统包括彼此独立的并且彼此自主的区域。 这些区域包括独立和自主的节点。 节点包括存储设备。 当存储数据项时，将其划分为多个数据对象，并且计算多个奇偶校验对象。 为数据项创建重新组装说明。 数据对象，奇偶校验对象和重组指令根据数据项的策略分布在存储系统中的节点和区域之间。 当区域不可访问时，将创建并使用虚拟区域，直到预期的区域可用。 当接收到读取请求时，根据重新组装指令从最低延迟节点准备数据项，并且当实际区域不可访问时，访问虚拟区域来代替实际区域。
-
公开(公告)号：US20170031671A1
公开(公告)日：2017-02-02
申请号：US14811406
申请日：2015-07-28
Applicant: DataDirect Networks, Inc.
Inventor： Rajkumar Joshi , David Fellinger , Dan Olster
CPC classification number: G06F8/65 , G06F3/0604 , G06F3/0629 , G06F3/0653 , G06F3/0683 , G06F8/654 , G06F11/1469 , G06F17/30117 , G06F2201/84
Abstract: Systems and methods for automated firmware update with rollback are described herein. The systems include a plurality of storage zones, each storage zone including a plurality of storage nodes, each storage node including a plurality of storage media. The method includes monitoring storage system activity and parameters and maintaining a data storage system usage and parameter database containing system activity information. When a firmware update is available, data storage system activity is evaluated. Storage nodes needing the firmware update are identified. The firmware update is run on available storage nodes identified as needing the firmware update. The impact of the firmware update is evaluated and a rollback of the firmware update is initiated on all firmware updated storage nodes when parameter variations are significant and/or result in degraded performance.
Abstract translation: 本文描述了具有回滚的自动固件更新的系统和方法。 这些系统包括多个存储区，每个存储区包括多个存储节点，每个存储节点包括多个存储介质。 该方法包括监视存储系统活动和参数，并维护包含系统活动信息的数据存储系统使用情况和参数数据库。 固件更新可用时，将对数据存储系统活动进行评估。 识别需要固件更新的存储节点。 固件更新是在需要固件更新标识的可用存储节点上运行。 评估固件更新的影响，并且当参数变化很大和/或导致性能下降时，在所有固件更新的存储节点上启动固件更新的回滚。
-
公开(公告)号：US20150370637A1
公开(公告)日：2015-12-24
申请号：US14841484
申请日：2015-08-31
Applicant: DataDirect Networks, Inc.
Inventor： Donald J. Molaro , David Fellinger , Dan Olster , Adam Fried-Gintis
CPC classification number: G06F11/1076 , G06F17/30215 , H03M13/1515 , H03M13/373 , H04L67/1097
Abstract: A failure resilient distributed replicated data storage system is described herein. The storage system includes zones that are independent, and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When a data item is stored, it is partitioned into a plurality of data objects and a plurality of parity objects calculated. Reassembly instructions are created for the data item. The data objects and parity objects are spread across all nodes and zones in the storage system. Reassembly instructions are also spread across the zones. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions. This provides for data resiliency while keeping the amount of storage space required relatively low.
Abstract translation: 本文描述了故障弹性分布式复制数据存储系统。 存储系统包括彼此独立的并且彼此自主的区域。 这些区域包括独立和自主的节点。 节点包括存储设备。 当存储数据项时，将其划分为多个数据对象，并计算多个奇偶校验对象。 为数据项创建重新组装说明。 数据对象和奇偶校验对象分布在存储系统中的所有节点和区域之间。 重新组装说明也分布在各个区域之间。 当接收到读取请求时，根据重新组装指令从最低延迟节点准备数据项。 这提供了数据弹性，同时保持所需的存储空间量相对较低。
-
公开(公告)号：US09177034B2
公开(公告)日：2015-11-03
申请号：US13966108
申请日：2013-08-13
Applicant: DataDirect Networks, Inc.
Inventor： Dan Olster , Adam M. Fried-Gintis , Donald J. Molaro
IPC: G06F17/30
CPC classification number: G06F17/30575 , G06F17/30545
Abstract: A searchable data storage system is described herein. The storage system includes zones that are independent, and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When a data item is stored, a local database is updated with information about the newly stored data item. When a search for a data item meeting certain metadata criteria is received, multiple concurrent searches are conducted across all storage devices in all nodes in all zones of the storage system. The configuration of the data storage system allows a parallel concurrent search at constituent storage devices to be performed quickly.
Abstract translation: 这里描述了可搜索的数据存储系统。 存储系统包括彼此独立的并且彼此自主的区域。 这些区域包括独立和自主的节点。 节点包括存储设备。 当存储数据项时，使用关于新存储的数据项的信息更新本地数据库。 当接收到满足某些元数据标准的数据项的搜索时，在存储系统的所有区域中的所有节点中的所有存储设备上进行多次并发搜索。 数据存储系统的配置允许快速执行构成存储设备的并行并发搜索。
-
公开(公告)号：US09189494B2
公开(公告)日：2015-11-17
申请号：US14498923
申请日：2014-09-26
Applicant: DataDirect Networks, Inc.
Inventor： Jan Olderdissen , Dan Olster , Craig Robertson , Doug Schafer , Dave Fellinger
CPC classification number: G06F17/30182 , G06F11/1076 , G06F17/30218 , G06F17/30864 , G06F2211/1038 , H04L67/1097
Abstract: An object based file system for storing and accessing objects is disclosed. The file system may be implemented as a method in hardware, firmware, software, or a combination thereof. The method may include receiving from an application program an object write request. A selected storage node on which to store the object may be selected, including identifying a least busy storage node and/or a least full storage node. The object and the object write request may be sent to the selected storage node. A write success message may be received from the selected storage node. The successful writing of the object may be reported to the application program.
-
-
-
-
-
-
-
-
-
Search Results
19
records
(took 0.014 seconds)
