用唯一元数据标识块，避免灾难恢复时的哈希瓶颈。
Optimized Disaster Recovery for Distributed Storage Systems: Lightweight Metadata Architectures to Overcome Cryptographic Hashing Bottleneck
- 数据写入时分配全局唯一复合标识，不依赖内容哈希。
- 灾难恢复时可即时计算差异，无需重新加密哈希。
- 适合对恢复时间敏感的分布式存储系统。
分布式存储架构是现代云原生基础设施的核心，但在灾难恢复（DR）流程中存在一个关键操作瓶颈：依赖基于内容的加密哈希进行数据识别与同步。虽然哈希去重在正常运行状态下能提升存储效率，但在故障切换和故障回切时，哈希索引可能过期、不完整或需崩溃后重建，导致必须全量或部分重哈希。本文精确刻画了必须重哈希的运行条件，分析其对恢复时间目标（RTO）达标的影响，并提出向确定性元数据驱动识别的通用架构转型。所提框架在数据块摄入时即赋予全局唯一复合标识，独立于内容分析，从而在灾难恢复过程中实现无加密开销的瞬时增量计算。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。