-
公开(公告)号：US10929043B2
公开(公告)日：2021-02-23
申请号：US16505339
申请日：2019-07-08
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.
-
公开(公告)号：US20200278913A1
公开(公告)日：2020-09-03
申请号：US16878220
申请日：2020-05-19
Applicant: NetApp, Inc.
Inventor： Ajay Bakre , Vishnu Vardhan Chandra Kumaran , Alvin Lam , Emalayan Vairavanathan , Viswanath Chandrasekara Bharathi , Vladimir Avram , Dheeraj Raghavender Sangamkar , Oliver Seiler , Carmen Lum
Abstract: A storage management computing device obtains an information lifecycle management (ILM) policy. A data protection scheme to be applied at a storage node computing device level is determined and a plurality of storage node computing devices are identified based on an application of the ILM policy to metadata received from one of the storage node computing devices and associated with an object ingested by the one of the storage node computing devices. The one of the storage node computing devices is instructed to generate one or more copies of the object or fragments of the object according to the data protection scheme and to distribute the object copies or one of the object fragments to one or more other of the storage node computing devices to be stored by at least the one or more other storage node computing devices on one or more disk storage devices.
-
公开(公告)号：US20200034256A1
公开(公告)日：2020-01-30
申请号：US16460404
申请日：2019-07-02
Applicant: NetApp, Inc.
Inventor： Emalayan Vairavanathan , Dheeraj Raghavender Sangamkar , Song Guen Yoon , Yi Zhang
IPC: G06F11/20 , G06F11/10 , H04L29/08 , G06F3/06 , G06F11/14 , G06F3/12 , H04L29/14 , H03M13/15 , G06F9/50
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.
-
公开(公告)号：US10152377B2
公开(公告)日：2018-12-11
申请号：US15890913
申请日：2018-02-07
Applicant: NetApp, Inc.
Inventor： Dheeraj Raghavender Sangamkar , Ajay Bakre , Vladimir Radu Avram , Emalayan Vairavanathan , Viswanath Chandrasekara Bharathi
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.
-
公开(公告)号：US09921910B2
公开(公告)日：2018-03-20
申请号：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.
-
Patent Agency Ranking
公开(公告)号：US20170161148A1
公开(公告)日：2017-06-08
申请号：US15275046
申请日：2016-09-23
Applicant: NetApp, Inc.
CPC classification number: G06F11/1435 , G06F11/1004 , G06F11/1076 , G06F2211/109
Abstract: Techniques are disclosed for detection of loss or corruption among data chunks (i.e. silent data loss) corresponding to an object stored in an erasure-coded storage system. In one embodiment, one of the data chunks stored in a storage node is selected for integrity verification. The storage node computes a current checksum for the selected data chunk. The integrity of the data chunk is determined based upon a comparison of the current checksum for the data chunk with a stored checksum for the data chunk. In response to the checksums differing, the storage node requests recovery of the data chunk from the erasure-coded storage system. The data chunk is stored by the storage node if the data chunk is recovered.
-
公开(公告)号：US20170160982A1
公开(公告)日：2017-06-08
申请号：US15338077
申请日：2016-10-28
Applicant: NetApp, Inc.
Inventor： Tymoteusz Altman , Yi Zhang , Dheeraj Raghavender Sangamkar , Emalayan Vairavanathan
IPC: G06F3/06
CPC classification number: G06F3/0644 , G06F3/061 , G06F3/0631 , G06F3/067
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.
-
公开(公告)号：US11740826B2
公开(公告)日：2023-08-29
申请号：US17657449
申请日：2022-03-31
Applicant: NetApp, Inc.
Inventor： Ajay Bakre , Vishnu Vardhan Chandra Kumaran , Alvin Lam , Emalayan Vairavanathan , Viswanath Chandrasekara Bharathi , Vladimir Avram , Dheeraj Raghavender Sangamkar , Oliver Seiler , Carmen Lum
CPC classification number: G06F3/0649 , G06F3/065 , G06F3/067 , G06F3/0616 , G06F11/1076 , G06F11/1088 , G06F11/1092 , G06F11/2094 , H03M13/154 , H03M13/373 , H03M13/3761 , G06F2201/805 , G06F2201/82
Abstract: A storage management computing device obtains an information lifecycle management (ILM) policy. A data protection scheme to be applied at a storage node computing device level is determined and a plurality of storage node computing devices are identified based on an application of the ILM policy to metadata received from one of the storage node computing devices and associated with an object ingested by the one of the storage node computing devices. The one of the storage node computing devices is instructed to generate one or more copies of the object or fragments of the object according to the data protection scheme and to distribute the object copies or one of the object fragments to one or more other of the storage node computing devices to be stored by at least the one or more other storage node computing devices on one or more disk storage devices.
-
公开(公告)号：US20220229749A1
公开(公告)日：2022-07-21
申请号：US17657786
申请日：2022-04-04
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).
-
公开(公告)号：US11372738B2
公开(公告)日：2022-06-28
申请号：US16711513
申请日：2019-12-12
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).
-
-
-
-
-
-
-
-
-
Search Results
33
records
(took 0.021 seconds)
