Node Selection Method Using State Table Mapping

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In cloud platform systems, efficiently finding a node to serve request messages in a resource pool is challenging due to nodes being busy or offline, especially when massive requests require different specific environments.

Innovation Solution

A node selection method that receives request messages, searches a node state table for idle nodes matching product information, and sends requests to these nodes to build installation packages, dynamically updating node states and adjusting node quantities to maintain efficient service.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If nodes are assigned to specific environments in a resource pool, then service specialization is improved, but node availability decreases when nodes are busy or offline

Engineering Contradiction:
Improvenode specializationVSAvoidnode availability
Core Design Contradiction:
Adaptability or versatilityVSReliability

Solution Approach 1:

The patent pre-establishes a node state table that maps product information to corresponding nodes before requests arrive. This allows the system to quickly identify available nodes for specific environments without searching the entire resource pool during request processing, thereby maintaining both specialization and availability.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The node state table acts as an intermediary structure between the request processing system and the resource pool. It mediates by pre-storing the mapping relationships between products, environments, and nodes, enabling fast lookup of available nodes without direct scanning of the entire node pool.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Adaptability or versatility

If the system searches for nodes in a resource pool during request processing, then node selection flexibility is improved, but request processing time increases

Engineering Contradiction:
Improvenode selection flexibilityVSAvoidrequest processing time
Core Design Contradiction:
Adaptability or versatilityVSLoss of time

Solution Approach 1:

The system performs preliminary action by pre-building and maintaining the node state table with mappings between product information and nodes. This eliminates the need for real-time searching during request processing, reducing processing time while preserving selection flexibility through the pre-organized data structure.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The node state table creates a copy or representation of the resource pool's node-to-product mapping relationships. This copied structure can be quickly queried without affecting the actual resource pool, enabling fast node selection while maintaining full flexibility in node assignment.

Inventive Principle:
Principle #26Copying

3Productivity

If nodes are dynamically adjusted in quantity, then resource utilization is improved, but system complexity increases

Engineering Contradiction:
Improveresource utilizationVSAvoidsystem complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The system implements feedback mechanisms where the node state table is dynamically updated based on node availability and request patterns. This allows the system to adjust node quantities and assignments in response to actual usage, improving resource utilization while managing complexity through automated feedback-driven adjustments.

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS11861341B2Node selection method and apparatus
Publication Date: 2024.01.02 HUAWEI TECH CO LTD
  • US11861341B2 patent drawing
  • US11861341B2 patent drawing
  • US11861341B2 patent drawing

AI summary

A node selection method and apparatus are disclosed. The method includes: receiving a request message, where the request message is used to request to provide an installation package of a product required by a user; searching, based on the product information in the request message, a node state table for a target node corresponding to the product information, where the node state table includes at least one correspondence; and sending the request message to the target node, so that the target node builds the corresponding product installation package for the product required by the user (203). The method can quickly find the target node that can provide a service, to complete job dispatching, and improve job dispatching efficiency.