HDFS Replication Node Selection via SDN Topology

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Hadoop Distributed File System (HDFS) does not consider the distance between data nodes when replicating blocks, leading to inefficient use of network bandwidth due to treating all off-rack data nodes as equidistant and not accounting for network bandwidth usage.

Innovation Solution

Integration of a Software Defined Networking (SDN) controller to provide relative distance information between data nodes, allowing the name node to select optimal replication locations based on network topology and parameters such as link state, bandwidth, and Round Trip Time, optimizing block placement and replication.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If HDFS replicates blocks on off-rack data nodes for redundancy, then reliability is improved, but network bandwidth consumption increases

Engineering Contradiction:
Improvedata redundancyVSAvoidnetwork bandwidth
Core Design Contradiction:
ReliabilityVSLoss of energy

Solution Approach 1:

The patent applies local quality by differentiating between different off-rack data nodes based on their network characteristics. Instead of treating all off-rack nodes uniformly, the system evaluates specific network paths, bandwidth availability, and distance metrics for each candidate node, selecting replication destinations with optimal network properties to minimize bandwidth consumption while maintaining redundancy.

Inventive Principle:
Principle #3Local quality

Solution Approach 2:

The system changes the parameters considered in block placement decisions by introducing network-aware metrics such as bandwidth, distance, and path quality. The name node evaluates multiple parameters including network topology information and dynamically selects replication destinations based on current network conditions, transforming the static rack-aware placement into a dynamic network-optimized placement strategy.

Inventive Principle:
Principle #35Parameter changes

2Device complexity

If HDFS treats all off-rack data nodes as equidistant, then device complexity is reduced, but measurement precision deteriorates

Engineering Contradiction:
Improveplacement logicVSAvoiddistance measurement
Core Design Contradiction:
Device complexityVSMeasurement precision

Solution Approach 1:

The patent introduces an intermediary component that provides network topology information and distance calculations to the HDFS name node. This intermediary layer handles the complex network measurements and path analysis, allowing the HDFS placement logic to remain relatively simple while gaining access to precise network distance and bandwidth information through standardized interfaces.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Ease of operation

If HDFS does not consider network topology for block placement, then ease of operation is improved, but productivity deteriorates

Engineering Contradiction:
Improveblock placementVSAvoidnetwork efficiency
Core Design Contradiction:
Ease of operationVSProductivity

Solution Approach 1:

The system implements self-service by enabling the HDFS name node to autonomously evaluate network topology information and make informed block placement decisions. The name node automatically queries network metrics, calculates optimal replication destinations, and adjusts placement strategies without manual intervention, thereby improving network efficiency while maintaining operational simplicity through automated decision-making.

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS10474644B2Systems and methods for optimizing selection of a replication data node in a distributed file system
Publication Date: 2019.11.12 DELL PROD LP
  • US10474644B2 patent drawing
  • US10474644B2 patent drawing
  • US10474644B2 patent drawing

AI summary

Aspects of the present invention include optimizing selection of a replication data node in a Hadoop Distributed File System. In embodiments of the present invention, optimizing the replication data node selection can be based on a priorities based algorithm. In embodiments of the present invention, optimizing replication data node selection can be based on a relative comparison of parameters.