Computing method, device, storage medium and electronic equipment for deterministic routing

Abstract

Embodiments of the present application provide a deterministic routing calculation method and device, a storage medium and an electronic device, comprising: receiving a flexible algorithm Flex-algo policy configuration message sent by a receiving management unit or a control unit, wherein the Flex-algo policy configuration message comprises: deterministic routing calculation related policy information; sending a flooding message to all devices in a network domain within the network domain to instruct the all devices to calculate a path according to the deterministic routing calculation related policy to generate a deterministic routing, wherein the flooding message carries the Flex-algo policy configuration message.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of communication, in particular to a deterministic routing calculation method and device, a storage medium and an electronic device. BACKGROUND

[0002] Currently, traditional IGP (Interior Gateway Protocol) calculates the shortest path for data packet routing through IGP Metric (such as COST value in OSPF). When all messages select the shortest path, many problems will obviously occur, and the TE mechanism is born, such as RSVP-TE / SR-TE technology, which calculates the path and forwards the traffic according to other Metric or Constraints, so that the message takes other paths other than the shortest path. The function of TE is actually to calculate the path based on IGP calculation, and increase other constraints for path calculation. draft-ietf-lsr-flex-algo-17 proposes a Flexible algorithms (Flex-algo) mechanism, which proposes a strategy to enable IGP to calculate the shortest path with constraints, thereby achieving the effect that can only be achieved by TE. The path under certain constraint conditions is created in the IGP protocol, and the forwarding table of the node is configured by flooding in the IGP protocol, which expands the calculation type, Metric type and a set of path calculation constraints. draft-ietf-lsr-flex-algo-bw-con-01 further expands the constraint conditions of excluding the minimum bandwidth and excluding the maximum link delay according to the bandwidth and low latency requirements in the network. Flexible Algorithm Definition (FAD) is a TLV extended for Flex-algo, which is used to announce the specific calculation rules of a Flex-Algo, generally represented by a three-tuple (Metric Type, Calc-Type, topo-constraints). The three-tuple respectively represents link index constraints such as delay index, calculation algorithm constraints such as using SPF algorithm, and topology constraints such as whether to include / exclude certain links during calculation. Different Flex-algo can be regarded as different logical topologies under the same physical topology. These logical topologies have different link weights, carry different metric types, different link affinity attributes, exclude / include certain links, thereby realizing different resource reservation and TE path implementation.

[0003] To meet the business requirements of deterministic services and the like, to implement deterministic technology at the L3 layer, the IETF standard organization proposes deterministic network technology (Deterministic Networking, DetNet), in which RFC8655 defines the architecture of DetNet related technology, provides deterministic services for Layer 2 bridges and Layer 3 routing networks, and the Quality of Service (QoS) requirements include deterministic upper limit of delay, low packet loss rate, reduced jitter and high reliability, etc. Deterministic network uses resource reservation, explicit routing and service protection to provide QoS. Resource reservation is to meet the deterministic resource requirement, which involves resource allocation and reservation, etc., including link bandwidth, delay queue resource, etc. Explicit routing is to meet the path deterministic requirement, which means that the network path of the deterministic service flow needs to be selected in advance to ensure the stability of the routing at least during the service residence period. The routing of the deterministic network uses the deterministic path technology, and the routing path does not change with the real-time change of the network topology. This technology ensures that the transmission path of the deterministic flow is relatively fixed, provides the most basic guarantee for the resource reservation technology, and at the same time, the fixed path also provides the possibility for the accurate calculation of the delay, which is an important technical support to guarantee the limited delay and jitter.

[0004] Currently, Flex-algo does not consider deterministic network technology, such as the end-to-end deterministic delay upper limit, packet loss rate, delay jitter, queue resource and the like in the DetNet technology, and cannot provide deterministic resources and paths for the deterministic network, and cannot realize the deterministic service requirements such as low delay jitter and low packet loss rate.

[0005] Therefore, in view of the problem that the Flex-algo based on the IGP / BGP-LS protocol is used to implement the deterministic delay calculation and reporting in the related art, and the problem that the related art lacks the standard, currently, no effective solution has been proposed.

[0006] Therefore, it is necessary to improve the related art to overcome the defects in the related art. SUMMARY

[0007] Embodiments of the present application provide a deterministic routing calculation method and device, a storage medium and an electronic device to at least solve the problem that the Flex-algo based on the IGP / BGP-LS protocol is used to implement the deterministic delay calculation and reporting in the related art, and the problem that the related art lacks the standard.

[0008] According to an aspect of an embodiment of the present application, a deterministic routing calculation method is provided, comprising: receiving a flexible algorithm (Flex-algo) policy configuration message sent by a management unit or a control unit, wherein the Flex-algo policy configuration message comprises deterministic routing calculation related policy information; sending a flooding message to all devices in a network domain to instruct the devices to calculate a path according to the deterministic routing calculation related policy and generate a deterministic route, wherein the Flex-algo policy configuration message is carried in the flooding message.

[0009] Optionally, the method further comprises: in a case where a protocol used for sending the flooding message in the network domain is an open shortest path first (OSPF) protocol, the deterministic routing calculation related policy information comprises a Metric-Type type added in an OSPF FAD TLV and a deterministic metric type DeterministicMetric added in the OSPF FAD TLV; and in a case where a protocol used for sending the flooding message in the network domain is an intermediate system to intermediate system (IS-IS) protocol, the deterministic routing calculation related policy information comprises a Metric-Type type added in an IS-IS FAD Sub-TLV and a deterministic metric type DeterministicMetric added in the IS-IS FAD Sub-TLV.

[0010] Optionally, the method further comprises: in a case where a protocol used for sending the flooding message in the network domain is an open shortest path first (OSPF) protocol, the deterministic routing calculation related policy information comprises a topology constraint condition for calculating a deterministic path added in a sub-TLV under an OSPF FAD sub-TLV; and in a case where a protocol used for sending the flooding message in the network domain is an intermediate system to intermediate system (IS-IS) protocol, the deterministic routing calculation related policy information comprises a topology constraint condition for calculating a deterministic path added in a sub-TLV under an IS-IS FAD sub-TLV.

[0011] Optionally, the method further comprises: the deterministic routing calculation related policy information comprises an Exclude Maximum Processing Delay sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum Processing Delay sub-TLV is used for excluding maximum node processing delay and jitter; the deterministic routing calculation related policy information comprises an Exclude Maximum Queuing Delay sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum Queuing Delay sub-TLV is used for excluding maximum queue delay and jitter; the deterministic routing calculation related policy information comprises an Exclude Maximum POF Delay sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum POF Delay sub-TLV is used for excluding maximum node ordering delay and jitter; the deterministic routing calculation related policy information comprises an Exclude Maximum Link Loss sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum Link Loss sub-TLV is used for excluding maximum link packet loss number; the deterministic routing calculation related policy information comprises an Exclude Maximum DetNet Reservable Bandwidth sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum DetNet Reservable Bandwidth sub-TLV is used for excluding maximum DetNet reserved bandwidth; and the deterministic routing calculation related policy information comprises an Include-Any Queuing Algorithm sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Include-Any Queuing Algorithm sub-TLV is used for indicating a deterministic network queue scheduling algorithm.The deterministic routing calculation related policy information includes: an Include-All Queuing Algorithm sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, where the Include-All Queuing Algorithm sub-TLV is used to indicate all deterministic network queue scheduling algorithms; and the deterministic routing calculation related policy information includes: an Exclude Queuing Algorithm sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, where the Exclude Queuing Algorithm sub-TLV is used to exclude a target deterministic network queue scheduling algorithm.

[0012] Optionally, the method further comprises: the deterministic routing calculation related policy information comprises an Exclude Maximum Processing Delay sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum Processing Delay sub-TLV is used for excluding maximum node processing delay and jitter; the deterministic routing calculation related policy information comprises an Exclude Maximum Queuing Delay sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum Queuing Delay sub-TLV is used for excluding maximum queue delay and jitter; the deterministic routing calculation related policy information comprises an Exclude Maximum POF Delay sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum POF Delay sub-TLV is used for excluding maximum node ordering delay and jitter; the deterministic routing calculation related policy information comprises an Exclude Maximum Out-of-order Number sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum Out-of-order Number sub-TLV is used for excluding maximum tolerable packet loss number; the deterministic routing calculation related policy information comprises an Exclude Maximum DetNet Reservable Bandwidth sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum DetNet Reservable Bandwidth sub-TLV is used for excluding maximum DetNet reserved bandwidth; and the deterministic routing calculation related policy information comprises an Include-Any Queuing Algorithm sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Include-Any Queuing Algorithm sub-TLV is used for indicating a deterministic network queue scheduling algorithm.The deterministic routing calculation related policy information includes: an Include-All Queuing Algorithm sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Include-All Queuing Algorithm sub-TLV is used to indicate all deterministic network queue scheduling algorithms; the deterministic routing calculation related policy information includes: an Exclude Queuing Algorithm sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Queuing Algorithm sub-TLV is used to exclude target deterministic network queue scheduling algorithms.

