IP Library › Granted Patent US 12,455,861
Granted Patent B2
US 12,455,861 · App. 18/536,072 · Granted Oct 28, 2025

Techniques for efficient encryption and decryption during file system cross-region replication

Inventors: Satish Kumar Kashi Visvanathan (San Jose, CA); Viggnesh Venugopal (Santa Clara, CA); Vikram Singh Bisht (Seattle, WA)
Assignee: Oracle International Corporation
G06F16/178G06F16/172G06F16/185G06F21/602H04L9/0836G06F21/6218H04L9/08H04L9/0894
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,455,861
App. No.
18/536,072
Filed
Dec 11, 2023
Granted
Oct 28, 2025
Kind
B2
Art Unit
2407
USPC
713/193
Abstract

Techniques are described for a hierarchical caching mechanism enabling efficient cross-region replications. In some embodiments, replication-related information (e.g., key-value pairs) is stored in a particular layout in a binary tree (B-tree) of a file system for replication processing. A hierarchy of caches storing a first type of information (e.g., crypto keys associated with iNodes) may be arranged to match the particular layout in the B-tree to enable efficient parallel processing of a second type of information (e.g., files, file data, or symbolic links), where the replication-related information in the B-tree is partitioned into multiple key ranges for parallel processing. In some embodiments, the caches in different hierarchies may be shared by different parallel-processing key ranges and replication jobs in a file system.

Claims (83)

1. A method, comprising:

performing, by a computing system, a first replication between a source file system in a source region and a first target file system in a first target region, the source region comprising one or more connected data centers, and the first target region comprising one or more connected data centers;

arranging, by the computing system, key-value pairs of a binary tree (B-tree) in a particular layout in the source file system, the key-value pairs of the B-tree comprising a first type of information and its associated one or more second type of information, the one or more second type of information being dependent on the first type of information for processing;

partitioning, by the computing system, the key-value pairs of the B-tree into one or more key ranges containing the key-value pairs of the B-tree, each key range of the one or more key ranges comprising a processing thread configured to process at least one key-value pair of the B-tree in parallel during the first replication;

creating, by the computing system, a hierarchy of caches comprising one or more first-level caches and a second-level cache, the one or more first-level caches and the one or more key ranges being configured to have a one-to-one mapping, the second-level cache and the one or more key ranges being configured to have a one-to-many mapping; and

storing, by the computing system, an element of the first type of information in the one or more first-level cache and the second-level cache.

2. The method of claim 1 , wherein the particular layout comprises placing the first type of information and its associated one or more second type of information in consecutive order in the B-tree.

3. The method of claim 1 , wherein:

the first type of information comprises a parent directory iNode and a crypto key associated with the parent directory iNode,

the associated one or more second type of information comprises child files associated with the parent directory iNode, and

the crypto key associated with the parent directory iNode is configured to encrypt and decrypt file names of the child files.

4. The method of claim 1 , wherein:

the first type of information comprises a file iNode and a crypto key associated with the file iNode,

the associated one or more second type of information comprises file data blocks associated with the file iNode, and

the crypto key associated with the file iNode is configured to encrypt and decrypt data in the file data blocks.

5. The method of claim 1 , wherein the element of the first type of information stored in the one or more first-level caches and the second-level cache is a crypto key.

6. The method of claim 1 , wherein the one or more second type of information being dependent on the first type of information for processing comprising using a crypto key in the first type of information for encryption and decryption during the first replication.

7. The method of claim 1 , wherein:

the one or more key ranges comprises a first key range and a second key range;

the first type of information is in the first key range,

a first key-value of the second type of information is in the first key range, and

a second key-value of the second type of information is in the second key range.

8. The method claim 7 , further comprising:

obtaining the stored element of the first type of information in a cache of the one or more first-level caches corresponding to the first key range for processing first key-value of the second type of information in the first key range; and

obtaining the stored element of the first type of information in the second-level cache for processing second key-value of the second type of information in the second key range.

9. The method of claim 1 , further comprising:

performing a second replication between the source file system and a second target file system;

creating a third-level cache in the hierarchy of caches;

