Global Inline Namespace Verification for Distributed File Systems

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Verifying the integrity of a distributed file system while it is in operation is challenging due to continuous changes and high network bandwidth consumption, as existing methods require significant network traffic and resource usage.

Innovation Solution

Implementing a global inline verification process using a Global Dataless Snapshot and lightweight checksum method, combined with relaxed ordering, to efficiently verify the namespace integrity across a distributed file system with minimal network traffic and resource usage.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If a verification process is performed across a cluster of systems to check distributed file system integrity, then verification capability is improved, but network bandwidth consumption increases significantly

Engineering Contradiction:
Improvefile system integrity verificationVSAvoidnetwork bandwidth consumption
Core Design Contradiction:
ReliabilityVSLoss of energy

Solution Approach 1:

The patent extracts only the essential verification information (checksums and metadata) from each node instead of transferring complete file data. Each node computes local checksums and sends only these compact representations to the verification coordinator, dramatically reducing network bandwidth consumption while maintaining verification capability.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The system performs preliminary computation of checksums and metadata at each node before the verification process begins. This pre-computation eliminates the need to transfer and analyze actual file contents during verification, reducing network traffic to minimal metadata exchanges while ensuring verification accuracy.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If continuous verification is performed on a distributed file system under load, then data integrity detection is improved, but system resources are significantly consumed

Engineering Contradiction:
Improvedata integrity detectionVSAvoidsystem resource consumption
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent uses checksums as simplified copies or representations of file contents for verification purposes. Instead of examining actual file data during verification, the system works with these compact checksum copies, maintaining verification effectiveness while minimizing computational overhead and resource consumption during online operation.

Inventive Principle:
Principle #26Copying

3Measurement precision

If verification data is shipped back and forth between nodes, then comprehensive verification is achieved, but network traffic increases

Engineering Contradiction:
Improveverification comprehensivenessVSAvoidnetwork traffic
Core Design Contradiction:
Measurement precisionVSLoss of energy

Solution Approach 1:

The patent extracts only the essential verification elements (checksums, metadata, and verification results) from each node rather than transferring complete verification datasets. This extraction approach maintains verification comprehensiveness by capturing all necessary integrity information in compact form, thereby minimizing network traffic between nodes.

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS11487637B2Global inline name space verification for distributed file systems
Publication Date: 2022.11.01 EMC IP HLDG CO LLC
  • US11487637B2 patent drawing
  • US11487637B2 patent drawing
  • US11487637B2 patent drawing

AI summary

Embodiments for providing global inline name space verification for a distributed file system in a network of a metadata server coupled to a plurality of data servers by taking a global dataless snapshot of a namespace of the distributed file system; walking all of the files in the namespace for each data server and the metadata server to generate parsed information; combining, by an XOR operation, the parsed information into data blocks for each server; obtaining a checksum of each data block of the data blocks; comparing actual and expected checksums from the metadata server and all of the data servers; and generating an alert if a comparison of any actual and expected checksums do not match.