[0013] Optionally, the method further includes: instructing any device in the network domain to report a deterministic route carrying the deterministic routing calculation related policy information to a controller.

[0014] Optionally, the deterministic latency jitter index constraint and the topology constraint condition are realized through an extended BGP-LS protocol.

[0015] Optionally, the method further comprises: adding an Exclude Maximum Processing Delay sub-TLV in the BGP-LS protocol, for excluding maximum node processing delay and jitter; adding an Exclude Maximum Queuing Delay sub-TLV in the BGP-LS protocol, for excluding maximum queue delay and jitter; adding an Exclude Maximum POF Delay sub-TLV in the BGP-LS protocol, for excluding maximum node ordering delay and jitter; adding an Exclude Maximum Link Loss sub-TLV in the BGP-LS protocol, for excluding maximum link packet loss; adding an Exclude Maximum DetNet Reservable Bandwidth sub-TLV in the BGP-LS protocol, for excluding maximum DetNet reservable bandwidth; adding an Include-Any Queuing Algorithm sub-TLV in the BGP-LS protocol, for indicating a deterministic network queue scheduling algorithm; adding an Include-All Queuing Algorithm sub-TLV in the BGP-LS protocol, for indicating all deterministic network queue scheduling algorithms; and adding an Exclude Queuing Algorithm sub-TLV in the BGP-LS protocol, for excluding a target deterministic network queue scheduling algorithm.

[0016] According to still another aspect of embodiments of the present application, a computing device for deterministic routing is provided, applied to a device-side node, comprising: a receiving module configured to receive a flexible algorithm (Flex-algo) policy configuration message sent by a management unit or a control unit, wherein the Flex-algo policy configuration message comprises deterministic routing computation related policy information; and a sending module configured to send a flooding message to all devices in a network domain to instruct the all devices to compute a path according to the deterministic routing computation related policy and generate a deterministic route, wherein the Flex-algo policy configuration message is carried in the flooding message.

[0017] According to still another aspect of embodiments of the present application, a computer readable storage medium is also provided, which stores a computer program, wherein the computer program is configured to execute any of the above methods when running.

[0018] According to a further aspect of the embodiments of the present application, an electronic device is provided, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the method of any one of the above by the computer program.

[0019] By the present application, by receiving the flexible algorithm Flex-algo policy configuration message sent by the management unit or the control unit, wherein the Flex-algo policy configuration message comprises: deterministic route calculation related policy information; sending a flooding message in the network domain to all devices in the network domain to instruct the all devices to calculate a path according to the deterministic route calculation related policy to generate a deterministic route, wherein the Flex-algo policy configuration message is carried in the flooding message, the problem of missing in the standard based on Flex-algo using IGP / BGP-LS protocol to implement deterministic delay calculation and reporting in the related art is solved, deterministic resources and paths are provided for the deterministic network, and the deterministic service requirement of low delay jitter and low packet loss rate is achieved. BRIEF DESCRIPTION OF DRAWINGS

[0020] The accompanying drawings, which are included to provide a further understanding of the present application, form a part of the present application and illustrate the exemplary embodiments of the present application and the specification thereof, which are used to explain the present application and do not constitute improper limitations on the present application. In the drawings:

[0021] Figure 1 is a hardware structure block diagram of a computer terminal of the method for calculating deterministic route according to the embodiments of the present application;

[0022] Figure 2 is a flow chart of the method for calculating deterministic route according to the embodiments of the present application;

[0023] Figure 3 is a schematic diagram of a sub-TLV under the IS-IS FAD sub-TLV according to the embodiments of the present application (one);

[0024] Figure 4 is a schematic diagram of a sub-TLV under the IS-IS FAD sub-TLV according to the embodiments of the present application (two);

[0025] Figure 5 is a schematic diagram of a sub-TLV under the IS-IS FAD sub-TLV according to the embodiments of the present application (three);

[0026] Figure 6 is a schematic diagram of a sub-TLV under the IS-IS FAD sub-TLV according to the embodiments of the present application (four);

[0027] Figure 7is a schematic diagram of a sub-TLV under the IS-IS FAD sub-TLV according to an embodiment of the present application (five);

[0028] Figure 8 is a schematic diagram of a sub-TLV under the IS-IS FAD sub-TLV according to an embodiment of the present application (six);

[0029] Figure 9 is a schematic diagram of a sub-TLV under the OSPF FAD TLV according to an embodiment of the present application (one);

[0030] Figure 10 is a schematic diagram of a sub-TLV under the OSPF FAD TLV according to an embodiment of the present application (two);

[0031] Figure 11 is a schematic diagram of a sub-TLV under the OSPF FAD TLV according to an embodiment of the present application (three);

[0032] Figure 12 is a schematic diagram of a sub-TLV under the OSPF FAD TLV according to an embodiment of the present application (four);

[0033] Figure 13 is a schematic diagram of a sub-TLV under the OSPF FAD TLV according to an embodiment of the present application (five);

[0034] Figure 14 is a schematic diagram of a sub-TLV under the OSPF FAD TLV according to an embodiment of the present application (six);

[0035] Figure 15 is a schematic diagram of a Flex-algo deterministic routing calculation process flow according to an embodiment of the present application;

[0036] Figure 16 is a schematic diagram of a deterministic network based on IGP routing according to an embodiment of the present application;

[0037] Figure 17 is a structural block diagram of a deterministic routing calculation device according to an embodiment of the present application. DETAILED DESCRIPTION

[0038] In order to enable persons skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, but not all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by persons skilled in the art without creative labor should belong to the protection scope of the present application.

[0039] It should be noted that the terms "first", "second", and the like in the description and in the claims of the present application and above-mentioned drawings are intended to distinguish similar objects and not necessarily describe a particular sequential or chronological order. It should be understood that the data thus used can be interchanged, where appropriate, so that the embodiments of the application described herein can be practiced in other than the illustrated or described order. Furthermore, the terms "comprise" and "have" and any variations thereof are intended to cover a non-exclusive inclusion, for example, a process, method, system, product, or apparatus that comprises a list of steps or units is not necessarily limited to those clearly listed, but can include other steps or units not expressly listed or inherent to such process, method, product, or apparatus.

[0040] Next, the technical terms in the present application are explained:

[0041] Flex-algo, Flexible Algorithm, flexible algorithm technology algorithm, is a user can independently create a separate topology in IGP and calculate the path of flexible algorithm, provides a separate routing plane, constraint TE path, low delay routing of the proposed solution.

[0042] BGP, Border Gateway Protocol, Border Gateway Protocol, is a routing protocol for autonomous system running on TCP.

[0043] IGP, Interior Gateway Protocol, Interior Gateway Protocol, is a protocol for exchanging data flow channel information between gateways in an autonomous network system.

[0044] DetNet, Deterministic Networking, Deterministic Networking technology, is a technology that helps to realize the IP network from "best effort" to "on time, accurate, fast", control and reduce end-to-end delay.

[0045] TE, Traffic Engineer, Traffic Engineer mechanism, represents a technology for managing and controlling network traffic.

[0046] RSVP, Resource Reservation Protocol, Resource Reservation Protocol, is a signaling protocol located in the third layer of network protocol, independent of various network media, so that the application can inform the network of its Qos requirements through signaling, and the network can reserve corresponding resources for the application.

[0047] OSPF (Open Shortest Path First) is a protocol that, in contrast to RIP (Distance Vector Routing), can be used to make routing decisions within a single Autonomous System (AS).

[0048] Flooding is an algorithm that does not require maintaining the network topology and related routing calculations; it only requires nodes that receive information to forward data packets in a broadcast manner.