storing the element of the first type of information in the third-level cache;

processing the one or more second type of information by at least one processing thread in the second replication; and

obtaining the stored element of the first type of information in the third-level cache by the at least one processing thread in the second replication.

10. A non-transitory computer-readable medium storing computer-executable instructions that, when executed by one or more processors, cause the one or more processors to perform operations comprising:

performing a first replication between a source file system in a source region and a first target file system in a first target region, the source region comprising one or more connected data centers, and the first target region comprising one or more connected data centers;

arranging key-value pairs of a binary tree (B-tree) in a particular layout in the source file system, the key-value pairs of the B-tree comprising a first type of information and its associated one or more second type of information, the one or more second type of information being dependent on the first type of information for processing, the particular layout comprising placing the first type of information and its associated one or more second type of information in consecutive order in the B-tree;

partitioning the key-value pairs of the B-tree into one or more key ranges containing the key-value pairs of the B-tree, each key range of the one or more key ranges comprising a processing thread configured to process at least one key-value pair of the B-tree in parallel during the first replication;

creating a hierarchy of caches comprising one or more first-level caches and a second-level cache, the one or more first-level caches and the one or more key ranges being configured to have a one-to-one mapping, the second-level cache and the one or more key ranges being configured to have a one-to-many mapping; and

storing a crypto key of the first type of information in the one or more first-level cache and the second-level cache.

11. The non-transitory computer-readable medium of claim 10 , wherein:

the first type of information comprises a parent directory iNode and a crypto key associated with the parent directory iNode,

the associated one or more second type of information comprises child files associated with the parent directory iNode, and

the crypto key associated with the parent directory iNode is configured to encrypt and decrypt file names of the child files.

12. The non-transitory computer-readable medium of claim 10 , wherein:

the first type of information comprises a file iNode and a crypto key associated with the file iNode,

the associated one or more second type of information comprises file data blocks associated with the file iNode, and

the crypto key associated with the file iNode is configured to encrypt and decrypt data in the file data blocks.

13. The non-transitory computer-readable medium of claim 10 , wherein:

the one or more key ranges comprises a first key range and a second key range;

the first type of information is in the first key range,

a first key-value of the second type of information is in the first key range, and

a second key-value of the second type of information is in the second key range.

14. The non-transitory computer-readable medium of claim 13 , further comprising:

obtaining the stored element of the first type of information in a cache of the one or more first-level caches corresponding to the first key range for processing first key-value of the second type of information in the first key range; and

obtaining the stored element of the first type of information in the second-level cache for processing second key-value of the second type of information in the second key range.

15. The non-transitory computer-readable medium of claim 10 , further comprising:

performing a second replication between the source file system and a second target file system;

creating a third-level cache in the hierarchy of caches;

storing the element of the first type of information in the third-level cache;

processing the one or more second type of information by at least one processing thread in the second replication; and

obtaining the stored element of the first type of information in the third-level cache by the at least one processing thread in the second replication.

16. A computing system, comprising:

one or more processors; and

one or more computer readable media storing computer-executable instructions that, when executed by the one or more processors of the computing system, cause the system to:

perform, by the computing system, a first replication between a source file system in a source region and a first target file system in a first target region, the source region comprising one or more connected data centers, and the first target region comprising one or more connected data centers;

arrange, by the computing system, key-value pairs of a binary tree (B-tree) in a particular layout in the source file system, the key-value pairs of the B-tree comprising a first type of information and its associated one or more second type of information, the one or more second type of information being configured to use a crypto key of the first type of information for processing;

partition, by the computing system, the key-value pairs of the B-tree into one or more key ranges containing the key-value pairs of the B-tree, each key range of the one or more key ranges comprising a processing thread configured to process at least one key-value pair of the B-tree in parallel during the first replication;

create, by the computing system, a hierarchy of caches comprising one or more first-level caches and a second-level cache, the one or more first-level caches and the one or more key ranges being configured to have a one-to-one mapping, the second-level cache and the one or more key ranges being configured to have a one-to-many mapping; and

store, by the computing system, the crypto key of the first type of information in the one or more first-level cache and the second-level cache.

