# US 2025/0097151 A1 · Path computation method, node, storage medium and computer program product

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0097151 A1
- Document ID: US20250097151A1
- Status: Published application
- Kind: A1
- Application number: 18/725,932
- Filed: 2022-08-30
- Published: 2025-03-20
- Earliest claimed: 2022-01-10
- Assignees: Zte Corporation
- Applicants: Zte Corporation
- Inventors: Shaofu PENG; Bin TAN
- Web page: https://patentgrep.com/patent/US20250097151A1

## CPC

- H04L 45/76: Routing in software-defined topologies, e.g. routing between virtual machines
- H04L 45/12: Shortest path evaluation
- H04L 45/123: {Evaluation of link metrics (techniques for monitoring network metrics H04L43/08)}
- H04L 45/124: {using a combination of metrics}
- H04L 45/14: {Routing performance; Theoretical aspects}
- H04L 45/30: Routing of multiclass traffic
- H04L 45/302: Route determination based on requested QoS
- H04L 45/3065: {for real time traffic}
- H04L 45/32: {Flooding (denial of service attacks H04L63/1458)}
- H04L 45/64: using an overlay routing layer
- H04L 47/17: Interaction among intermediate nodes, e.g. hop by hop
- H04L 47/2416: Real-time traffic
- H04L 47/28: in relation to timing considerations
- Y02A 10/40: Controlling or monitoring, e.g. of flood or hurricane; Forecasting, e.g. risk assessment or mapping
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- Y02A: TECHNOLOGIES FOR ADAPTATION TO CLIMATE CHANGE

## Abstract

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.

## Claims

### Claim 1

A path computation method, applied to a head node, the path computation method comprising:
acquiring virtual networks and Cyclic Queuing and Forwarding (CQF) scheduling parameters supported by nodes, wherein each of the nodes supports at least one CQF scheduling parameter;
acquiring a target binding relationship, wherein the target binding relationship is a binding relationship between a target virtual network and a target CQF scheduling parameter, the target virtual network is one of virtual networks supported by the head node, and the target CQF scheduling parameter is one of CQF scheduling parameters supported by the head node;
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.

### Claim 2 (depends on 1)

The path computation method of claim 1, wherein 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 comprises:
determining a plurality of participating nodes supporting the target CQF scheduling parameter according to the target binding relationship and the virtual networks and the CQF scheduling parameters supported by the nodes;
determining the plurality of participating nodes as the plurality of target nodes belonging to the target virtual network;
determining a plurality of participating links corresponding to the target nodes according to the target CQF scheduling parameter supported by the target nodes; and
determining the plurality of participating links as the plurality of target links belonging to the target virtual network.

### Claim 3 (depends on 1)

The path computation method of claim 1, wherein 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 comprises:
determining the tail node in the target virtual network;
determining a plurality of candidate paths to the tail node in the target virtual network according to the plurality of target nodes and the plurality of target links;
calculating constraint metric values of the candidate paths according to the target CQF scheduling parameter; and
determining the candidate path corresponding to a smallest one of the constraint metric values as the target path.

### Claim 4 (depends on 3)

The path computation method of claim 3, wherein calculating constraint metric values of the candidate paths according to the target CQF scheduling parameter comprises:
acquiring link metric values of all target links comprised in the candidate paths;
calculating node metric values of all intermediate nodes comprised in the candidate paths according to the target CQF scheduling parameter; and
calculating the constraint metric values of the candidate paths according to the link metric values and the node metric values.

### Claim 5 (depends on 1)

The path computation method of claim 1, wherein acquiring a target binding relationship comprises:
acquiring a first candidate binding relationship, wherein the first candidate binding relationship is a binding relationship between the virtual networks and the CQF scheduling parameters supported by the head node;
acquiring a second candidate binding relationship sent by a node other than the head node, wherein the second candidate binding relationship is a binding relationship between virtual networks and CQF scheduling parameters supported by the node other than the head node; and
selecting the target binding relationship from the first candidate binding relationship and the second candidate binding relationship according to a binding relationship priority.

### Claim 6 (depends on 5)

The path computation method of claim 5, further comprising:
flooding the CQF scheduling parameters supported by the head node through parameter advertisement information and flooding the first candidate binding relationship through binding relationship advertisement information, such that a node other than the head node calculates a routing path in the target virtual network according to the CQF scheduling parameters supported by the head node and the first candidate binding relationship.

### Claim 7 (depends on 6)

The path computation method of claim 6, wherein the parameter advertisement information comprises a CQF parameter field, and
the CQF parameter field carries the CQF scheduling parameters supported by the head node.

### Claim 8 (depends on 6)

The path computation method of claim 6, wherein the binding relationship advertisement information comprises a binding relationship field, and
the binding relationship field carries the first candidate binding relationship or the target binding relationship.

### Claim 9 (depends on 8)

The path computation method of claim 8, wherein in response to the binding relationship field carrying the first candidate binding relationship, the binding relationship advertisement information further comprises a priority field,
the priority field carries the binding relationship priority, and
the binding relationship priority is used for enabling a node other than the head node to acquire the target binding relationship from all the candidate binding relationships according to the binding relationship priority.

### Claim 10 (depends on 1)

A node, comprising:
a memory, a processor, and a computer program stored in the memory and executable by the processor, wherein the computer program, when executed by the processor, causes the processor to perform the path computation method of claim 1.

### Claim 11 (depends on 1)

A non-transitory computer-readable storage medium, storing a computer-executable instruction which, when executed by a computer, causes the computer to perform the path computation method of claim 1.

### Claim 12 (depends on 1)

A computer program product, comprising a computer program or a computer instruction stored in a non-transitory computer-readable storage medium, where the computer program or the computer instruction, when read from the computer-readable storage medium and executed by a processor of a computer device, causes the computer device to perform the path computation method of claim 1.