[0049] The methods and embodiments provided in this application can be executed on a computer terminal or similar computing device. Taking running on a computer terminal as an example, Figure 1 This is a hardware structure block diagram of a computer terminal for calculating the deterministic routing method according to an embodiment of the present invention. Figure 1 As shown, a computer terminal may include one or more ( Figure 1 Only one is shown in the diagram. A processor 102 (which may include, but is not limited to, a microprocessor unit (MPU) or a programmable logic device (PLD)) and a memory 104 for storing data are also shown. In one exemplary embodiment, the computer terminal may further include a transmission device 106 for communication functions and an input / output device 108. Those skilled in the art will understand that... Figure 1 The structure shown is for illustrative purposes only and does not limit the structure of the computer terminal described above. For example, the computer terminal may also include components that are more complex than those described above. Figure 1 The more or fewer components shown, or having the same Figure 1 Equivalent functions or ratios shown Figure 1 The functions shown have more different configurations.

[0050] The memory 104 can be used to store computer programs, such as application software programs and modules, like the computer program corresponding to the deterministic routing calculation method in this embodiment of the invention. The processor 102 executes various functional applications and data processing by running the computer programs stored in the memory 104, thereby implementing the above-described method. The memory 104 may include high-speed random access memory and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 104 may further include memory remotely located relative to the processor 102, and these remote memories can be connected to a computer terminal via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0051] The transmission device 106 is configured to receive or send data via a network. The network can include a wireless network provided by a communication provider of a computer terminal. In an example, the transmission device 106 includes a network interface controller (NIC) configured to connect to other network devices via a base station to communicate with the Internet. In an example, the transmission device 106 can be a radio frequency (RF) module configured to communicate with the Internet via a wireless manner.

[0052] Figure 2 is a flowchart of a method for calculating deterministic routing according to an embodiment of the present application, as shown in Figure 2 the method includes the following steps:

[0053] In step S202, a flexible algorithm (Flex-algo) policy configuration message sent by a receiving management unit or a control unit is received, wherein the Flex-algo policy configuration message includes deterministic routing calculation related policy information.

[0054] In step S204, a flooding message is sent to all devices in a network domain to instruct the devices to calculate paths according to the deterministic routing calculation related policy and generate deterministic routing, wherein the Flex-algo policy configuration message is carried in the flooding message.

[0055] Through the above steps, by receiving a flexible algorithm (Flex-algo) policy configuration message sent by a receiving management unit or a control unit, wherein the Flex-algo policy configuration message includes deterministic routing calculation related policy information, and sending a flooding message to all devices in a network domain to instruct the devices to calculate paths according to the deterministic routing calculation related policy and generate deterministic routing, wherein the Flex-algo policy configuration message is carried in the flooding message, the problem of lacking deterministic delay calculation and reporting based on Flex-algo using IGP / BGP-LS protocol in the standard is solved, deterministic resources and paths are provided for deterministic networks, and the requirements of deterministic services with low delay jitter and low packet loss rate are achieved.

[0056] Further, a technical solution is provided, and the specific steps include: in the case that the protocol used for sending the flooding message in the network domain is an open shortest path first (OSPF) protocol, the certainty route calculation related policy information includes: a Metric-Type type added in an OSPF FAD TLV, and a deterministic metric type Deterministic Metric added in the OSPF FAD TLV; in the case that the protocol used for sending the flooding message in the network domain is an intermediate system to intermediate system (IS-IS) protocol, the certainty route calculation related policy information includes: a Metric-Type type added in an IS-IS FAD Sub-TLV, and a deterministic metric type Deterministic Metric added in the IS-IS FAD Sub-TLV.

[0057] Further, the method further includes: in the case that the protocol used for sending the flooding message in the network domain is an open shortest path first (OSPF) protocol, the certainty route calculation related policy information includes: a topology constraint condition for calculating a deterministic path added in a sub-TLV under an OSPF FAD sub-TLV; in the case that the protocol used for sending the flooding message in the network domain is an intermediate system to intermediate system (IS-IS) protocol, the certainty route calculation related policy information includes: a topology constraint condition for calculating a deterministic path added in a sub-TLV under an IS-IS FAD sub-TLV.

[0058] Further, the method further comprises: the deterministic routing calculation related policy information comprises: an Exclude Maximum Processing Delay sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum Processing Delay sub-TLV is used for excluding maximum node processing delay and jitter; the deterministic routing calculation related policy information comprises: an Exclude Maximum Queuing Delay sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum Queuing Delay sub-TLV is used for excluding maximum queue delay and jitter; the deterministic routing calculation related policy information comprises: an Exclude Maximum POF Delay sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum POF Delay sub-TLV is used for excluding maximum node ordering delay and jitter; the deterministic routing calculation related policy information comprises: an Exclude Maximum Link Loss sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum Link Loss sub-TLV is used for excluding maximum link packet loss number; the deterministic routing calculation related policy information comprises: an Exclude Maximum DetNet Reservable Bandwidth sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum DetNet Reservable Bandwidth sub-TLV is used for excluding maximum DetNet reserved bandwidth; and the deterministic routing calculation related policy information comprises: an Include-Any Queuing Algorithm sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Include-Any Queuing Algorithm sub-TLV is used for indicating a deterministic network queue scheduling algorithm.The deterministic routing calculation related policy information includes: an Include-All Queuing Algorithm sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, where the Include-All Queuing Algorithm sub-TLV is used to indicate all deterministic network queue scheduling algorithms; and the deterministic routing calculation related policy information includes: an Exclude Queuing Algorithm sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, where the Exclude Queuing Algorithm sub-TLV is used to exclude a target deterministic network queue scheduling algorithm.

[0059] Further, the method further comprises: the deterministic routing calculation related policy information comprises: an Exclude Maximum Processing Delay sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum Processing Delay sub-TLV is used for excluding maximum node processing delay and jitter; the deterministic routing calculation related policy information comprises: an Exclude Maximum Queuing Delay sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum Queuing Delay sub-TLV is used for excluding maximum queue delay and jitter; the deterministic routing calculation related policy information comprises: an Exclude Maximum POF Delay sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum POF Delay sub-TLV is used for excluding maximum node ordering delay and jitter; the deterministic routing calculation related policy information comprises: an Exclude Maximum Out-of-order Number sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum Out-of-order Number sub-TLV is used for excluding maximum tolerable packet loss number; the deterministic routing calculation related policy information comprises: an Exclude Maximum DetNet Reservable Bandwidth sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum DetNet Reservable Bandwidth sub-TLV is used for excluding maximum DetNet reserved bandwidth; and the deterministic routing calculation related policy information comprises: an Include-Any Queuing Algorithm sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Include-Any Queuing Algorithm sub-TLV is used for indicating a deterministic network queue scheduling algorithm.The deterministic routing calculation related policy information includes: an Include-All Queuing Algorithm sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Include-All Queuing Algorithm sub-TLV is used to indicate all deterministic network queue scheduling algorithms; the deterministic routing calculation related policy information includes: an Exclude Queuing Algorithm sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Queuing Algorithm sub-TLV is used to exclude target deterministic network queue scheduling algorithms.

[0060] Further, a technical solution is provided, and the specific steps include: instructing any device in the network domain to report deterministic routing carrying the deterministic routing calculation related policy information to a controller.

[0061] Further, a technical solution is provided, and the specific steps include: realizing deterministic delay jitter index constraint and determining topology constraint conditions through an extended BGP-LS protocol.

[0062] Further, the method further comprises: adding an Exclude Maximum Processing Delay sub-TLV in the BGP-LS protocol, for excluding maximum node processing delay and jitter; adding an Exclude Maximum Queuing Delay sub-TLV in the BGP-LS protocol, for excluding maximum queue delay and jitter; adding an Exclude Maximum POF Delay sub-TLV in the BGP-LS protocol, for excluding maximum node ordering delay and jitter; adding an Exclude Maximum Link Loss sub-TLV in the BGP-LS protocol, for excluding maximum link packet loss; adding an Exclude Maximum DetNet Reservable Bandwidth sub-TLV in the BGP-LS protocol, for excluding maximum DetNet reserved bandwidth; adding an Include-Any Queuing Algorithm sub-TLV in the BGP-LS protocol, for indicating a deterministic network queue scheduling algorithm; adding an Include-All Queuing Algorithm sub-TLV in the BGP-LS protocol, for indicating all deterministic network queue scheduling algorithms; and adding an Exclude Queuing Algorithm sub-TLV in the BGP-LS protocol, for excluding a target deterministic network queue scheduling algorithm.

[0063] To meet the needs of deterministic network for determining path and resource reservation, the present application proposes a method for extending IGP / BGP-LS protocol to implement Flex-algo-based deterministic path calculation and reporting. Specifically, in the extended IGP and BGP-LS protocol, Flex-algo-based deterministic delay jitter index constraints and topology constraints are used to implement deterministic routing calculation, and to complete in-domain flooding and reporting.