17. The computing system of claim 16 , wherein:

the first type of information comprises a parent directory iNode and a crypto key associated with the parent directory iNode,

the associated one or more second type of information comprises child files associated with the parent directory iNode, and

the crypto key associated with the parent directory iNode is configured to encrypt and decrypt file names of the child files.

18. The computing system of claim 16 , wherein:

the first type of information comprises a file iNode and a crypto key associated with the file iNode,

the associated one or more second type of information comprises file data blocks associated with the file iNode, and

the crypto key associated with the file iNode is configured to encrypt and decrypt data in the file data blocks.

19. The computing system of claim 16 , wherein:

the one or more key ranges comprises a first key range and a second key range,

the first type of information is in the first key range,

a first key-value of the second type of information is in the first key range, and

a second key-value of the second type of information is in the second key range.

20. The computing system of claim 19 , wherein the system is further caused to:

obtain the stored crypto key of the first type of information in a cache of the one or more first-level caches corresponding to the first key range for processing first key-value of the second type of information in the first key range; and

obtain the stored crypto key of the first type of information in the second-level cache for processing second key-value of the second type of information in the second key range.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 18, 2023
From: KASHI VISVANATHAN, SATISH KUMAR; VENUGOPAL, VIGGNESH; BISHT, VIKRAM SINGH
To: ORACLE INTERNATIONAL CORPORATION
Reel/Frame 065896/0518 →
Continuity (6)
Continuation In Part 18094302 · Jan 6, 2023
Provisional Application 63378486 · Oct 5, 2022
Provisional Application 63412243 · Sep 30, 2022
Provisional Application 63357526 · Jun 30, 2022
Provisional Application 63352992 · Jun 16, 2022
Related Publication 20240134828A1 · Apr 25, 2024
References Cited (207)
US 5806075A · Jain et al. · 1998 [cited by applicant]
US 6615333B1 · Hoogerbrugge et al. · 2003 [cited by applicant]
US 7308545B1 · Kekre et al. · 2007 [cited by applicant]
US 7546431B2 · Stacey et al. · 2009 [cited by applicant]
US 8271992B2 · Chatley et al. · 2012 [cited by applicant]
US 8326803B1 · Stringham · 2012 [cited by applicant]
US 8332375B2 · Chatley et al. · 2012 [cited by applicant]
US 8336056B1 · Gadir · 2012 [cited by applicant]
US 8464101B1 · Natanzon et al. · 2013 [cited by applicant]
US 8522252B2 · Chatley et al. · 2013 [cited by applicant]
US 8548949B2 · Jennas, II et al. · 2013 [cited by applicant]
US 8700855B2 · Revanuru · 2014 [cited by applicant]
US 8832027B1 · Bushman · 2014 [cited by applicant]
US 8856079B1 · Subramanian et al. · 2014 [cited by applicant]
US 9047307B1 · Ghemawat et al. · 2015 [cited by applicant]
US 9189495B1 · Hughes et al. · 2015 [cited by applicant]
US 9489434B1 · Rath · 2016 [cited by applicant]
US 9535746B2 · Gupta et al. · 2017 [cited by applicant]
US 9760358B2 · Sapaliga et al. · 2017 [cited by applicant]
US 9916203B1 · Pogde et al. · 2018 [cited by applicant]
US 9928246B1 · Xu et al. · 2018 [cited by applicant]
US 9952767B2 · Zheng et al. · 2018 [cited by applicant]
US 10459632B1 · Chen et al. · 2019 [cited by applicant]
US 10503753B2 · Mitkar et al. · 2019 [cited by applicant]
US 10514986B2 · Bangalore et al. · 2019 [cited by applicant]
US 10572452B1 · Singh · 2020 [cited by examiner]
US 10664358B1 · Chen et al. · 2020 [cited by applicant]
US 10698941B2 · Maybee et al. · 2020 [cited by applicant]
US 10721141B1 · Verma et al. · 2020 [cited by applicant]
US 10756888B2 · Han · 2020 [cited by applicant]
US 10908828B1 · Meiri et al. · 2021 [cited by applicant]
US 10922132B1 · Shiramshetti et al. · 2021 [cited by applicant]
US 11005935B1 · Littlefield et al. · 2021 [cited by applicant]
US 11036677B1 · Grunwald et al. · 2021 [cited by applicant]
US 11080041B1 · Ah Kun et al. · 2021 [cited by applicant]
US 11086545B1 · Dayal et al. · 2021 [cited by applicant]
US 11151092B2 · Chmiel et al. · 2021 [cited by applicant]
US 11372725B2 · Bajaj · 2022 [cited by applicant]
US 11513997B2 · Keller et al. · 2022 [cited by applicant]
US 11575727B1 · Woodruff et al. · 2023 [cited by applicant]
US 11714782B2 · Subramanian et al. · 2023 [cited by applicant]
US 11809735B1 · Kumar et al. · 2023 [cited by applicant]
US 11836110B2 · Matsushita et al. · 2023 [cited by applicant]
US 11860673B1 · Kodakandla et al. · 2024 [cited by applicant]
US 12001404B2 · Kashi Visvanathan et al. · 2024 [cited by applicant]
US 12147394B2 · Kashi Visvanathan et al. · 2024 [cited by applicant]
US 12182078B2 · Kashi Visvanathan et al. · 2024 [cited by applicant]
US 12197790B2 · Nelson · 2025 [cited by applicant]
US 12271625B1 · Astolfi · 2025 [cited by examiner]
US 12306804B2 · Visvanathan · 2025 [cited by examiner]
US 20020112123A1 · Becker et al. · 2002 [cited by applicant]
US 20020129214A1 · Sarkar · 2002 [cited by applicant]
US 20030182313A1 · Federwisch et al. · 2003 [cited by applicant]
US 20050165862A1 · Loafman et al. · 2005 [cited by applicant]
US 20060271598A1 · Wong et al. · 2006 [cited by applicant]
US 20080049254A1 · Phan et al. · 2008 [cited by applicant]
US 20080109496A1 · Holenstein et al. · 2008 [cited by applicant]
US 20080168218A1 · Arakawa et al. · 2008 [cited by applicant]
US 20080172542A1 · Kaushik · 2008 [cited by applicant]
US 20080250234A1 · Webber · 2008 [cited by applicant]
US 20090138480A1 · Chatley et al. · 2009 [cited by applicant]
US 20090138481A1 · Chatley et al. · 2009 [cited by applicant]
US 20090144224A1 · Phan et al. · 2009 [cited by applicant]
US 20090144284A1 · Chatley et al. · 2009 [cited by applicant]
US 20090144422A1 · Chatley et al. · 2009 [cited by applicant]
US 20090307277A1 · Grubov et al. · 2009 [cited by applicant]
US 20110213765A1 · Cui et al. · 2011 [cited by applicant]
US 20110231172A1 · Gold · 2011 [cited by applicant]
US 20120131595A1 · Kim et al. · 2012 [cited by applicant]
US 20120317079A1 · Shoens et al. · 2012 [cited by applicant]
US 20120323844A1 · Chatley et al. · 2012 [cited by applicant]
US 20130005491A1 · Cox et al. · 2013 [cited by applicant]
US 20130339407A1 · Sharpe et al. · 2013 [cited by applicant]
US 20140052692A1 · Zhang et al. · 2014 [cited by applicant]
US 20150066857A1 · Dayal et al. · 2015 [cited by applicant]
US 20150074536A1 · Varadharajan et al. · 2015 [cited by applicant]
US 20150120893A1 · Sapaliga et al. · 2015 [cited by applicant]
US 20150378636A1 · Yadav et al. · 2015 [cited by applicant]
US 20160188380A1 · Eastep et al. · 2016 [cited by applicant]
US 20160335278A1 · Tabaaloute et al. · 2016 [cited by applicant]
US 20160359963A1 · Chatley et al. · 2016 [cited by applicant]
US 20160359976A1 · Chatley et al. · 2016 [cited by applicant]
US 20170046093A1 · Butt · 2017 [cited by applicant]
US 20170212680A1 · Waghulde · 2017 [cited by examiner]
US 20180101311A1 · Koszewnik · 2018 [cited by applicant]
US 20190171497A1 · Agarwal et al. · 2019 [cited by applicant]
US 20190235917A1 · Koneru et al. · 2019 [cited by applicant]
US 20190370239A1 · Gupta · 2019 [cited by examiner]
US 20190384743A1 · Lv et al. · 2019 [cited by applicant]
US 20200065196A1 · Desai et al. · 2020 [cited by applicant]
US 20200210223A1 · Saka et al. · 2020 [cited by applicant]
US 20200210482A1 · Becker · 2020 [cited by examiner]
US 20200250684A1 · Puehse et al. · 2020 [cited by applicant]
US 20200257700A1 · Xu et al. · 2020 [cited by applicant]
US 20200301882A1 · Pogde et al. · 2020 [cited by applicant]
US 20200310919A1 · Bajaj · 2020 [cited by applicant]
US 20200333970A1 · Mukku et al. · 2020 [cited by applicant]
US 20200334111A1 · Potnis et al. · 2020 [cited by applicant]
US 20200409974A1 · Ayzenberg et al. · 2020 [cited by applicant]
US 20210157504A1 · Hinman · 2021 [cited by applicant]
US 20210173945A1 · Karr et al. · 2021 [cited by applicant]
US 20210200771A1 · Kuang et al. · 2021 [cited by applicant]
US 20210216625A1 · Miller et al. · 2021 [cited by applicant]
US 20210226861A1 · Barsalou et al. · 2021 [cited by applicant]
US 20210294775A1 · Keller et al. · 2021 [cited by applicant]
US 20210342299A1 · Kumarasamy et al. · 2021 [cited by applicant]
US 20210389883A1 · Derryberry et al. · 2021 [cited by applicant]
US 20210390078A1 · Aahlad et al. · 2021 [cited by applicant]
US 20210390113A1 · Danilov et al. · 2021 [cited by applicant]
US 20220058094A1 · Gunturu et al. · 2022 [cited by applicant]
US 20220060323A1 · Payne et al. · 2022 [cited by applicant]
US 20220121365A1 · Wang et al. · 2022 [cited by applicant]
US 20220147490A1 · Shivani et al. · 2022 [cited by applicant]
US 20220182297A1 · Verma et al. · 2022 [cited by applicant]
US 20220188267A1 · Patil et al. · 2022 [cited by applicant]
US 20220198322A1 · Kuperman et al. · 2022 [cited by applicant]
US 20220222358A1 · Sahita et al. · 2022 [cited by applicant]
US 20220229734A1 · Seela et al. · 2022 [cited by applicant]
US 20220263657A1 · Chang et al. · 2022 [cited by applicant]
US 20220308965A1 · Gunda et al. · 2022 [cited by applicant]
US 20230029677A1 · Gupta et al. · 2023 [cited by applicant]
US 20230134314A1 · Braganza et al. · 2023 [cited by applicant]
US 20230177069A1 · Xiang et al. · 2023 [cited by applicant]
US 20230222096A1 · Fan et al. · 2023 [cited by applicant]
US 20230297411A1 · Tsirkin · 2023 [cited by examiner]
US 20230333777A1 · Shveidel et al. · 2023 [cited by applicant]
US 20230385153A1 · George et al. · 2023 [cited by applicant]
US 20230409442A1 · Kashi Visvanathan et al. · 2023 [cited by applicant]
US 20230409522A1 · Kashi Visvanathan et al. · 2023 [cited by applicant]
US 20230409535A1 · Kashi Visvanathan et al. · 2023 [cited by applicant]
US 20230409559A1 · Kashi Visvanathan et al. · 2023 [cited by applicant]
US 20230409597A1 · Kashi Visvanathan et al. · 2023 [cited by applicant]
US 20230412375A1 · Bisht et al. · 2023 [cited by applicant]
US 20240028466A1 · Duggal et al. · 2024 [cited by applicant]
US 20240094937A1 · Kashi Visvanathan et al. · 2024 [cited by applicant]
US 20240134828A1 · Kashi Visvanathan et al. · 2024 [cited by applicant]
US 20240281413A1 · Kashi Visvanathan et al. · 2024 [cited by applicant]
CA 2954888A1 · 2007 [cited by applicant]
CN 104641365A · 2015 [cited by applicant]
CN 117215721A · 2023 [cited by applicant]
JP 2017531256A · 2017 [cited by applicant]
WO 2015110171A1 · 2015 [cited by applicant]
WO 2023244601A1 · 2023 [cited by applicant]
“About Consistency Group Snapshot Restore”, Working with consistency groups, Available Online at: https://sort.veritas.com/public/documents/HSO/2.0/linux/productguides/html/hfo_admin_ubuntu/ch07s10.htm, 2 pages , Dec. 1… [cited by applicant]
“About HyperScale Consistency Groups”, Working with consistency groups, Available Online at: https://sort.veritas.com/public/documents/HSO/2.0/linux/productguides/html/hfo_admin_ubuntu/ch07s02.htm, 1 page, Dec. 11, 2023. [cited by applicant]
“Amazon EFS Replication”, Amazon Elastic File System, Available Online at: https://docs.aws.amazon.com/efs/latest/ug/efs-replication.html, Oct. 3, 2022, 18 pages. [cited by applicant]
“Announcing Amazon Elastic File System Replication”, Available Online at: https://aws.amazon.com/about-aws/whats-new/2022/01/amazon-elastic-file-system-replication/, Jan. 25, 2022, 3 pages. [cited by applicant]
“AWS KMS Concepts”, AWS Key Management Service, Available Online at: https://docs.aws.amazon.com/kms/latest/developerguide/concepts.html, Oct. 3, 2022, 36 pages. [cited by applicant]
“Caringo Swarm Hybrid Cloud for Azure”, Caringo Swarm, Available Online at: https://azure.github.io/Storage/docs/storage-partners/partners/MultiProtocol/Caringo-Azure.pdf, 2017, 1 page. [cited by applicant]
“Caringo's Swarm Hybrid Cloud Object Storage Platform Now Integrated with Reach Engine by Levels Beyond and Microsoft Azure”, Available Online at: https://www.broadcastbeat.com/caringos-swarm-hybrid-cloud-object-storage… [cited by applicant]
“Create Amazon EBS Snapshots”, Available Online at: https://docs.aws.amazon.com/AWSEC2/latest/UserGuide/ebs-creating-snapshot.html, 2022, 4 pages. [cited by applicant]
“Create Consistency Groups”, Available Online at: https://library.netapp.com/ecmdocs/ECMP12404965/html/GUID-AA34DCF7-6827-4ACC-AA5E-63B1FEA8EFCE.html, Jan. 2016, 2 pages. [cited by applicant]
“How AWS DataSync Works”, AWS DataSync, Available Online at: https://docs.aws.amazon.com/datasync/latest/userguide/how-datasync-works.html, Oct. 3, 2022, 5 pages. [cited by applicant]
“How File Replicator Works”, Veritas, Accessed from Internet on Oct. 3, 2022, 1 page. [cited by applicant]
“Replication for File System Agents”, Available Online at: https://documentation.commvault.com/v11/essential/129963_replication_for_file_system_agents.html, Dec. 7, 2021, 2 pages. [cited by applicant]
“Snapshot Schedules and Snapshot Consistency Groups”, Available Online at: https://thinksystem.lenovofiles.com/storage/help/index.jsp?topic=%2Fthinksystem_system_manager_11.50.1%2F34EADFOC-B783-4FED-B187-28B016EE22B6_.h… [cited by applicant]
“Snapshotting a Consistency Group”, Available Online at: https://www.ibm.com/docs/en/xiv-storage-system?topic=commands-snapshotting-consistency-group, Jun. 12, 2022, 5 pages. [cited by applicant]
“The Definitive Guide to Rubrik Cloud Data Management”, Available Online at: https://www.rubrik.com/content/dam/rubrik/en/resources/white-paper/Definitive-guide-rubrik-cloud-data-management.pdf, Jun. 8, 2021, 41 pages. [cited by applicant]
“What is AWS DataSync?”, Available Online at: https://docs.aws.amazon.com/datasync/latest/userguide/what-is-datasync.html, Oct. 3, 2022, 3 pages. [cited by applicant]
Mashtizadeh et al., “Replication, History, and Grafting in the Ori File System”, Symposium on Operating Systems Principles, Available Online at: https://www.scs.stanford.edu/˜dm/home/papers/mashtizadeh:ori.pdf, Nov. 3-6… [cited by applicant]
International Application No. PCT/US2023/024235, International Search Report and Written Opinion mailed on Sep. 4, 2023, 13 pages. [cited by applicant]
International Application No. PCT/US2023/024236, International Search Report and Written Opinion mailed on Sep. 6, 2023, 10 pages. [cited by applicant]
International Application No. PCT/US2023/024239, International Search Report and Written Opinion mailed on Aug. 11, 2023, 14 pages. [cited by applicant]
International Application No. PCT/US2023/024835, International Search Report and Written Opinion mailed on Aug. 8, 2023, 14 pages. [cited by applicant]
International Application No. PCT/US2023/025194, International Search Report and Written Opinion mailed on Aug. 18, 2023, 13 pages. [cited by applicant]
“CephFS Mirroring”, Ceph Internals, Available online at: https://docs.ceph.com/en/reef/dev/cephfs-mirroring/, 9 pages Jan. 17, 2025. [cited by applicant]
“Google Scholar/patents Search—Text Refined”, 2024, 2 pages. [cited by applicant]
“SnapshotIQ”, Available online at: https://infohub.delltechnologies.com/en-us/l/high-availability-and-data-protection-with-dell-powerscale-scale-out-nas/snapshots-116/, 4 pages , Jan. 17, 2025. [cited by applicant]
U.S. Appl. No. 17/991,688 , Non-Final Office Action, Mailed On Nov. 19, 2024, 11 pages. [cited by applicant]
U.S. Appl. No. 18/094,302 , Notice of Allowance, Mailed On Nov. 29, 2024, 14 pages. [cited by applicant]
U.S. Appl. No. 18/162,459 , Notice of Allowance, Mailed On Dec. 9, 2024, 11 pages. [cited by applicant]
U.S. Appl. No. 18/166,992 , Notice of Allowance, Mailed On Nov. 5, 2024, 9 pages. [cited by applicant]
U.S. Appl. No. 18/181,414 , Notice of Allowance, Mailed On Sep. 30, 2024, 12 pages. [cited by applicant]
U.S. Appl. No. 18/304,226 , Non-Final Office Action, Mailed On Nov. 19, 2024, 16 pages. [cited by applicant]
U.S. Appl. No. 18/326,447 , Notice of Allowance, Mailed On Aug. 29, 2024, 10 pages. [cited by applicant]
U.S. Appl. No. 18/332,475 , Non-Final Office Action, Mailed On Dec. 19, 2024, 15 pages. [cited by applicant]
U.S. Appl. No. 18/646,676 , Notice of Allowance, Mailed On Jan. 2, 2025, 21 pages. [cited by applicant]
Khurana et al., “Efficient Snapshot Retrieval Over Historical Graph Data”, Institute of Electrical and Electronics Engineers, Jul. 24, 2012, pp. 997-1008. [cited by applicant]
LAPP , “Busting the Buffer Myth for Multicast Media Over IP”, Available Online at: https://blogs.cisco.com/sp/busting-the-buffer-myth-for-multicast-media-over-ip, Feb. 22, 2021, 9 pages. [cited by applicant]
Application No. PCT/US2023/024235 , International Preliminary Report on Patentability, Mailed On Dec. 26, 2024, 9 pages. [cited by applicant]
Application No. PCT/US2023/024236 , International Preliminary Report on Patentability, Mailed On Dec. 26, 2024, 9 pages. [cited by applicant]
Application No. PCT/US2023/024239 , International Preliminary Report on Patentability, Mailed On Dec. 26, 2024, 11 pages. [cited by applicant]
Application No. PCT/US2023/024835 , International Preliminary Report on Patentability, Mailed On Dec. 26, 2024, 11 pages. [cited by applicant]
Application No. PCT/US2023/025194 , International Preliminary Report on Patentability, Mailed On Dec. 26, 2024, 10 pages. [cited by applicant]
“Google Scholar/patents Search—Text Refined”, Filesystem Delta Snapshot Replication, 2025, 2 pages. [cited by applicant]
“Google Scholar/patents Search—Text Refined”, Pipeline Thread Delete Stage, 2025, 2 pages. [cited by applicant]
U.S. Appl. No. 17/991,688, “Notice of Allowance”, mailed on Mar. 7, 2025, 8 pages. [cited by applicant]
U.S. Appl. No. 18/094,302, “Notice of Allowance”, mailed on Mar. 13, 2025, 14 pages. [cited by applicant]
U.S. Appl. No. 18/162,459, “Corrected Notice of Allowability”, mailed on Apr. 11, 2025, 2 pages. [cited by applicant]
U.S. Appl. No. 18/169,124, “Notice of Allowance”, mailed on Mar. 20, 2025, 13 pages. [cited by applicant]
U.S. Appl. No. 18/304,226, “Final Office Action”, mailed on Apr. 4, 2025, 20 pages. [cited by applicant]
U.S. Appl. No. 18/497,877, “Non-Final Office Action”, mailed on Mar. 3, 2025, 25 pages. [cited by applicant]
U.S. Appl. No. 18/508,990, “Non-Final Office Action”, mailed on Mar. 3, 2025, 11 pages. [cited by applicant]
U.S. Appl. No. 18/521,176, “Non-Final Office Action”, mailed on Apr. 4, 2025, 6 pages. [cited by applicant]
U.S. Appl. No. 18/536,067, “Non-Final Office Action”, mailed on Jan. 29, 2025, 17 pages. [cited by applicant]
Chang et al., “Job Scheduling and Data Replication on Data Grids”, Future Generation Computer Systems, vol. 23, No. 7, Aug. 2007, pp. 846-860. [cited by applicant]
U.S. Appl. No. 18/166,992, Non-Final Office Action mailed on Jun. 20, 2024, 9 pages. [cited by applicant]
U.S. Appl. No. 18/169,121, Non-Final Office Action mailed on Aug. 14, 2024, 29 pages. [cited by applicant]
U.S. Appl. No. 18/181,414, Final Office Action mailed on Aug. 12, 2024, 22 pages. [cited by applicant]
U.S. Appl. No. 18/181,414, Non-Final Office Action mailed on Mar. 14, 2024, 78 pages. [cited by applicant]
U.S. Appl. No. 18/304,161, Notice of Allowance mailed on Mar. 19, 2024, 20 pages. [cited by applicant]
U.S. Appl. No. 18/326,447, Non-Final Office Action mailed on Jun. 12, 2024, 8 pages. [cited by applicant]
U.S. Appl. No. 18/332,462, Final Office Action mailed on Jul. 25, 2024, 26 pages. [cited by applicant]
U.S. Appl. No. 18/332,462, Non-Final Office Action mailed on Apr. 25, 2024, 18 pages. [cited by applicant]
Chapman et al., “Provenance and the Price of Identity”, Provenance and Annotation of Data and Process, Available online at: https://www.researchgate.net/profile/Adriane-Chapman/publication/220919088_Provenance_and_the_P… [cited by applicant]
Mahajan et al., “Effective and Efficient Compromise Recovery for Weakly Consistent Replication”, Microsoft Research, Silicon Valley Available online at: https://dl.acm.org/doi/pdf/10.1145/1519065.1519080?casa_token=h29H… [cited by applicant]
Tremel et al., “Reliable, Efficient Recovery for Complex Services with Replicated Subsystems”, Institute of Electrical and Electronics Engineers, Available online at: https://www.cs.cornell.edu/˜weijia/papers/edward-dsn… [cited by applicant]
Cited By (8)
US 12,530,262 US 12,572,513 US 12,579,109 US 12,608,401 US 12,688,159 US 12,693,993 US 12,717,755 US 12,730,778