CQF Path Computation for Decentralized Deterministic Networks

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

In large-scale and decentralized deterministic network scenarios without a centralized controller, the requirements of deterministic services cannot be met, and no deterministic forwarding path can be provided.

Innovation Solution

A path computation method that allows nodes to acquire virtual networks and CQF scheduling parameters, determine target nodes and links, and calculate a target path using a head node, without relying on a centralized controller, by utilizing CQF scheduling parameters and binding relationships within the network.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If a centralized controller is used to calculate deterministic paths, then path computation accuracy and SLA compliance are improved, but system complexity and single point of failure risk increase

Engineering Contradiction:

Improvedeterministic service reliabilityVSAvoidnetwork architecture complexity

Core Design Contradiction:

ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments the centralized path computation function into distributed components at each network node. Each node independently computes paths using local CQF scheduling parameters and binding relationships, eliminating the need for a single centralized controller while maintaining deterministic service reliability through distributed decision-making

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent enables nodes to self-service by autonomously computing deterministic paths using locally stored CQF scheduling parameters and binding relationships. Each node independently determines target nodes, links, and paths without external controller intervention, reducing system complexity while maintaining service reliability

Inventive Principle:

Principle #25Self-service

2Reliability

If a centralized controller is deployed to meet deterministic service requirements, then path computation capability is improved, but deployment flexibility and scalability deteriorate

Engineering Contradiction:

Improvedeterministic forwarding capabilityVSAvoiddecentralized scenario adaptability

Core Design Contradiction:

ReliabilityVSAdaptability or versatility

Solution Approach 1:

The patent makes each network node universal by equipping it with both CQF scheduling capabilities and path computation capabilities. Nodes can function as both data plane elements and control plane elements, enabling the system to adapt to both centralized and decentralized scenarios without requiring specialized controller infrastructure

Inventive Principle:

Principle #6Universality (Multi-functionality)

Solution Approach 2:

The patent inverts the traditional control architecture by placing computation capabilities at the edge nodes rather than at a central controller. This inversion enables decentralized operation where nodes independently compute paths, improving adaptability to diverse deployment scenarios while maintaining deterministic forwarding capability

Inventive Principle:

Principle #13The other way round (Inversion)

3Manufacturing precision

If strict explicit paths are calculated by centralized controller with resource reservation, then SLA requirements are met, but computation time and signaling overhead increase

Engineering Contradiction:

Improvepath computation precisionVSAvoidpath computation time

Core Design Contradiction:

Manufacturing precisionVSLoss of time

Solution Approach 1:

The patent performs preliminary actions by pre-establishing binding relationships between virtual networks and CQF scheduling parameters at each node. When path computation is needed, nodes can quickly determine feasible paths using these pre-configured bindings, reducing computation time while maintaining precision through the structured binding framework

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent uses partial action by computing paths only for the specific virtual network and CQF parameter bindings that are relevant to the current service requirement. Rather than computing all possible paths, nodes focus computation on subsets defined by the binding relationships, reducing overall computation time while maintaining necessary precision

Inventive Principle:

Principle #16Partial or excessive action

Data Source

PatentUS12526233B2Path computation method, node, storage medium and computer program product

Publication Date: 2026.01.13 ZTE CORP

AI summary

A path calculation method, which is applied to a head node, may include: acquiring virtual networks and Cyclic Queuing and Forwarding (CQF) scheduling parameters supported by nodes, where each of the nodes supports at least one CQF scheduling parameter; acquiring a target binding relationship, where the target binding relationship is a binding relationship between a target virtual network and a target CQF scheduling parameter; determining a plurality of target nodes and a plurality of target links belonging to the target virtual network according to the target binding relationship and the virtual networks and the CQF scheduling parameters supported by the nodes; and calculating a target path to a tail node in the target virtual network according to the plurality of target nodes, the plurality of target links, and the target CQF scheduling parameter.