[0064] Next, the following embodiments and the description of the drawings are combined Figures 3-14 The calculation method of the above-mentioned deterministic routing is described.

[0065] Embodiment 1

[0066] In this embodiment, the IGP protocol can be extended to implement Flex-algo-based deterministic delay jitter index constraints and topology constraints.

[0067] Optionally, in an embodiment, a Deterministic Delay Metric is added. In which, a Metric-Type is added in OSPF FAD TLV, (0: IGP Metric, 1: MinUnidirectional Link Delay, 2: TE Metric), a Deterministic Metric is added, or a Metric-Type is added in IS-IS FAD Sub-TLV, (0: IGP Metric, 1: MinUnidirectional Link Delay, 2: TE Metric), a Deterministic Metric is added.

[0068] It should be noted that when Flex-algo performs SPF based on Deterministic Metric, the optimal path calculated will have the minimum cumulative Deterministic Delay / Jitter and Loss. Deterministic Delay / Jitter needs to consider the forwarding delay in the node and the transmission delay / jitter on the link. The forwarding delay in the node generally includes the processing delay for the packet and the queue delay in the queue waiting for scheduling. When implementing replication elimination sorting in the deterministic network, the sorting delay also needs to be considered. Deterministic Loss needs to consider the packet loss in the node and the packet loss on the link.

[0069] Optionally, in an embodiment, constraint conditions for calculating deterministic paths in deterministic networks are added, such as excluding maximum node processing delay, excluding maximum queue delay, excluding maximum node sorting delay, excluding maximum link packet loss number, excluding maximum DetNet reserved bandwidth, excluding queue scheduling algorithm, Include-any queue scheduling algorithm, Include-any replication elimination sorting capability, etc.

[0070] Figure 3 Fig. 1 is a schematic diagram of IS-IS FAD sub-TLV under sub-TLV according to an embodiment of the present application, which provides a schematic diagram of IS-IS Exclude Maximum Processing Delay sub-TLV. As shown in Fig. 1, the IS-IS Exclude Maximum Processing Delay sub-TLV includes a Type field, a Length field, and a Value field. Figure 3As shown in FIG. 6, by extending the IS-IS Exclude Maximum Processing Delay sub-TLV which belongs to the sub-TLV under the IS-IS FAD sub-TLV, an IS-IS Exclude Maximum Processing Delay sub-TLV is used to exclude the maximum node processing delay and jitter.

[0071] It should be noted that, Figure 3 The Type in the IS-IS Exclude Maximum Processing Delay sub-TLV is 8 bits, used to indicate the type of excluding the maximum node processing delay. The Length is 8 bits, used to indicate the length of the sub-TLV. The Maximum Processing Delay is 32 bits, used to indicate the maximum node processing delay. The Maximum Processing Delay Variation is 32 bits, used to indicate the maximum node processing delay jitter.

[0072] Figure 4 FIG. 7 is a schematic diagram of a sub-TLV under the IS-IS FAD sub-TLV according to the embodiments of the present application (two), which provides a schematic diagram of an IS-IS Exclude Maximum Queuing Delay sub-TLV. As shown in FIG. 7, by extending the IS-IS Exclude Maximum Queuing Delay sub-TLV which belongs to the sub-TLV under the IS-IS FAD sub-TLV, an IS-IS Exclude Maximum Queuing Delay sub-TLV is used to exclude the maximum node processing delay and jitter. Figure 4

[0073] It should be noted that, Figure 4 The Type in the IS-IS Exclude Maximum Processing Delay sub-TLV is 8 bits, used to indicate the type of excluding the maximum node processing delay. The Length is 8 bits, used to indicate the length of the sub-TLV. The Maximum Processing Delay is 32 bits, used to indicate the maximum node processing delay. The Maximum Processing Delay Variation is 32 bits, used to indicate the maximum node processing delay jitter.

[0074] Figure 5 FIG. 8 is a schematic diagram of a sub-TLV under the IS-IS FAD sub-TLV according to the embodiments of the present application (three), which provides a schematic diagram of an IS-IS Exclude Maximum POF Delay sub-TLV. As shown in FIG. 8, by extending the IS-IS Exclude Maximum POF Delay sub-TLV which belongs to the sub-TLV under the IS-IS FAD sub-TLV, an IS-IS Exclude Maximum POF Delay sub-TLV is used to exclude the maximum node processing delay and jitter. Figure 5 ​As shown in FIG. 8, by extending IS-IS Exclude Maximum POF Delay sub-TLV under IS-IS FAD sub-TLV, the maximum POF delay and jitter are excluded.

[0075] It should be noted that, Figure 5 Type in the above table is 8 bits, indicating the type of excluding the maximum node POF delay. Length is 8 bits, indicating the length of the sub-TLV. Maximum POF Delay is 32 bits, indicating the maximum node POF delay. Maximum POF Delay Variation is 32 bits, indicating the maximum node POF delay jitter.

[0076] Figure 6 FIG. 9 is a schematic diagram of a sub-TLV under IS-IS FAD sub-TLV according to an embodiment of the present application (four), which provides a schematic diagram of IS-IS Exclude Maximum Link Loss sub-TLV. As shown in FIG. 9, by extending IS-IS Exclude Maximum Link Loss sub-TLV under IS-IS FAD sub-TLV, the maximum link packet loss is excluded. Figure 6

[0077] It should be noted that, Figure 6 Type in the above table is 8 bits, indicating the type of excluding the maximum link packet loss. Length is 8 bits, indicating the length of the sub-TLV. A is 1 bit, indicating that the link packet loss changes more than the threshold. Maximum Link Loss is 24 bits, indicating the maximum link packet loss.

[0078] Figure 7 FIG. 10 is a schematic diagram of a sub-TLV under IS-IS FAD sub-TLV according to an embodiment of the present application (five), which provides a schematic diagram of IS-IS Exclude Maximum DetNet Reservable Bandwidth sub-TLV. As shown in FIG. 10, by extending IS-IS Exclude Maximum DetNet Reservable Bandwidth sub-TLV under IS-IS FAD sub-TLV, the maximum DetNet reserved bandwidth is excluded. Figure 7

[0079] It should be noted that, Figure 7 ​​Type is 8 bits, indicating the type of excluding maximum DetNet reserved bandwidth. Length is 8 bits, indicating the length of the sub-TLV. Maximum DetNet Reservable Bandwidth is 32 bits, indicating the maximum DetNet reserved bandwidth.

[0080] Figure 8 is a schematic diagram of a sub-TLV under the IS-IS FAD sub-TLV according to the embodiments of the present application (six), as shown in Figure 8 provides a schematic diagram of an IS-IS Include-Any Queuing Algorithm sub-TLV. As shown in Figure 8 by extending the IS-IS Include-Any Queuing Algorithm sub-TLV under the IS-IS FAD sub-TLV, a deterministic network queue scheduling algorithm is included.

[0081] It should be noted that, Figure 8 Type is 8 bits, indicating the type of including any queue algorithm. Length is 8 bits, indicating the length of the sub-TLV. Queuing Algorithm Flags is 32 bits, indicating the queue algorithm, wherein D represents the Dealine scheduling algorithm, C represents the CBS scheduling algorithm, T represents the TAS scheduling algorithm, Q represents the CQF scheduling algorithm, and A represents the ATS scheduling algorithm.

[0082] It should be noted that the type of the sub-TLV under the IS-IS FAD sub-TLV can be modified by modifying the type indicated by Type in Figure 8 , wherein the type indicated by Type can be the type indicating including all maximum queue algorithms, or the type indicating excluding queue algorithms, but is not limited thereto.

[0083] In one embodiment, a type of IS-IS Include-All Queuing Algorithm sub-TLV is provided, referring to Figure 8As shown in the embodiment, by extending IS-IS Include-All Queuing Algorithm sub-TLV under IS-IS FAD sub-TLV, a type for determining all deterministic network queue scheduling algorithms is provided. Wherein, Type is 8 bits, used to indicate the type of containing all maximum queue algorithms. Length is 8 bits, used to indicate the length of the sub-TLV. Queuing Algorithm Flags is 32 bits, used to indicate the queue algorithm, wherein D represents the Dealine scheduling algorithm, C represents the CBS scheduling algorithm, T represents the TAS scheduling algorithm, Q represents the CQF scheduling algorithm, and A represents the ATS scheduling algorithm.

