![[2602.22237] Optimized Disaster Recovery for Distributed Storage Systems: Lightweight Metadata Architectures to Overcome Cryptographic Hashing Bottleneck](https://arxiv.org/static/browse/0.3.4/images/arxiv-logo-fb.png){kind=logo}
[2602.22237] Optimized Disaster Recovery for Distributed Storage Systems: Lightweight Metadata Architectures to Overcome Cryptographic Hashing Bottleneck
Summary
This paper presents a novel approach to disaster recovery in distributed storage systems, addressing the limitations of cryptographic hashing during failover events by proposing lightweight metadata architectures for efficient data identification.
Why It Matters
As cloud-native infrastructures become increasingly reliant on distributed storage, the ability to recover data quickly and efficiently is critical. This research addresses a significant bottleneck in disaster recovery workflows, offering a solution that could enhance operational resilience and reduce downtime.
Key Takeaways
- Current disaster recovery methods face challenges due to reliance on cryptographic hashing.
- The proposed architecture uses deterministic metadata for faster data identification.
- This approach can significantly reduce Recovery Time Objectives (RTO) during failover events.
Computer Science > Cryptography and Security arXiv:2602.22237 (cs) [Submitted on 23 Feb 2026] Title:Optimized Disaster Recovery for Distributed Storage Systems: Lightweight Metadata Architectures to Overcome Cryptographic Hashing Bottleneck Authors:Prasanna Kumar, Nishank Soni, Gaurang Munje View a PDF of the paper titled Optimized Disaster Recovery for Distributed Storage Systems: Lightweight Metadata Architectures to Overcome Cryptographic Hashing Bottleneck, by Prasanna Kumar and 2 other authors View PDF Abstract:Distributed storage architectures are foundational to modern cloud-native infrastructure, yet a critical operational bottleneck persists within disaster recovery (DR) workflows: the dependence on content-based cryptographic hashing for data identification and synchronization. While hash-based deduplication is effective for storage efficiency in steady-state operation, it becomes a systemic liability during failover and failback events when hash indexes are stale, incomplete, or must be rebuilt following a crash. This paper precisely characterizes the operational conditions under which full or partial re-hashing becomes unavoidable. The paper also analyzes the downstream impact of cryptographic re-hashing on Recovery Time Objective (RTO) compliance, and proposes a generalized architectural shift toward deterministic, metadata-driven identification. The proposed framework assigns globally unique composite identifiers to data blocks at ingestion time-independent o...