Patents by Inventor Parag Deshmukh
Parag Deshmukh has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 12271614Abstract: Techniques are provided for aggregate inline deduplication and volume granularity encryption. For example, data that is exclusive to a volume of a tenant is encrypted using an exclusive encryption key accessible to the tenant. The exclusive encryption key of that tenant is inaccessible to other tenants. Shared data that has been deduplicated and shared between the volume and another volume of a different tenant is encrypted using a shared encryption key of the volume. The shared encryption key is made available to other tenants. In this way, data can be deduplicated across multiple volumes of different tenants of a storage environment, while maintaining security and data privacy at a volume level.Type: GrantFiled: May 26, 2023Date of Patent: April 8, 2025Assignee: NetApp, Inc.Inventors: Srinivasan Narayanamurthy, Dnyaneshwar Nagorao Pawar, Jagadish Vasudeva, Parag Deshmukh, Siddhartha Nandi
-
Publication number: 20250036597Abstract: Systems and methods for reducing read application in a virtual storage system are provided. According to one embodiment, heuristic data may be tracked and utilized in real-time by a file system of the virtual storage system at the level of granularity of a volume, thereby allowing a fast path flag to be enabled/disabled at a volume level during various phases of operation of a workload. The heuristic data for a given volume may be indicative of a correlation between (i) data blocks stored on the given volume being located within a compressible zone of a zoned checksum scheme and (ii) the respective data blocks containing compressed data and a corresponding checksum. Based on the heuristic data, read requests may be selectively directed to the read path (e.g., a fast path or a slow path) expected to mitigate read amplification when data compression is enabled for a zoned checksum scheme.Type: ApplicationFiled: October 16, 2024Publication date: January 30, 2025Applicant: NetApp, Inc.Inventors: Ritika, Jagadish Vasudeva, Vani Vully, Raj Kamal, Deepak Dangi, Parag Deshmukh
-
Publication number: 20250021254Abstract: Systems and methods for reducing read application in a virtual storage system are provided. According to one embodiment, read amplification is reduced when AZCS compression is being utilized by avoiding restarting of a read process via a slow path via a RAID layer of the virtual storage system when a data block associated with a read request and obtained via a first fast path read has been found not to be compressed. Instead, a second fast path read may be performed to obtain the corresponding checksum. Alternatively, or additionally, heuristics may be used to predict the odds of the data block being compressed. For example, when information encoded within a PVBN of the data block that identifies the PVBN as being within a compressed AZCS zone has shown to be sufficiently/insufficiently predictive of the data block being compressed, then a flag may be set to enable/disable fast path reads.Type: ApplicationFiled: July 22, 2024Publication date: January 16, 2025Applicant: NetApp, Inc.Inventors: Ritika, Jagadish Vasudeva, Vani Vully, Raj Kamai, Deepak Dangi, Parag Deshmukh
-
Patent number: 12124413Abstract: Systems and methods for reducing read application in a virtual storage system are provided. According to one embodiment, heuristic data may be tracked and utilized in real-time by a file system of the virtual storage system at the level of granularity of a volume, thereby allowing a fast path flag to be enabled/disabled at a volume level during various phases of operation of a workload. The heuristic data for a given volume may be indicative of a correlation between (i) data blocks stored on the given volume being located within a compressible zone of a zoned checksum scheme and (ii) the respective data blocks containing compressed data and a corresponding checksum. Based on the heuristic data, read requests may be selectively directed to the read path (e.g., a fast path or a slow path) expected to mitigate read amplification when data compression is enabled for a zoned checksum scheme.Type: GrantFiled: March 30, 2022Date of Patent: October 22, 2024Assignee: NetApp, Inc.Inventors: Ritika, Jagadish Vasudeva, Vani Vully, Raj Kamal, Deepak Dangi, Parag Deshmukh
-
Patent number: 12045481Abstract: Systems and methods for reducing read application in a virtual storage system are provided. According to one embodiment, read amplification is reduced when AZCS compression is being utilized by avoiding restarting of a read process via a slow path via a RAID layer of the virtual storage system when a data block associated with a read request and obtained via a first fast path read has been found not to be compressed. Instead, a second fast path read may be performed to obtain the corresponding checksum. Alternatively, or additionally, heuristics may be used to predict the odds of the data block being compressed. For example, when information encoded within a PVBN of the data block that identifies the PVBN as being within a compressed AZCS zone has shown to be sufficiently/insufficiently predictive of the data block being compressed, then a flag may be set to enable/disable fast path reads.Type: GrantFiled: March 30, 2022Date of Patent: July 23, 2024Assignee: NetApp, Inc.Inventors: Ritika, Jagadish Vasudeva, Vani Vully, Raj Kamal, Deepak Dangi, Parag Deshmukh
-
Publication number: 20230315315Abstract: Systems and methods for reducing read application in a virtual storage system are provided. According to one embodiment, read amplification is reduced when AZCS compression is being utilized by avoiding restarting of a read process via a slow path via a RAID layer of the virtual storage system when a data block associated with a read request and obtained via a first fast path read has been found not to be compressed. Instead, a second fast path read may be performed to obtain the corresponding checksum. Alternatively, or additionally, heuristics may be used to predict the odds of the data block being compressed. For example, when information encoded within a PVBN of the data block that identifies the PVBN as being within a compressed AZCS zone has shown to be sufficiently/insufficiently predictive of the data block being compressed, then a flag may be set to enable/disable fast path reads.Type: ApplicationFiled: March 30, 2022Publication date: October 5, 2023Inventors: Ritika, Jagadish Vasudeva, Vani Vully, Raj Kamal, Deepak Dangi, Parag Deshmukh
-
Publication number: 20230315691Abstract: Systems and methods for reducing read application in a virtual storage system are provided. According to one embodiment, heuristic data may be tracked and utilized in real-time by a file system of the virtual storage system at the level of granularity of a volume, thereby allowing a fast path flag to be enabled/disabled at a volume level during various phases of operation of a workload. The heuristic data for a given volume may be indicative of a correlation between (i) data blocks stored on the given volume being located within a compressible zone of a zoned checksum scheme and (ii) the respective data blocks containing compressed data and a corresponding checksum. Based on the heuristic data, read requests may be selectively directed to the read path (e.g., a fast path or a slow path) expected to mitigate read amplification when data compression is enabled for a zoned checksum scheme.Type: ApplicationFiled: March 30, 2022Publication date: October 5, 2023Inventors: Ritika, Jagadish Vasudeva, Vani Vully, Raj Kamal, Deepak Dangi, Parag Deshmukh
-
Publication number: 20230297264Abstract: Techniques are provided for aggregate inline deduplication and volume granularity encryption. For example, data that is exclusive to a volume of a tenant is encrypted using an exclusive encryption key accessible to the tenant. The exclusive encryption key of that tenant is inaccessible to other tenants. Shared data that has been deduplicated and shared between the volume and another volume of a different tenant is encrypted using a shared encryption key of the volume. The shared encryption key is made available to other tenants. In this way, data can be deduplicated across multiple volumes of different tenants of a storage environment, while maintaining security and data privacy at a volume level.Type: ApplicationFiled: May 26, 2023Publication date: September 21, 2023Inventors: Srinivasan Narayanamurthy, Dnyaneshwar Nagorao Pawar, Jagadish Vasudeva, Parag Deshmukh, Siddhartha Nandi
-
Patent number: 11662930Abstract: Techniques are provided for aggregate inline deduplication and volume granularity encryption. For example, data that is exclusive to a volume of a tenant is encrypted using an exclusive encryption key accessible to the tenant. The exclusive encryption key of that tenant is inaccessible to other tenants. Shared data that has been deduplicated and shared between the volume and another volume of a different tenant is encrypted using a shared encryption key of the volume. The shared encryption key is made available to other tenants. In this way, data can be deduplicated across multiple volumes of different tenants of a storage environment, while maintaining security and data privacy at a volume level.Type: GrantFiled: February 21, 2022Date of Patent: May 30, 2023Assignee: NetApp, Inc.Inventors: Srinivasan Narayanamurthy, Dnyaneshwar Nagorao Pawar, Jagadish Vasudeva, Parag Deshmukh, Siddhartha Nandi
-
Publication number: 20220171557Abstract: Techniques are provided for aggregate inline deduplication and volume granularity encryption. For example, data that is exclusive to a volume of a tenant is encrypted using an exclusive encryption key accessible to the tenant. The exclusive encryption key of that tenant is inaccessible to other tenants. Shared data that has been deduplicated and shared between the volume and another volume of a different tenant is encrypted using a shared encryption key of the volume. The shared encryption key is made available to other tenants. In this way, data can be deduplicated across multiple volumes of different tenants of a storage environment, while maintaining security and data privacy at a volume level.Type: ApplicationFiled: February 21, 2022Publication date: June 2, 2022Inventors: Srinivasan Narayanamurthy, Dnyaneshwar Nagorao Pawar, Jagadish Vasudeva, Parag Deshmukh, Siddhartha Nandi
-
Patent number: 11256433Abstract: Techniques are provided for aggregate inline deduplication and volume granularity encryption. For example, data that is exclusive to a volume of a tenant is encrypted using an exclusive encryption key accessible to the tenant. The exclusive encryption key of that tenant is inaccessible to other tenants. Shared data that has been deduplicated and shared between the volume and another volume of a different tenant is encrypted using a shared encryption key of the volume. The shared encryption key is made available to other tenants. In this way, data can be deduplicated across multiple volumes of different tenants of a storage environment, while maintaining security and data privacy at a volume level.Type: GrantFiled: March 15, 2019Date of Patent: February 22, 2022Assignee: NetApp, Inc.Inventors: Srinivasan Narayanamurthy, Dnyaneshwar Nagorao Pawar, Jagadish Vasudeva, Parag Deshmukh, Siddhartha Nandi
-
Patent number: 11210007Abstract: Techniques are provided for deduplicating encrypted data. For example, a device has data to store in an encrypted state within a remote data store. A key is used to encrypt the data to create encrypted data. The data is hashed to create hashed data and the encrypted data is hashed to create hashed encrypted data. A probabilistic data structure of the data is generated. The key is encrypted based upon the data to create an encrypted key. The encrypted data is transmitted to the remote data store, along with metadata comprising the hashed data, the hashed encrypted data, the probabilistic data structure, and the encrypted key. The metadata may be used to implement deduplication for subsequent requests, to store data within the remote data store, with respect to the encrypted data.Type: GrantFiled: April 17, 2019Date of Patent: December 28, 2021Assignee: NetApp, Inc.Inventors: Srinivasan Narayanamurthy, Parag Deshmukh
-
Publication number: 20210389893Abstract: Techniques are provided for deduplicating encrypted data. For example, a device has data to store in an encrypted state within a remote data store. A key is used to encrypt the data to create encrypted data. The data is hashed to create hashed data and the encrypted data is hashed to create hashed encrypted data. A probabilistic data structure of the data is generated. The key is encrypted based upon the data to create an encrypted key. The encrypted data is transmitted to the remote data store, along with metadata comprising the hashed data, the hashed encrypted data, the probabilistic data structure, and the encrypted key. The metadata may be used to implement deduplication for subsequent requests, to store data within the remote data store, with respect to the encrypted data.Type: ApplicationFiled: August 30, 2021Publication date: December 16, 2021Inventors: Srinivasan Narayanamurthy, Parag Deshmukh
-
Patent number: 11106375Abstract: Techniques are provided for deduplicating encrypted data. For example, a device has data to store in an encrypted state within a remote data store. A key is used to encrypt the data to create encrypted data. The data is hashed to create hashed data and the encrypted data is hashed to create hashed encrypted data. A probabilistic data structure of the data is generated. The key is encrypted based upon the data to create an encrypted key. The encrypted data is transmitted to the remote data store, along with metadata comprising the hashed data, the hashed encrypted data, the probabilistic data structure, and the encrypted key. The metadata may be used to implement deduplication for subsequent requests, to store data within the remote data store, with respect to the encrypted data.Type: GrantFiled: April 4, 2019Date of Patent: August 31, 2021Assignee: NetApp, Inc.Inventors: Srinivasan Narayanamurthy, Parag Deshmukh
-
Publication number: 20210213800Abstract: An air-conditioning system may include at least one outlet for discharging an air current into the space, first and second distribution elements for adjusting differing first and second parameters of the system, the first and second distribution elements adjustable over first and second adjusting ranges, respectively, and a cam plate for adjusting the distribution elements and featuring first and second guide structure for adjusting the first and second distribution elements, respectively. The guide structures may be configured such that the first distribution element remains in a predefined position over a predefined first angular range of rotation of the cam plate, and the second distribution element may be adjusted in dependence on a rotational angle of the cam plate in the first angular range of rotation. The first distribution element may be adjusted when the second distribution element is in a predefined position at an end of the second adjusting range.Type: ApplicationFiled: February 19, 2016Publication date: July 15, 2021Inventors: Robert Anranter, Markus Wundel, Andreas Pfander, Greg Rademacher, Doug Forsyth, Parag Deshmukh, Parag Bhole
-
Publication number: 20200320046Abstract: Techniques are provided for deduplicating encrypted data. For example, a device has data to store in an encrypted state within a remote data store. A key is used to encrypt the data to create encrypted data. The data is hashed to create hashed data and the encrypted data is hashed to create hashed encrypted data. A probabilistic data structure of the data is generated. The key is encrypted based upon the data to create an encrypted key. The encrypted data is transmitted to the remote data store, along with metadata comprising the hashed data, the hashed encrypted data, the probabilistic data structure, and the encrypted key. The metadata may be used to implement deduplication for subsequent requests, to store data within the remote data store, with respect to the encrypted data.Type: ApplicationFiled: April 4, 2019Publication date: October 8, 2020Inventors: Srinivasan Narayanamurthy, Parag Deshmukh
-
Publication number: 20200319810Abstract: Techniques are provided for deduplicating encrypted data. For example, a device has data to store in an encrypted state within a remote data store. A key is used to encrypt the data to create encrypted data. The data is hashed to create hashed data and the encrypted data is hashed to create hashed encrypted data. A probabilistic data structure of the data is generated. The key is encrypted based upon the data to create an encrypted key. The encrypted data is transmitted to the remote data store, along with metadata comprising the hashed data, the hashed encrypted data, the probabilistic data structure, and the encrypted key. The metadata may be used to implement deduplication for subsequent requests, to store data within the remote data store, with respect to the encrypted data.Type: ApplicationFiled: April 17, 2019Publication date: October 8, 2020Inventors: Srinivasan Narayanamurthy, Parag Deshmukh
-
Publication number: 20200293212Abstract: Techniques are provided for aggregate inline deduplication and volume granularity encryption. For example, data that is exclusive to a volume of a tenant is encrypted using an exclusive encryption key accessible to the tenant. The exclusive encryption key of that tenant is inaccessible to other tenants. Shared data that has been deduplicated and shared between the volume and another volume of a different tenant is encrypted using a shared encryption key of the volume. The shared encryption key is made available to other tenants. In this way, data can be deduplicated across multiple volumes of different tenants of a storage environment, while maintaining security and data privacy at a volume level.Type: ApplicationFiled: March 15, 2019Publication date: September 17, 2020Inventors: Srinivasan Narayanamurthy, Dnyaneshwar Nagorao Pawar, Jagadish Vasudeva, Parag Deshmukh, Siddhartha Nandi
-
Patent number: 9208181Abstract: One or more techniques and/or systems are provided for migrating a dataset from a file storage system to an object storage system. That is, a snapshot of a file system may be received from the file storage system. The snapshot may comprise file data associated with a file of the file system. The file may be converted into an object using the file data. The object may be stored within a data constituent volume of the object storage system. A namespace volume, used to track objects, may be populated with a redirector that maps a front-end data path (e.g., a path used by clients to reference the object) to a back-end data path that specifies a path to the object within the data constituent volume. In this way, a dataset of one or more files may be migrated from the file storage system to the object storage system.Type: GrantFiled: October 24, 2014Date of Patent: December 8, 2015Assignee: NetApp, Inc.Inventors: Vineet Pandey, Chhavi Sharma, Ranjit Kumar, Parag Deshmukh, Kaladhar Voruganti
-
Publication number: 20150046502Abstract: One or more techniques and/or systems are provided for migrating a dataset from a file storage system to an object storage system. That is, a snapshot of a file system may be received from the file storage system. The snapshot may comprise file data associated with a file of the file system. The file may be converted into an object using the file data. The object may be stored within a data constituent volume of the object storage system. A namespace volume, used to track objects, may be populated with a redirector that maps a front-end data path (e.g., a path used by clients to reference the object) to a back-end data path that specifies a path to the object within the data constituent volume. In this way, a dataset of one or more files may be migrated from the file storage system to the object storage system.Type: ApplicationFiled: October 24, 2014Publication date: February 12, 2015Inventors: Vineet Pandey, Chhavi Sharma, Ranjit Kumar, Parag Deshmukh, Kaladhar Voruganti