[0084] In one embodiment, a type of IS-IS Exclude Queuing Algorithm sub-TLV is provided, referring to Figure 8 As shown in the embodiment, by extending IS-IS Exclude Queuing Algorithm sub-TLV under IS-IS FAD sub-TLV, a type for excluding certain deterministic network queue scheduling algorithms is provided. Wherein, Type is 8 bits, used to indicate the type of excluding queue algorithms. Length is 8 bits, used to indicate the length of the sub-TLV. Queuing Algorithm Flags is 32 bits, used to indicate the queue algorithm, wherein D represents the Dealine scheduling algorithm, C represents the CBS scheduling algorithm, T represents the TAS scheduling algorithm, Q represents the CQF scheduling algorithm, and A represents the ATS scheduling algorithm.

[0085] Figure 9 is a schematic diagram of a sub-TLV under the OSPF FAD TLV according to the embodiments of the present application, and provides a schematic diagram of an OSPF Exclude Maximum Processing Delay sub-TLV. As shown in the figure, Figure 9 As shown in the embodiment, by extending OSPF Exclude Maximum Processing Delay sub-TLV under the sub-TLV under the OSPF FAD TLV, a type for excluding maximum node processing delay and jitter is provided.

[0086] It should be noted that, Figure 9Type is 16 bits, indicating the type of excluding node maximum packet processing delay jitter. Length is 16 bits, indicating the length of the sub-TLV. Maximum Processing Delay is 32 bits, indicating the node maximum packet processing delay. Maximum Processing Delay Variation is 32 bits, indicating the node maximum packet processing delay jitter.

[0087] Figure 10 is a schematic diagram of the sub-TLV under the OSPF FAD TLV according to the embodiments of the present application (two), providing a schematic diagram of an OSPF Exclude Maximum Queuing Delay sub-TLV. As shown in Figure 10 , by extending the OSPF Exclude Maximum Queuing Delay sub-TLV under the sub-TLV under the OSPF FAD TLV, the maximum queue delay and jitter are excluded.

[0088] It should be noted that, Figure 10 Type is 16 bits, indicating the type of excluding node maximum queue delay jitter. Length is 16 bits, indicating the length of the sub-TLV. Maximum Queuing Delay is 32 bits, indicating the node maximum queue delay. Maximum Queuing Delay Variation is 32 bits, indicating the node maximum queue delay jitter.

[0089] Figure 11 is a schematic diagram of the sub-TLV under the OSPF FAD TLV according to the embodiments of the present application (three), providing a schematic diagram of an OSPF Exclude Maximum POF Delay sub-TLV. As shown in Figure 11 , by extending the OSPF Exclude Maximum POF Delay sub-TLV under the sub-TLV under the OSPF FAD TLV, the maximum node ordering (Packet Ordering Function, POF) delay and jitter are excluded.

[0090] It should be noted that, Figure 11Type is 16 bits, indicating the type of excluding node maximum queuing delay jitter. Length is 16 bits, indicating the length of the sub-TLV. Maximum Queuing Delay is 32 bits, indicating the maximum queuing delay of the node. Maximum POF Delay is 32 bits, indicating the maximum out-of-order delay of the node. Maximum POF Delay Variation is 32 bits, indicating the maximum out-of-order delay jitter of the node.

[0091] Figure 12 is a schematic diagram of the sub-TLV under the OSPF FAD TLV according to the embodiments of the present application (four), which provides a schematic diagram of an OSPF Exclude Maximum Out-of-order Number sub-TLV. As shown in Figure 12 , by extending the OSPF Exclude Maximum Out-of-order Number sub-TLV under the sub-TLV under the OSPF FAD TLV, the maximum tolerable out-of-order packet number is excluded.

[0092] It should be noted that, Figure 12 Type is 16 bits, indicating the type of excluding node maximum out-of-order number. Length is 16 bits, indicating the length of the sub-TLV. Maximum Queuing Delay is 32 bits, indicating the maximum queuing delay of the node. A is 1 bit, indicating that the link packet number change exceeds the threshold. Maximum LinkLoss is 24 bits, indicating the maximum link packet number.

[0093] Figure 13 is a schematic diagram of the sub-TLV under the OSPF FAD TLV according to the embodiments of the present application (five), which provides a schematic diagram of an OSPF Exclude Maximum DetNet Reservable Bandwidth sub-TLV. As shown in Figure 13 , the OSPF Exclude Maximum DetNet Reservable Bandwidth sub-TLV under the sub-TLV under the OSPF FAD TLV is extended, which is used to exclude the maximum DetNet reserved bandwidth.

[0094] It should be noted that, Figure 13Type is 16 bits, indicating the type of excluding maximum DetNet reserved bandwidth. Length is 16 bits, indicating the length of the sub-TLV. Maximum DetNet Reservable Bandwidth is 32 bits, indicating the maximum DetNet reserved bandwidth.

[0095] Figure 14 is a schematic diagram of a sub-TLV under the OSPF FAD TLV according to the embodiments of the present application (six), which provides a schematic diagram of an OSPF Include-Any Queuing Algorithm sub-TLV. As shown in Figure 14 , by extending the OSPF Include-Any Queuing Algorithm sub-TLV under the sub-TLV under the OSPF FAD TLV, a deterministic network queue scheduling algorithm is included.

[0096] It should be noted that, Figure 14 Type in is 16 bits, indicating the type of including any queue algorithm. Length is 16 bits, indicating the length of the sub-TLV. Queuing Algorithm Flags is 32 bits, indicating the queue algorithm, wherein D represents the Dealine scheduling algorithm, C represents the CBS scheduling algorithm, T represents the TAS scheduling algorithm, Q represents the CQF scheduling algorithm, and A represents the ATS scheduling algorithm.

[0097] It should be noted that the type of the sub-TLV under the OSPF FAD TLV can be modified by modifying Figure 14 Type. Among them, the type indicated by Type can be the type of indicating the inclusion of any queue algorithm, or the type of indicating the exclusion of queue algorithm, but not limited to this.

[0098] In one embodiment, a type of OSPF Include-All Queuing Algorithm sub-TLV is provided. Referring to Figure 14As shown, in the present embodiment, OSPFInclude-All Queuing Algorithm sub-TLV under the sub-TLV under the OSPF FAD TLV is extended to indicate all deterministic network queue scheduling algorithms. Wherein, Type is 16 bits, used to indicate the type of containing any queue algorithm. Length is 16 bits, used to indicate the length of the sub-TLV. Queuing Algorithm Flags is 32 bits, used to indicate the queue algorithm, wherein D represents the Dealine scheduling algorithm, C represents the CBS scheduling algorithm, T represents the TAS scheduling algorithm, Q represents the CQF scheduling algorithm, and A represents the ATS scheduling algorithm.

[0099] In one embodiment, the type of an extended OSPF Exclude Queuing Algorithm sub-TLV is provided. Referring to Figure 14 As shown, in the present embodiment, the extended OSPF Exclude Queuing Algorithm sub-TLV under the sub-TLV under the OSPF FAD TLV is extended to exclude certain deterministic network queue scheduling algorithms. Wherein, Type is 16 bits, used to indicate the type of excluding queue algorithms. Length is 16 bits, used to indicate the length of the sub-TLV. Queuing Algorithm Flags is 32 bits, used to indicate the queue algorithm, wherein D represents the Dealine scheduling algorithm, C represents the CBS scheduling algorithm, T represents the TAS scheduling algorithm, Q represents the CQF scheduling algorithm, and A represents the ATS scheduling algorithm.

[0100] Optionally, in one embodiment, the BGP-LS protocol can be extended to implement deterministic delay jitter index constraints and topology constraint conditions based on Flex-algo.

[0101] Further, the BGP-LS Exclude Maximum Processing Delay sub-TLV can be extended to exclude maximum node processing delay and jitter, and the data format of the extended BGP-LS Exclude Maximum Processing Delay sub-TLV can refer to Figure 9 .

[0102] Further, the BGP-LS Exclude Maximum Queuing Delay sub-TLV can be extended to exclude maximum queuing delay and jitter, and the data format of the extended BGP-LS Exclude Maximum Queuing Delay sub-TLV can refer to Figure 10 .

[0103] Further, the BGP-LS Exclude Maximum POF Delay sub-TLV can be extended to exclude maximum packet ordering function (POF) delay and jitter, and the data format of the extended BGP-LS Exclude Maximum POF Delay sub-TLV can refer to Figure 11 .

