分布式存储系统的优化灾难恢复：轻量级元数据架构以克服加密哈希瓶颈
Optimized Disaster Recovery for Distributed Storage Systems: Lightweight Metadata Architectures to Overcome Cryptographic Hashing Bottleneck
AI总结：
本文提出了一种轻量级元数据架构，通过为数据块分配全局唯一标识符，以克服加密哈希在灾难恢复中的瓶颈，实现快速且无加密开销的增量计算。
摘要：
分布式存储架构是现代云原生基础设施的基础，但灾难恢复（DR）工作流中仍存在关键操作瓶颈：依赖基于内容的加密哈希进行数据识别和同步。虽然基于哈希的去重在稳态操作中有效，但在故障转移和故障回切事件中，当哈希索引过时、不完整或必须在崩溃后重建时，哈希会成为系统性的负担。本文精确地刻画了在何种操作条件下必须进行完整或部分重新哈希。本文还分析了加密重新哈希对恢复时间目标（RTO）合规性的下游影响，并提出了一种向确定性、元数据驱动的识别方法的总体架构转变。所提出的框架在数据块摄入时为其分配全局唯一的复合标识符，与内容分析无关，从而在灾难恢复过程中无需任何加密开销即可实现即时的增量计算。
英文摘要：
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 of content analysis enabling instantaneous delta computation during DR without any cryptographic overhead.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
