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

Patent metadata

Field	Value
Publication number	US-12526233-B2
Application number	US-202218725932-A
Country	US
Kind code	B2
Filing date	Aug 30, 2022
Priority date	Jan 10, 2022
Publication date	Jan 13, 2026
Grant date	Jan 13, 2026

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.

First claim

What is claimed is:

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 the virtual networks supported by the head node, and the target CQF scheduling parameter is one of the at least one CQF scheduling parameter 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.

2 . The path computation method of claim 1 , wherein determining the plurality of target nodes and the 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 plurality of target nodes according to the target CQF scheduling parameter supported by the plurality of target nodes; and determining the plurality of participating links as the plurality of target links belonging to the target virtual network.

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

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

5 . The path computation method of claim 1 , wherein acquiring the target binding relationship comprises:
acquiring a first candidate binding relationship, wherein the first candidate binding relationship is a second binding relationship between the virtual networks and the at least one CQF scheduling parameter 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 third binding relationship between the virtual networks and the CQF scheduling parameters supported by a 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.

6 . 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.

7 . 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.

8 . 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.

9 . 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.

10 . 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 .

11 . 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 .

12 . 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 non-transitory 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 .

Assignees

• Zte Corp

Inventors

• Peng Shaofu
• Tan Bin

Classifications

• H04L45/12 Primary

  Shortest path evaluation · CPC title

• H04L45/124

  using a combination of metrics · CPC title

• H04L47/28

  in relation to timing considerations · CPC title

• H04L47/2416

  Real-time traffic · CPC title

• H04L47/17

  Interaction among intermediate nodes, e.g. hop by hop · CPC title