[0104] Further, the BGP-LS Exclude Maximum Link Loss sub-TLV can be extended to exclude maximum link packet loss, and the data format of the extended BGP-LS Exclude Maximum Link Loss sub-TLV can refer to Figure 12 .

[0105] Further, the BGP-LS Exclude Maximum DetNet Reservable Bandwidth sub-TLV can be extended to exclude maximum DetNet reservable bandwidth, and the data format of the extended BGP-LS Exclude Maximum DetNet Reservable Bandwidth sub-TLV can refer to Figure 13 .

[0106] Further, in an embodiment, the BGP-LS Include-Any Queuing Algorithm sub-TLV can be extended to include deterministic network queuing scheduling algorithm, and the data format of the extended BGP-LS Include-Any Queuing Algorithm sub-TLV can refer to Figure 14 .

[0107] Further, the BGP-LS Exclude-All Queuing Algorithm sub-TLV can be extended to exclude all deterministic network queue scheduling algorithms, and the data format of the extended BGP-LS Exclude-All Queuing Algorithm sub-TLV can refer to Figure 14 .

[0108] Further, the BGP-LS Exclude-All Queuing Algorithm sub-TLV can be extended to exclude all deterministic network queue scheduling algorithms, and the data format of the extended BGP-LS Exclude-All Queuing Algorithm sub-TLV can refer to Figure 14 .

[0109] Embodiment 2

[0110] The embodiment proposes a method for determining and reporting a Flex-algo deterministic path, wherein the IGP protocol including IS-IS protocol and OSPF protocol is extended to implement deterministic path calculation, and the extended BGP-LS protocol is used to implement deterministic path reporting, thereby realizing deterministic path calculation and deterministic resource reservation. Figure 15 is a schematic diagram of a Flex-algo deterministic routing calculation process according to an embodiment of the present application. As shown in Figure 15 , the specific steps are as follows:

[0111] Step 1502, the management or control unit configures a Flex-algo strategy to the device side, wherein the Flex-algo strategy includes deterministic routing calculation related strategy information, that is, a constraint condition for calculating a deterministic path is configured to construct a Flex-algo plane;

[0112] Step 1504, after receiving the configuration message, the device floods the Flex-algo strategy in the network domain, wherein the deterministic routing calculation related strategy is carried.

[0113] Step 1506, after receiving the flooding message, the device in the network domain calculates a path according to the deterministic routing calculation strategy, generates a deterministic route, including calculating an SPF path based on a Deterministic Metric, and the optimal path calculated has the smallest cumulative Deterministic Metric.

[0114] Next, the deterministic network based on the IGP algorithm will be described in combination with the drawings Figure 16 and the following embodiments.

[0115] Embodiment 3

[0116] The embodiment provides a technical scheme for calculating a deterministic route by an IGP domain OSPF protocol. Figure 16 is a schematic diagram of a deterministic network based on IGP route calculation according to the embodiment of the application. As shown in Figure 16 The embodiment provides a technical scheme for calculating a deterministic route by an IGP domain OSPF protocol.

[0117] Step 1, the controller or network management (equivalent to the receiving management unit or control unit) issues a configuration Flex-algo policy to the DetNet node H, wherein the policy contains a strategy for calculating a deterministic route by using an OSPF protocol, wherein the OSPF FAD information is carried, the Metric-Type type Deterministic Delay Metric in the FAD is carried, and the constraint condition of path calculation is carried, for example, the OSPF Exclude Maximum Processing Delay sub-TLV, the maximum packet processing delay of the node is limited to be within 10us, the maximum processing delay jitter is within 2us, the OSPF Exclude Maximum Queuing Delay sub-TLV is carried, the maximum queue delay of the node is limited to be within 10us, the maximum queue delay jitter is within 2us, and the OSPF Include-Any Maximum Queuing Algorithm sub-TLV is carried, wherein the C is 1, and the queue scheduling algorithm of the node is limited to use CBS.

[0118] Step 2, after the node H receives the Flex-algo policy, the node H floods the policy to other nodes in the network by using the OSPF protocol. Assuming that the FAD announced by the node H has the highest priority, all nodes in the network will calculate a deterministic SPF path based on the Deterministic Delay Metric of the corresponding Flex-algo plane according to the FAD.

[0119] Embodiment 4

[0120] The embodiment provides a technical scheme for calculating a deterministic route by an IGP domain IS-IS protocol. As shown in Figure 16As shown in the diagram, this application proposes a method for calculating Flex-algo deterministic routes based on IGP. The controller or network management system sends a Flex-algo policy carrying deterministic path calculation to node H in the DetNet network. Node H calculates the route according to the deterministic calculation strategy in the Flex-algo policy using the IS-IS protocol within the IGP domain. The specific process is as follows:

[0121] Step 1: The controller or network management system sends a Flex-algo configuration policy to DetNet node H, which includes a policy for calculating deterministic routes using the IS-IS protocol. This policy carries the IS-IS FAD sub-TLV, where the Metric-Type is Deterministic Delay Metric. It also carries constraints for path calculation, such as IS-IS ExcludeMaximum Processing Delay sub-TLV, limiting the node's maximum packet processing delay to within 5µs and maximum processing delay jitter to within 1µs; IS-IS Exclude Maximum Queuing Delay sub-TLV, limiting the node's maximum queueing delay to within 5µs and maximum queueing delay jitter to within 1µs; and IS-IS Include-Any Maximum Queuing Algorithm sub-TLV, where Q is set to 1, restricting the node's queue scheduling algorithm to CQF.

[0122] Step 2: After receiving the Flex-algo policy, the DetNet node runs the IS-IS protocol to calculate deterministic routes and floods them within the domain.

[0123] Example 5

[0124] This embodiment proposes a technical solution for reporting Flex-algo deterministic routing strategies using BGP-LS. For example... Figure 16 As shown in the diagram, this application proposes a method for calculating Flex-algo deterministic routes based on IGP. The controller or network management system sends a Flex-algo policy carrying deterministic path calculation to node H in the DetNet network. Node H calculates the route according to the deterministic calculation strategy in the Flex-algo policy using the IS-IS protocol within the IGP domain. Node H can report the Flex-algo deterministic routing policy via BGP-LS. The specific process is as follows:

[0125] Step 1: The controller or network management system sends the Flex-algo policy configuration to the DetNet node H, which includes a policy for calculating deterministic routes within the IGP domain.

[0126] Step 2, after receiving the Flex-algo policy, DetNet node H floods the Flex-algo policy in the domain, and all nodes in the Flex-algo plane distributedly calculate the deterministic route.

[0127] Step 3, DetNet node H reports the Flex-algo deterministic route policy to the controller through the BGP-LS protocol, wherein the BGP-LS Exclude Maximum Processing Delay sub-TLV is carried to exclude the maximum node processing delay and jitter, the BGP-LS Exclude Maximum Queuing Delay sub-TLV is carried to exclude the maximum queue delay and jitter, etc.

[0128] Through the above embodiments, the present application proposes a method for Flex-algo deterministic path calculation and reporting, which extends the IGP protocol including IS-IS protocol and OSPF protocol to realize deterministic path calculation, and extends the BGP-LS protocol to realize deterministic path reporting, thereby realizing deterministic path calculation and deterministic route flooding and reporting, wherein the extension includes:

[0129] 1. The path calculation type of Flex-algo in the IGP protocol is extended, and a deterministic delay calculation type is added.

[0130] 2. The constraint conditions of path calculation of Flex-algo in the IGP protocol are extended, and the following are added: excluding maximum node packet processing delay and jitter, sorting maximum queue delay and jitter, excluding maximum sorting delay and jitter, excluding maximum link packet loss, excluding maximum DetNet reserved bandwidth, excluding queue scheduling algorithm, containing any queue scheduling algorithm, containing all queue scheduling algorithms, etc.

[0131] 3. The strategy reporting of path calculation of Flex-algo in the BGP-LS protocol is extended, including sorting maximum queue delay and jitter, excluding maximum sorting delay and jitter, excluding maximum link packet loss, excluding maximum DetNet reserved bandwidth, excluding queue scheduling algorithm, containing any queue scheduling algorithm, containing all queue scheduling algorithms, etc.

[0132] Figure 17 is a structural block diagram of a deterministic route calculation device according to an embodiment of the present application. As shown in Figure 17 the deterministic route calculation device is applied to a device-side node and includes:

[0133] The receiving module 1702 is configured to receive a flexible algorithm (Flex-algo) policy configuration message sent by the management unit or the control unit, wherein the Flex-algo policy configuration message comprises deterministic route calculation related policy information.

