-
公开(公告)号：US10817393B2
公开(公告)日：2020-10-27
申请号：US16391842
申请日：2019-04-23
Applicant: NetApp, Inc.
Inventor： Dheeraj Raghavender Sangamkar , Song Guen Yoon , Emalayan Vairavanathan , Yi Zhang
IPC: G06F11/20 , G06F11/10 , H04L29/08 , G06F3/06 , G06F11/14 , G06F3/12 , H04L29/14 , H03M13/15 , G06F9/50
Abstract: To ensure that there is an elected manager among storage nodes of an erasure coding group (“ECG”), an ECG manager (“ECGM”) election process is periodically performed among available storage nodes that are configured with the software to perform the services of an ECGM. When a storage node is activated, an ECGM process of the storage node begins executing and is assigned a process identifier (“PID”). A storage node can utilize a service query framework to identify other available storage nodes and retrieve their ECGM PIDs. The storage node then selects a PID according to a criterion and elects the storage node corresponding to the selected PID to be the acting ECGM. This process is performed periodically, so even if the acting ECGM storage node fails, a new ECGM is eventually selected from the available storage nodes.
-
2.发明申请公开(公告)号：US20200057701A1
公开(公告)日：2020-02-20
申请号：US16665164
申请日：2019-10-28
Applicant: NetApp, Inc.
Inventor： Dheeraj Raghavender Sangamkar , Ajay Bakre , Vladimir Radu Avram , Emalayan Vairavanathan , Viswanath Chandrasekara Bharathi
IPC: G06F11/20 , G06F9/50 , H03M13/15 , H04L29/14 , G06F11/14 , G06F3/12 , G06F3/06 , H04L29/08 , G06F11/10
Abstract: Technology is disclosed for storing data in a distributed storage system using a virtual chunk service (VCS). In the VCS based storage technique, a storage node (“node”) is split into multiple VCSs and each of the VCSs can be assigned a unique ID in the distributed storage. A set of VCSs from a set of nodes form a storage group, which also can be assigned a unique ID in the distributed storage. When a data object is received for storage, a storage group is identified for the data object, the data object is encoded to generate multiple fragments and each fragment is stored in a VCS of the identified storage group. The data recovery process is made more efficient by using metadata, e.g., VCS to storage node mapping, storage group to VCS mapping, VCS to objects mapping, which eliminates resource intensive read and write operations during recovery.
-
公开(公告)号：US10353740B2
公开(公告)日：2019-07-16
申请号：US15589909
申请日：2017-05-08
Applicant: NetApp, Inc.
Inventor： Emalayan Vairavanathan , Dheeraj Raghavender Sangamkar , Song Guen Yoon , Yi Zhang
Abstract: To efficiently recover from a multiple storage node failure, a storage node concurrently restores data fragments to the multiple failed storage nodes, as opposed to restoring each node individually. In the VCS based storage technique, storage nodes are restored as part of an ECG repair process. For each ECG being repaired, a storage node performing the restoration process reads data fragments from active nodes in the ECG and generates new data fragments to replace any lost data fragments. The node then stores one of the new data fragments across each of the failed storage nodes. By concurrently restoring data fragments to each failed storage node, the data fragments needed to repair each ECG are only read once, thereby preserving disk operations and network bandwidth.
-
公开(公告)号：US20170242732A1
公开(公告)日：2017-08-24
申请号：US15589909
申请日：2017-05-08
Applicant: NetApp, Inc.
Inventor： Emalayan Vairavanathan , Dheeraj Raghavender Sangamkar , Song Guen Yoon , Yi Zhang
CPC classification number: G06F11/1076 , G06F3/0619 , G06F3/064 , G06F3/067 , G06F3/1234 , G06F9/5038 , G06F11/1402 , G06F11/1471 , G06F11/1489 , G06F11/20 , G06F11/2069 , G06F11/2092 , G06F2201/805 , G06F2201/85 , G06F2211/1028 , H03M13/154 , H04L67/1097 , H04L69/40
Abstract: To efficiently recover from a multiple storage node failure, a storage node concurrently restores data fragments to the multiple failed storage nodes, as opposed to restoring each node individually. In the VCS based storage technique, storage nodes are restored as part of an ECG repair process. For each ECG being repaired, a storage node performing the restoration process reads data fragments from active nodes in the ECG and generates new data fragments to replace any lost data fragments. The node then stores one of the new data fragments across each of the failed storage nodes. By concurrently restoring data fragments to each failed storage node, the data fragments needed to repair each ECG are only read once, thereby preserving disk operations and network bandwidth.
-
5.发明申请VIRTUAL CHUNK SERVICE BASED DATA RECOVERY IN A DISTRIBUTED DATA STORAGE SYSTEM 有权分布式数据存储系统中基于虚拟服务的数据恢复公开(公告)号：US20160246677A1
公开(公告)日：2016-08-25
申请号：US14696001
申请日：2015-04-24
Applicant: NetApp, Inc.
Inventor： Dheeraj Raghavender Sangamkar , Ajay Bakre , Vladimir Radu Avram , Emalayan Vairavanathan , Viswanath Chandrasekara Bharathi
CPC classification number: G06F11/1076 , G06F3/0619 , G06F3/064 , G06F3/067 , G06F3/1234 , G06F11/1402 , G06F11/1471 , G06F11/1489 , G06F2211/1028 , H04L67/1097
Abstract: Technology is disclosed for storing data in a distributed storage system using a virtual chunk service (VCS). In the VCS based storage technique, a storage node (“node”) is split into multiple VCSs and each of the VCSs can be assigned a unique ID in the distributed storage. A set of VCSs from a set of nodes form a storage group, which also can be assigned a unique ID in the distributed storage. When a data object is received for storage, a storage group is identified for the data object, the data object is encoded to generate multiple fragments and each fragment is stored in a VCS of the identified storage group. The data recovery process is made more efficient by using metadata, e.g., VCS to storage node mapping, storage group to VCS mapping, VCS to objects mapping, which eliminates resource intensive read and write operations during recovery.
Abstract translation: 公开了用于使用虚拟块服务（VCS）在分布式存储系统中存储数据的技术。 在基于VCS的存储技术中，存储节点（“节点”）被分成多个VCS，并且可以在分布式存储器中为每个VCS分配唯一的ID。 来自一组节点的一组VCS形成存储组，也可以在分布式存储器中分配唯一的ID。 当接收到数据对象进行存储时，为数据对象识别存储组，对数据对象进行编码以生成多个片段，并将每个片段存储在所识别的存储组的VCS中。 通过使用元数据（例如VCS到存储节点映射，存储组到VCS映射，VCS到对象映射），可以使数据恢复过程更加高效，从而消除了恢复期间的资源密集型读写操作。
-
Patent Agency Ranking
公开(公告)号：US11656962B2
公开(公告)日：2023-05-23
申请号：US17657786
申请日：2022-04-04
Applicant: NetApp, Inc.
CPC classification number: G06F11/2094 , G06F11/1076 , G06F11/1088 , H03M13/154 , H03M13/373 , H03M13/3761 , G06F2201/805 , G06F2201/82
Abstract: Distributed storage systems frequently use a centralized metadata repository that stores metadata in an eventually consistent distributed database. However, a metadata repository cannot be relied upon for determining which erasure coded fragments are lost because of a storage node(s) failures. Instead, when recovering a failed storage node, a list of missing fragments is generated based on fragments stored in storage devices of available storage nodes. A storage node performing the recovery sends a request to one or more of the available storage nodes for a fragment list. The fragment list is generated, not based on a metadata database, but on scanning storage devices for fragments related to the failed storage node. The storage node performing the recovery merges retrieved lists to create a master list indicating fragments that should be regenerated for recovery of the failed storage node(s).
-
公开(公告)号：US10365848B2
公开(公告)日：2019-07-30
申请号：US15338077
申请日：2016-10-28
Applicant: NetApp, Inc.
Inventor： Tymoteusz Altman , Yi Zhang , Dheeraj Raghavender Sangamkar , Emalayan Vairavanathan
IPC: G06F3/06
Abstract: Techniques are described for reserving space on a destination node or volume for increasing the likelihood of a successful data transfer in a distributed storage environment. A reservation may be retried at one or more destinations if the reservation fails at a first destination. In some embodiments, the data-transfer process can be paused or terminated prior to data being transferred to one or more destinations if a reservation fails. Reserving space on a destination node or volume can increase the likelihood of a successful data transfer, which can increase the likelihood of efficient resources usage in a storage system.
-
8.发明申请公开(公告)号：US20190205209A1
公开(公告)日：2019-07-04
申请号：US16210718
申请日：2018-12-05
Applicant: NetApp, Inc.
Inventor： Dheeraj Raghavender Sangamkar , Ajay Bakre , Vladimir Radu Avram , Emalayan Vairavanathan , Viswanath Chandrasekara Bharathi
CPC classification number: G06F11/1076 , G06F3/0619 , G06F3/064 , G06F3/067 , G06F3/1234 , G06F9/5038 , G06F11/1402 , G06F11/1471 , G06F11/1489 , G06F11/20 , G06F11/2069 , G06F11/2092 , G06F2201/805 , G06F2201/85 , G06F2211/1028 , H03M13/154 , H04L67/1097 , H04L69/40
Abstract: Technology is disclosed for storing data in a distributed storage system using a virtual chunk service (VCS). In the VCS based storage technique, a storage node (“node”) is split into multiple VCSs and each of the VCSs can be assigned a unique ID in the distributed storage. A set of VCSs from a set of nodes form a storage group, which also can be assigned a unique ID in the distributed storage. When a data object is received for storage, a storage group is identified for the data object, the data object is encoded to generate multiple fragments and each fragment is stored in a VCS of the identified storage group. The data recovery process is made more efficient by using metadata, e.g., VCS to storage node mapping, storage group to VCS mapping, VCS to objects mapping, which eliminates resource intensive read and write operations during recovery.
-
公开(公告)号：US20190155708A1
公开(公告)日：2019-05-23
申请号：US15820518
申请日：2017-11-22
Applicant: NetApp, Inc.
Abstract: Distributed storage systems frequently use a centralized metadata repository that stores metadata in an eventually consistent distributed database. However, a metadata repository cannot be relied upon for determining which erasure coded fragments are lost because of a storage node(s) failures. Instead, when recovering a failed storage node, a list of missing fragments is generated based on fragments stored in storage devices of available storage nodes. A storage node performing the recovery sends a request to one or more of the available storage nodes for a fragment list. The fragment list is generated, not based on a metadata database, but on scanning storage devices for fragments related to the failed storage node. The storage node performing the recovery merges retrieved lists to create a master list indicating fragments that should be regenerated for recovery of the failed storage node(s).
-
10.发明申请公开(公告)号：US20180165155A1
公开(公告)日：2018-06-14
申请号：US15890913
申请日：2018-02-07
Applicant: NetApp, Inc.
Inventor： Dheeraj Raghavender Sangamkar , Ajay Bakre , Vladimir Radu Avram , Emalayan Vairavanathan , Viswanath Chandrasekara Bharathi
CPC classification number: G06F11/1076 , G06F3/0619 , G06F3/064 , G06F3/067 , G06F3/1234 , G06F11/1402 , G06F11/1471 , G06F11/1489 , G06F2211/1028 , H04L67/1097
Abstract: Technology is disclosed for storing data in a distributed storage system using a virtual chunk service (VCS). In the VCS based storage technique, a storage node (“node”) is split into multiple VCSs and each of the VCSs can be assigned a unique ID in the distributed storage. A set of VCSs from a set of nodes form a storage group, which also can be assigned a unique ID in the distributed storage. When a data object is received for storage, a storage group is identified for the data object, the data object is encoded to generate multiple fragments and each fragment is stored in a VCS of the identified storage group. The data recovery process is made more efficient by using metadata, e.g., VCS to storage node mapping, storage group to VCS mapping, VCS to objects mapping, which eliminates resource intensive read and write operations during recovery.
-
-
-
-
-
-
-
-
-
Search Results
33
records
(took 0.016 seconds)