[0134] The sending module 1704 is configured to send a flooding message to all devices in the network domain to instruct the all devices to calculate a path according to the deterministic route calculation related policy and generate a deterministic route, wherein the Flex-algo policy configuration message is carried in the flooding message.

[0135] By the above scheme, the Flex-algo policy configuration message sent by the management unit or the control unit is received, wherein the Flex-algo policy configuration message comprises deterministic route calculation related policy information; and a flooding message is sent to all devices in the network domain to instruct the all devices to calculate a path according to the deterministic route calculation related policy and generate a deterministic route, wherein the Flex-algo policy configuration message is carried in the flooding message, thereby solving the problem of missing implementation of deterministic delay calculation and reporting based on Flex-algo using IGP / BGP-LS protocol in the standard in the related art, providing deterministic resources and paths for deterministic networks, and achieving low-latency jitter and low-packet-loss deterministic service requirements.

[0136] Further, in the case that the protocol used for sending the flooding message in the network domain is an open shortest path first (OSPF) protocol, the deterministic route calculation related policy information comprises a Metric-Type type added in an OSPF FAD TLV and a deterministic delay index type (Deterministic Metric) added in the OSPF FAD TLV; and in the case that the protocol used for sending the flooding message in the network domain is an intermediate system to intermediate system (IS-IS) protocol, the deterministic route calculation related policy information comprises a Metric-Type type added in an IS-IS FAD Sub-TLV and a deterministic delay index type (Deterministic Metric) added in the IS-IS FAD Sub-TLV.

[0137] Further, in the case that the protocol used for sending the flooding message in the network domain is the Open Shortest Path First (OSPF) protocol, the deterministic route computation related policy information comprises: a topology constraint condition for computing the deterministic path added in a sub-TLV under an OSPF FAD sub-TLV; in the case that the protocol used for sending the flooding message in the network domain is the Intermediate System to Intermediate System (IS-IS) protocol, the deterministic route computation related policy information comprises: a topology constraint condition for computing the deterministic path added in a sub-TLV under an IS-IS FAD sub-TLV.

[0138] Further, the deterministic routing calculation related policy information includes: an Exclude Maximum Processing Delay sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum Processing Delay sub-TLV is used to exclude maximum node processing delay and jitter; the deterministic routing calculation related policy information includes: an Exclude Maximum Queuing Delay sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum Queuing Delay sub-TLV is used to exclude maximum queue delay and jitter; the deterministic routing calculation related policy information includes: an Exclude Maximum POF Delay sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum POF Delay sub-TLV is used to exclude maximum node ordering delay and jitter; the deterministic routing calculation related policy information includes: an Exclude Maximum Link Loss sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum Link Loss sub-TLV is used to exclude maximum link packet loss number; the deterministic routing calculation related policy information includes: an Exclude Maximum DetNet Reservable Bandwidth sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum DetNet Reservable Bandwidth sub-TLV is used to exclude maximum DetNet reserved bandwidth; and the deterministic routing calculation related policy information includes: an Include-Any Queuing Algorithm sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, wherein the Include-Any Queuing Algorithm sub-TLV is used to indicate a deterministic network queue scheduling algorithm.The deterministic routing calculation related policy information includes: an Include-All Queuing Algorithm sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, where the Include-All Queuing Algorithm sub-TLV is used to indicate all deterministic network queue scheduling algorithms; and the deterministic routing calculation related policy information includes: an Exclude Queuing Algorithm sub-TLV added in a sub-TLV under the IS-IS FAD sub-TLV, where the Exclude Queuing Algorithm sub-TLV is used to exclude a target deterministic network queue scheduling algorithm.

[0139] Further, the deterministic routing calculation related policy information includes: an Exclude Maximum Processing Delay sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum Processing Delay sub-TLV is used to exclude maximum node processing delay and jitter; the deterministic routing calculation related policy information includes: an Exclude Maximum Queuing Delay sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum Queuing Delay sub-TLV is used to exclude maximum queue delay and jitter; the deterministic routing calculation related policy information includes: an Exclude Maximum POF Delay sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum POF Delay sub-TLV is used to exclude maximum node ordering delay and jitter; the deterministic routing calculation related policy information includes: an Exclude Maximum Out-of-order Number sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum Out-of-order Number sub-TLV is used to exclude maximum tolerated packet loss number; the deterministic routing calculation related policy information includes: an Exclude Maximum DetNet Reservable Bandwidth sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum DetNet Reservable Bandwidth sub-TLV is used to exclude maximum DetNet reserved bandwidth; and the deterministic routing calculation related policy information includes: an Include-Any Queuing Algorithm sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Include-Any Queuing Algorithm sub-TLV is used to indicate a deterministic network queue scheduling algorithm.The deterministic routing calculation related policy information includes an Include-All Queuing Algorithm sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Include-All Queuing Algorithm sub-TLV is used to indicate all deterministic network queue scheduling algorithms; the deterministic routing calculation related policy information includes an Exclude Queuing Algorithm sub-TLV added in a sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Queuing Algorithm sub-TLV is used to exclude a target deterministic network queue scheduling algorithm.

[0140] Further, the deterministic routing calculation device further includes a reporting module, configured to instruct any device in the network domain to report a deterministic route carrying the deterministic routing calculation related policy information to a controller.

[0141] Further, the deterministic routing calculation device further includes an expansion module, configured to implement deterministic delay jitter index constraint and determine a topology constraint condition through an extended BGP-LS protocol.

[0142] Further, an Exclude Maximum Processing Delay sub-TLV is added in the BGP-LS protocol to exclude maximum node processing delay and jitter; an Exclude Maximum Queuing Delay sub-TLV is added in the BGP-LS protocol to exclude maximum queue delay and jitter; an Exclude Maximum POF Delay sub-TLV is added in the BGP-LS protocol to exclude maximum node ordering delay and jitter; an Exclude Maximum Link Loss sub-TLV is added in the BGP-LS protocol to exclude maximum link packet loss; an Exclude Maximum DetNet Reservable Bandwidth sub-TLV is added in the BGP-LS protocol to exclude maximum DetNet reservable bandwidth; an Include-Any Queuing Algorithm sub-TLV is added in the BGP-LS protocol to indicate a deterministic network queue scheduling algorithm; an Include-All Queuing Algorithm sub-TLV is added in the BGP-LS protocol to indicate all deterministic network queue scheduling algorithms; and an Exclude Queuing Algorithm sub-TLV is added in the BGP-LS protocol to exclude a target deterministic network queue scheduling algorithm

[0143] In an example embodiment, the computer readable storage medium described above can include, but is not limited to, a U disk, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk or an optical disk, and various media that can store computer programs.

[0144] The specific examples in the embodiment can refer to the examples described in the above embodiments and example embodiments, and the embodiment will not be described here.

[0145] Optionally, in the embodiment, the computer program stored in the computer readable storage medium described above can perform the following steps:

[0146] S1, receiving a flexible algorithm (Flex-algo) policy configuration message sent by a management unit or a control unit, wherein the Flex-algo policy configuration message includes deterministic route calculation related policy information;

[0147] S2, sending a flooding message to all devices in the network domain to instruct the all devices to calculate a path according to the deterministic routing calculation related policy to generate a deterministic route, wherein the flooding message carries the Flex-algo policy configuration message.

[0148] Embodiments of the present application also provide an electronic device, comprising a memory and a processor, the memory storing a computer program, and the processor being configured to execute the computer program to perform the steps in any of the above method embodiments.

[0149] Optionally, in the embodiment, the processor can be configured to perform the following steps by the computer program:

[0150] S1, receiving a flexible algorithm (Flex-algo) policy configuration message sent by a management unit or a control unit, wherein the Flex-algo policy configuration message comprises deterministic routing calculation related policy information;

[0151] S2, sending a flooding message to all devices in the network domain to instruct the all devices to calculate a path according to the deterministic routing calculation related policy to generate a deterministic route, wherein the flooding message carries the Flex-algo policy configuration message.

[0152] In one exemplary embodiment, the electronic device can further comprise a transmission device and an input / output device, wherein the transmission device is connected to the processor, and the input / output device is connected to the processor.

[0153] The specific examples in the embodiment can refer to the examples described in the above embodiments and exemplary implementation manners, and the embodiment will not be described here again.

[0154] Obviously, those skilled in the art should understand that the modules or steps of the present application described above can be realized by general computing devices, which can be concentrated on a single computing device or distributed on a network composed of multiple computing devices, and they can be realized by program codes executable by computing devices, so that they can be stored in storage devices and executed by computing devices, and in some cases, the steps shown or described can be executed in different order, or they can be manufactured into individual integrated circuit modules, or multiple modules or steps among them can be manufactured into a single integrated circuit module. Thus, the present application is not limited to any specific combination of hardware and software.

[0155] The above merely provides the preferred embodiments of the present application, and is not used to limit the present application. For those skilled in the art, the present application can have various modifications and changes. Any modifications, equivalent replacements, improvements, etc. made within the principles of the present application shall fall into the protective scope of the present application.

Claims

1. A method for calculating deterministic routes, characterized in that... Applied to device-side nodes, including: Receive a Flex-algo policy configuration message sent by a management unit or control unit, wherein the Flex-algo policy configuration message includes: policy information related to deterministic route calculation; A flood message is sent to all devices within the network domain to instruct all devices to calculate paths according to the deterministic routing calculation policy and generate a deterministic route. The flood message carries the Flex-algo policy configuration message.

2. The method for calculating deterministic routes according to claim 1, characterized in that, The method further includes: When the protocol used to send flooding messages within the network domain is the Open Shortest Path (OSPF) protocol, the deterministic route calculation-related policy information includes: the Metric-Type added to the OSPF FAD TLV, and the Deterministic Delay Metric added to the OSPF FAD TLV. When the protocol used to send flooding messages within the network domain is the Intermediate System to Intermediate System (IS-IS) protocol, the deterministic routing calculation related policy information includes: the Metric-Type added to the IS-IS FAD Sub-TLV, and the Deterministic Metric added to the IS-IS FAD Sub-TLV.

3. The method for calculating deterministic routes according to claim 2, characterized in that, The method further includes: When the protocol used to send flooding messages within the network domain is the Open Shortest Path (OSPF) protocol, the deterministic route calculation-related policy information includes: topological constraints added to the sub-TLV under the OSPF FAD sub-TLV for calculating deterministic paths. When the protocol used to send flooding messages within the network domain is the intermediate system to intermediate system IS-IS protocol, the deterministic routing calculation related strategy information includes: topological constraints added to the sub-TLV under the IS-IS FAD sub-TLV for calculating deterministic paths.

4. The method for calculating deterministic routes according to claim 3, characterized in that, The method further includes: The deterministic routing calculation related strategy information includes: an Exclude Maximum Processing Delay sub-TLV added to the sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum Processing Delay sub-TLV is used to exclude the maximum node processing delay and jitter; The deterministic routing calculation related strategy information includes: an Exclude Maximum Queuing Delay sub-TLV added to the sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum Queuing Delay sub-TLV is used to exclude maximum queue delay and jitter; The deterministic routing calculation related strategy information includes: adding an Exclude Maximum POF Delay sub-TLV to the sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum POF Delay sub-TLV is used to exclude the maximum node sorting delay and jitter; The deterministic routing calculation related policy information includes: an Exclude Maximum Link Loss sub-TLV added to the sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Maximum Link Loss sub-TLV is used to exclude the maximum number of link packet losses; The deterministic routing calculation related strategy information includes: an Exclude Maximum DetNet Reservable Bandwidth sub-TLV added to the sub-TLV under the IS-IS FAD sub-TLV, wherein the ExcludeMaximum DetNet Reservable Bandwidth sub-TLV is used to exclude the maximum DetNet reserved bandwidth. The deterministic routing calculation related policy information includes: an Include-Any Queuing Algorithm sub-TLV added to the sub-TLV under the IS-IS FAD sub-TLV, wherein the Include-Any Queuing Algorithm sub-TLV is used to indicate the deterministic network queue scheduling algorithm. The deterministic routing calculation related policy information includes: an Include-All Queuing Algorithm sub-TLV added to the sub-TLV under the IS-IS FAD sub-TLV, wherein the Include-All Queuing Algorithm sub-TLV is used to indicate all deterministic network queue scheduling algorithms. The deterministic routing calculation related policy information includes: an Exclude Queuing Algorithm sub-TLV added to the sub-TLV under the IS-IS FAD sub-TLV, wherein the Exclude Queuing Algorithm sub-TLV is used to exclude the target deterministic network queue scheduling algorithm.

5. The method for calculating deterministic routes according to claim 3, characterized in that, The method further includes: The deterministic routing calculation related strategy information includes: an Exclude Maximum Processing Delay sub-TLV added to the sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum Processing Delay sub-TLV is used to exclude the maximum node processing delay and jitter; The deterministic routing calculation related policy information includes: an Exclude Maximum Queuing Delay sub-TLV added to the sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum Queuing Delay sub-TLV is used to exclude maximum queue delay and jitter; The deterministic routing calculation related strategy information includes: an Exclude Maximum POF Delay sub-TLV added to the sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum POF Delay sub-TLV is used to exclude the maximum node sorting delay and jitter; The deterministic routing calculation related policy information includes: an Exclude Maximum Out-of-order Number sub-TLV added to the sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Maximum Out-of-order Number sub-TLV is used to exclude the maximum tolerable number of packet losses; The deterministic routing calculation related policy information includes: an Exclude Maximum DetNet Reservable Bandwidth sub-TLV added to the sub-TLV under the OSPF FAD sub-TLV, wherein the ExcludeMaximum DetNet Reservable Bandwidth sub-TLV is used to exclude the maximum DetNet reserved bandwidth. The deterministic routing calculation related policy information includes: an Include-Any Queuing Algorithm sub-TLV added to the sub-TLV under the OSPF FAD sub-TLV, wherein the Include-Any Queuing Algorithm sub-TLV is used to indicate the deterministic network queue scheduling algorithm. The deterministic routing calculation related policy information includes: an Include-All Queuing Algorithm sub-TLV added to the sub-TLV under the OSPF FAD sub-TLV, wherein the Include-All Queuing Algorithm sub-TLV is used to indicate all deterministic network queue scheduling algorithms. The deterministic routing calculation related policy information includes: an Exclude Queuing Algorithm sub-TLV added to the sub-TLV under the OSPF FAD sub-TLV, wherein the Exclude Queuing Algorithm sub-TLV is used to exclude the target deterministic network queue scheduling algorithm.

6. The method for calculating deterministic routes according to claim 1, characterized in that, The method further includes: The system instructs any device within the network domain to report a deterministic route carrying the relevant policy information for the deterministic route calculation to the controller.

7. The method for calculating deterministic routes according to claim 6, characterized in that, The method further includes: Deterministic latency jitter metric constraints and topology constraints are achieved through an extended BGP-LS protocol.

8. The method for calculating deterministic routes according to claim 7, characterized in that, The method further includes: The BGP-LS protocol is modified to include Exclude Maximum Processing Delay sub-TLV to exclude maximum node processing delay and jitter. The BGP-LS protocol is modified to include the Exclude Maximum Queuing Delay sub-TLV to exclude maximum queue delay and jitter. The BGP-LS protocol is modified to include Exclude Maximum POF Delay sub-TLV to exclude maximum node sorting delay and jitter. The BGP-LS protocol is modified to include an Exclude Maximum Link Loss sub-TLV to exclude the maximum number of packet losses on a link. The BGP-LS protocol is modified to include an Exclude Maximum DetNet Reservable Bandwidth sub-TLV to exclude the maximum DetNet reserved bandwidth. Add Include-Any Queuing Algorithm sub-TLV to the BGP-LS protocol to indicate a deterministic network queue scheduling algorithm; Add Include-All Queuing Algorithm sub-TLV to the BGP-LS protocol to indicate all deterministic network queue scheduling algorithms; An Exclude Queuing Algorithm sub-TLV is added to the BGP-LS protocol to exclude target deterministic network queue scheduling algorithms.

9. A computational apparatus for deterministic routing, characterized in that, Applied to device-side nodes, including: The receiving module is used to receive a Flex-algo policy configuration message sent by the management unit or control unit, wherein the Flex-algo policy configuration message includes: policy information related to deterministic route calculation; The sending module is used to send a flood message to all devices within the network domain, instructing all devices to calculate paths according to the deterministic routing calculation policy and generate a deterministic route, wherein the flood message carries the Flex-algo policy configuration message.

10. A computer-readable storage medium, characterized in that, The storage medium stores a computer program, wherein the computer program is configured to execute the method described in any one of claims 1 to 8 when it is run.

11. An electronic device, characterized in that, The method includes a memory and a processor, wherein the memory stores a computer program and the processor is configured to perform the method of any one of claims 1 to 8 through the computer program.

Images