Slice packet network path planning method and system, storage medium and electronic device

Abstract

The invention relates to the technical field of data communication, and provides a slice packet network path planning method and system, a storage medium and an electronic device.The method comprises the steps that a universal strategy and a constraint strategy for generating a standby path are received, and constraint conditions in the constraint strategy are added into a linked list; verifying the validity of the constraint conditions in the linked list in a link database; determining a label stack according to the verified constraint condition; and verifying whether the tag stack accords with the general strategy, and determining a standby path according to a verification result. According to the slice packet network path planning method, the T I-LFA strategy module is added, and the T I-LFA strategy module interacts with the link database and the T I-LFA calculation path, so that the T I-LFA calculation path can controllably determine the standby path according to the preset constraint strategy, the difficulty of determining the standby path is reduced, and the success rate of obtaining the standby path is improved.

Description

Technical Field

[0001] The present disclosure belongs to the field of data communication technology, and in particular, relates to a slice packet network path planning method, system, storage medium and electronic device. Background Art

[0002] The SPN network is to build a deterministic network, and each traffic path must comply with the plan. In the SPN network, a BE backup path is introduced. When using a BE (Best Effort) backup path and providing backup path protection, TI-LFA (Topology Independent Loop-Free Alternates) technology is a common choice. TI-LFA allows traffic to be forwarded based on a pre-calculated backup path in the event of a failure, thereby maintaining the stability and continuity of the network. Since TI-LFA is the shortest path result dynamically calculated based on the cost value, in order to obtain a BE backup path that meets the expectations, the current solution requires planning the cost value of the entire network.

[0003] This approach brings two problems:

[0004] 1. Cost value planning is particularly complex, not universal, prone to mismatch and omission, and not conducive to operation and maintenance.

[0005] 2. Poor isolation. Any mismatch or omission of the link cost value will cause unknown traffic path or oscillation or failure of backup path calculation. Summary of the invention

[0006] To solve the above problems, the present invention provides a slice packet network path planning method, system, storage medium and electronic device, which adopts the setting of general strategy and constraint strategy, calculates the label stack, and verifies it. The verified label stack is used as a backup path, which can determine the backup path in a controllable manner, reduces the difficulty of determining the backup path, and improves the success rate of obtaining the backup path.

[0007] The present invention is achieved through the following technical solutions:

[0008] In a first aspect, an embodiment of the present disclosure provides a slice packet network path planning method, the method comprising:

[0009] receiving a general strategy and a constraint strategy for generating a backup path, and adding the constraint conditions in the constraint strategy to a linked list;

[0010] Verifying the validity of the constraint conditions in the linked list in a link database; determining a label stack according to the verified constraint conditions;

[0011] Verify whether the label stack complies with the general policy, and determine the backup path according to the verification result.

[0012] Further, the receiving of the general strategy and the constraint strategy for generating the backup path, and adding the constraint conditions in the constraint strategy to the linked list, includes:

[0013] The general strategy and a plurality of constraint strategies for generating the backup path are received, and the constraint condition in one of the constraint strategies is added to the linked list.

[0014] Furthermore, the slice packet network path planning method also includes: calculating and outputting the native TI-LFA backup path.

[0015] Furthermore, the general strategy includes: setting a maximum number of label stacks to constrain the maximum number of labels in the label stack.

[0016] Further, verifying the validity of the constraint conditions in the linked list in the link database; and determining the label stack according to the verified constraint conditions include:

[0017] Verify the validity of all the constraints in the linked list in the link database;

[0018] The label stack is determined according to all the constraint conditions that pass verification.

[0019] Furthermore, determining the label stack according to all verified constraints includes:

[0020] Determine the starting point of the TI-LFA path calculation, take out the constraint condition from the linked list, and determine the node where the constraint condition is located;

[0021] Calculate the shortest path before convergence and the shortest path after convergence from the starting point of the TI-LFA path calculation to the node where the constraint condition is located, and compare them, and determine the difference point label according to the comparison result;

[0022] When the comparison result is different, adding the difference point label and the node label where the constraint condition is located to the label stack;

[0023] All the constraints in the linked list are traversed, and all the difference point labels and all the node labels where the constraints are located are added to the label stack.

[0024] Further, the verifying whether the label stack complies with the general policy and determining the backup path according to the verification result includes:

[0025] Verify whether the number of labels in the label stack exceeds the maximum number of the label stack set in the general policy.

[0026] In a second aspect, an embodiment of the present disclosure further provides a slice packet network path planning system, the system comprising: a TI-LFA policy module, a TI-LFA path calculation and a link database;

[0027] The TI-LFA policy module is used to receive the general policy and constraint policy for generating a backup path, and add the constraint conditions in the constraint policy to the linked list; and is also used to interact with the TI-LFA path calculation, verify whether the label stack complies with the general policy, and determine the backup path according to the verification result;

[0028] The link database is used to verify the validity of the constraint conditions in the linked list in the link database;

[0029] The TI-LFA path calculation is used to interact with the TI-LFA policy module and determine the label stack according to the verified constraint condition.

[0030] In a third aspect, the embodiments of the present disclosure further provide a computer-readable storage medium storing one or more programs, wherein:

[0031] When one or more programs are executed, any of the above-mentioned slice packet network path planning methods can be implemented.

[0032] In a fourth aspect, an embodiment of the present disclosure further provides an electronic device, comprising a processor, a communication interface, the above-mentioned computer-readable storage medium, and a communication bus; wherein the processor, the communication interface, and the computer-readable storage medium communicate with each other via the communication bus;

[0033] in,

[0034] The processor is configured to execute a program stored in a computer-readable storage medium.

[0035] Compared with the prior art, the present invention has the following advantages:

[0036] By adding a TI-LFA policy module and making it interact with the link database and TI-LFA path calculation, the TI-LFA path calculation can controllably determine the backup path according to the preset constraint strategy, which reduces the difficulty of determining the backup path and improves the success rate of obtaining the backup path.

[0037] Other features and advantages of the present disclosure will be described in the following description, and partly become apparent from the description, or be understood by implementing the present disclosure. The purpose and other advantages of the present disclosure can be realized and obtained by the structures pointed out in the description, claims and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present disclosure. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0039] Figure 1 A schematic diagram of a slice packet network path planning method flow provided in an embodiment of the present disclosure;

[0040] Figure 2 A schematic diagram of a slice grouping network structure provided in an embodiment of the present disclosure;

[0041] Figure 3a A schematic diagram of the structure of a t il fa preparation path 1 provided in an embodiment of the present disclosure;

[0042] Figure 3b A schematic diagram of the structure of the t il fa preparation path 2 provided in an embodiment of the present disclosure;

[0043] Figure 3c A schematic diagram of the structure of the t il fa preparation path 3 provided in an embodiment of the present disclosure;

[0044] Figure 3d A schematic diagram of the structure of the t il fa preparation path 4 provided in an embodiment of the present disclosure;

[0045] Figure 4 A partial flow chart of a slice packet network path planning method provided in an embodiment of the present disclosure;

[0046] Figure 5 A structural diagram of a slice packet network path planning system provided in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0047] In order to make the purpose, technical solution and advantages of the embodiments of the present disclosure clearer, the technical solution in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present disclosure.

[0048] First, Figure 1 A schematic diagram of a slice packet network path planning method provided in an embodiment of the present disclosure is shown in FIG. Figure 1 As shown, the slice grouping network path planning method of the embodiment of the present disclosure includes:

[0049] S1: Receive the general strategy and constraint strategy for generating a backup path, and add the constraint conditions in the constraint strategy to the linked list.

[0050] Specifically, the TI-LFA policy module receives instructions sent by an external server, network management device or configuration module, confirms the general policy and constraint policy for generating a backup path, and adds the constraint conditions in the constraint policy to the linked list. The general policy usually includes restrictions on the label stack and other backup policies, and the constraint policy is a set of constraint conditions used to determine the label stack.

[0051] S2: Verify the validity of the constraints in the linked list in the link database; determine the label stack based on the verified constraints.

[0052] Specifically, the TI-LFA policy module verifies the validity of the constraints in the linked list in the link database, and the TI-LFA policy module interacts with the TI-LFA path calculation, and adds the obtained label to the label stack according to the verified constraints.

[0053] S3: Verify whether the label stack complies with the general policy and determine the backup path based on the verification result.

[0054] Specifically, the TI-LFA policy module verifies the label stack determined by all constraints in the constraint policy. If it meets the restrictions on the label stack in the general policy, it is determined as a backup path. If it does not meet the restrictions on the label stack in the general policy, the next constraint policy is used to determine the next label stack, or other backup policies in the general policy are used to determine the backup path.

[0055] In some examples, the slice packet network path planning method also includes: calculating and outputting a native TI-LFA backup path.

[0056] Specifically, the TI-LFA path calculation calculates and outputs the native TI-LFA backup path, and the native TI-LFA backup path is cached in the TI-LFA policy module for backup. When the backup path cannot be determined after the TI-LFA policy module and the TI-LFA path calculation interact, the native TI-LFA backup path can be directly used as the backup path. Usually, before the TI-LFA policy module receives the constraint policy for generating the backup path, the TI-LFA path calculation completes the calculation and outputs the native TI-LFA backup path.

[0057] In some examples, receiving a general strategy and a constraint strategy for generating a backup path, adding a constraint condition in the constraint strategy to a linked list, further includes:

[0058] S11: receiving a general strategy and multiple constraint strategies for generating a backup path, and adding a constraint condition in one of the constraint strategies to a linked list.

[0059] Specifically, the TI-LFA policy module receives instructions sent by an external server, network management device or configuration module, confirms the general policy and multiple constraint policies for generating backup paths, and verifies the validity of multiple constraint policies in the link database. The general policy usually includes restrictions on label stacks and other backup policies. The constraint policy is a set of constraints used to determine the label stack. It receives multiple constraint policies. When a constraint policy cannot obtain a backup path, it tries to use the next constraint policy to calculate the backup path until the backup path is determined or all constraint policies are traversed.

[0060] In some examples, the general policy includes: setting the maximum number of label stacks to constrain the maximum number of labels in the label stack. When the TI-LFA policy module interacts with the TI-LFA path calculation and calculates all constraints, new labels will be generated. At this time, the new labels need to be pushed into the label stack, and the maximum number of label stacks is used to constrain the maximum number of labels in the label stack. When the number of labels in the label stack exceeds the set maximum number of label stacks, the native TI-LFA backup path is used as a backup path, or other backup policies in the general policy are used. Setting the maximum number of label stacks to constrain the maximum number of labels in the label stack can constrain the path length of the backup path, or prevent data redundancy, affecting the stability and computing speed of the entire network.

[0061] In some examples, the constraint conditions in the linked list are verified for validity in the link database; and the label stack is determined according to the verified constraint conditions, specifically including:

[0062] S21: Verify the validity of all constraints in the linked list in the link database.

[0063] Specifically, the TI-LFA policy module verifies the validity of all constraints in the linked list in the link database.

[0064] S22: Determine a label stack according to all verified constraints.

[0065] Specifically, the TI-LFA policy module interacts with the TI-LFA path calculation module, and adds the obtained label to the label stack according to the verified constraint conditions.

[0066] In some examples, based on all verified constraints, a label stack is determined, including:

[0067] S221: Determine the starting point of the TI-LFA path calculation, take out the first constraint condition from the linked list, and determine the node where the first constraint condition is located.

[0068] S222: Calculate the shortest path before convergence and the shortest path after convergence from the starting point of the TI-LFA path calculation to the node where the constraint condition is located, and compare them. Determine the difference point label according to the comparison result.

[0069] Specifically, the shortest path before convergence and the shortest path after convergence from the starting point of the T I-LFA path calculation to the node where the constraint condition is located are calculated, and compared. When the comparison results are different, the difference point label of the shortest path before convergence and the shortest path after convergence from the starting point of the T I-LFA path calculation to the node where the constraint condition is located is determined. When the comparison results of the shortest path before convergence and the shortest path after convergence from the starting point of the T I-LFA path calculation to the node where the constraint condition is located are the same, the next constraint condition is taken out from the linked list, and the node where the next constraint condition is located is determined.

[0070] S223: When the comparison result is different, the difference point label and the node label where the constraint condition is located are added to the label stack.

[0071] Specifically, when a difference label exists, the difference label is added to the label stack.

[0072] S224: Traverse all constraints in the linked list, and add all difference point labels and all node labels where the constraints are located to the label stack.

[0073] Specifically, after completing steps S221-S223, the next constraint is taken out from the linked list, and steps S221-S223 are repeated until there are no more constraints in the linked list. It should be noted that after a constraint is used up, it will be deleted from the linked list.

[0074] In some examples, verifying whether the label stack complies with the general policy and determining the backup path based on the verification result include:

[0075] S31: Verify whether the number of labels in the label stack exceeds the maximum number of label stacks set in the common policy.

[0076] Specifically, the TI-LFA policy module verifies the label stack determined by all constraints in the constraint policy. If it meets the restrictions on the label stack in the general policy, it is determined as a backup path; if it does not meet the restrictions on the label stack in the general policy, the next constraint policy is used to determine the next label stack, that is, all steps S21-S31 above are repeated, or other backup policies in the general policy are used to determine the backup path.

[0077] like Figure 2 As shown in Figure 1, node A is used as the reference node to calculate the backup path of node A. When a failure occurs in a path connected to node A in the sliced ​​packet network, a backup path needs to be determined. Figure 3a-3d As shown in the figure, tilfa backup path 1, tilfa backup path 2, tilfa backup path 3 and tilfa backup path 4 are different backup paths calculated by different constraint policies, and all of them can be used as backup paths for node A. When the user wants to use tilfa backup path 3 as a backup path for node A, a constraint condition is added to the constraint policy, and the added constraint condition is: including Link 1; when the constraint policy is used to generate a backup path, a label stack is automatically calculated by the above method; the label stack is installed and used as a backup path, and the backup path at this time is tilfa backup path 3 passing Link 1. After a backup path is determined, there is no need to use the remaining constraint policies to determine another backup path. When a fault point occurs during the use of node A, tilfa backup path 3 can be directly used as a backup path.

[0078] Figure 4 A partial flow chart of a slice packet network path planning method provided in an embodiment of the present disclosure, such as Figure 4 As shown, in order to more clearly illustrate the slice grouping network path planning method provided in the embodiment of the present disclosure, further specific description is given below in combination with specific embodiments.

[0079] S101: The TI-LFA policy module receives a general policy and three constraint policies, wherein the general policy includes the limitation of the label stack and other backup policies, and the three constraint policies are used to generate backup paths. It is understandable that there may be only one constraint policy or more constraint policies.

[0080] S102: Take out the first constraint strategy from the three constraint strategies. Different constraint conditions are defined in the three constraint strategies, that is, different backup path generation schemes. For example, the first constraint strategy includes node 1 and path 1; the second constraint strategy 2 includes node 2 and path 2; the third constraint strategy 3 includes node 3 and path 3. The backup paths generated by the three constraint strategies are also different. If constraint strategy 1 successfully determines the backup path, the backup path is installed, for example, the backup path is selected through the common convergence cross-connection port. If constraint strategy 1 fails, constraint strategy 2 is tried. If constraint strategy 2 successfully determines the backup path, the backup path is installed, for example, the backup path is selected through the core convergence cross-connection port. If constraint strategy 2 fails, constraint strategy 3 is tried. Constraint strategy 3 includes node 3 and path 3. Node 3 is selected as the node Node-A where the constraint strategy is located. If constraint strategy 3 successfully determines the backup path, the backup path is installed, for example, the backup path is selected by specifying the same-level ring. If constraint strategy 3 fails, other backup strategies in the general strategy are tried. It can be understood that path 1, path 2, path 3, node 1, node 2 and node 3 are only used to illustrate that different constraint strategies correspond to different constraint conditions, and do not refer to a specific path or node. The above is only an example and is not specifically limited.

[0081] S103: Add the constraint conditions in the first constraint strategy to the linked list; perform validity verification on the constraint conditions in the linked list in the link database. Of course, in addition to validity verification, other verifications such as loop verification are also included.

[0082] S104: Determine the label stack according to each constraint in the constraint strategy, determine the starting point Node-R of the TI-LFA path calculation, take out a constraint from the linked list, and determine the node Node-A where the constraint is located. Calculate the shortest path Path-A from Node-R to Node-A before convergence, and the shortest path Path-B after convergence; compare Path-A and Path-B to determine whether Path-A and Path-B are the same; if Path-A and Path-B are not the same, add the difference point label between Path-A and Path-B to the label stack. If Path-A and Path-B are the same, determine whether there is the next constraint in the linked list. Repeat the above process until all constraints are traversed, and confirm the label stack according to all constraints in a constraint strategy. It should be noted that after a constraint is used up, it will be deleted from the linked list to determine whether the traversal is completed.

[0083] In the embodiment of the present disclosure, taking the constraint strategy with three constraint conditions as an example, the three constraint conditions need to be divided into four sections when determining the backup path, and the four label stacks are calculated and merged into one label stack. For example, the starting point of the T I-LFA path calculation is S, and the destination node of the path is D. The three constraint conditions define three nodes, namely C1, C2 and C3. When the three constraint conditions are used to determine the backup path, the S-C1 label stack, C1-C2 label stack, C2-C3 label stack and C3-D label stack need to be calculated respectively, and the four label stacks are merged into one label stack for use as the backup path. It can be understood that the above method is only an example of determining a label stack to be used as a backup path, and is not specifically limited.

[0084] S105: Verify whether the number of labels in the label stack exceeds the maximum number of label stacks set in the general policy. If the number of labels in the label stack does not exceed the maximum number of label stacks set in the general policy, the label stack is used as a backup path. If the number of labels in the label stack exceeds the maximum number of label stacks set in the general policy, add the constraint conditions in the next constraint policy to the linked list, and verify the validity of the constraint conditions of the next constraint policy in the linked list in the link database. After verification, repeat steps 104 and 105.

[0085] S106: If the first constraint strategy, the second constraint strategy and the third constraint strategy all fail to determine the backup path, then other backup strategies in the general strategy are selected to determine the backup path, and the other backup paths include the mandatory strategy and the BE (Best Effort) strategy in the prior art, and a BE backup path is determined; wherein, the mandatory strategy means that when all constraint strategies cannot determine the backup path, the calculation of the backup path is stopped, and the original TI-LFA backup path can be directly used as the backup path, and a warning is reported to the external server, network management device or configuration module.

[0086] On the second aspect, based on the same inventive concept, Figure 5 A structural diagram of a slice packet network path planning system provided in an embodiment of the present disclosure, such as Figure 5 As shown, the embodiment of the present disclosure also provides a slice packet network path planning system corresponding to the above method, and the slice packet network path planning system includes: a TI-LFA policy module, a TI-LFA path calculation and a link database.

[0087] The TI-LFA policy module is used to receive the general policy and constraint policy for generating a backup path, and add the constraint conditions in the constraint policy to the linked list; it is also used to interact with the TI-LFA path calculation to verify whether the label stack complies with the general policy, and determine the backup path based on the verification result. The link database is used to verify the validity of the constraint conditions in the linked list in the link database. The TI-LFA path calculation is used to interact with the TI-LFA policy module and determine the label stack based on the verified constraint conditions.

[0088] Continue to refer Figure 5 The slice packet network path planning system also includes a TI-LFA configuration module. The TI-LFA configuration module controls the working state of the TI-LFA policy module according to the enable signal, and sends constraint policies and related configuration information to the TI-LFA policy module, including: excluding some paths or nodes, including some paths and nodes or general information such as the number of the maximum label stack. In addition, the TI-LFA configuration module can also be used to configure the TI-LFA path calculation. The TI-LFA path calculation receives message data. For example, when the IGP protocol receives a protocol message indicating a change in a node or link, it updates the link database and triggers the TI LFA path calculation.

[0089] On the third aspect, based on the same inventive concept, the embodiment of the present disclosure also provides a computer-readable storage medium, storing one or more programs, which, when executed, can implement the aforementioned slice packet network path planning method.

[0090] In a fourth aspect, based on the same inventive concept, an embodiment of the present disclosure further provides an electronic device, including a processor, a communication interface, a memory, and a communication bus. The processor, the communication interface, and the memory communicate with each other via the communication bus. The processor is used to execute the program stored in the aforementioned computer-readable storage medium.

[0091] It should be noted that the electrical connection between the above-mentioned units does not necessarily mean the connection between lines. An indirect connection method can be applied to the embodiments of the present disclosure as long as the purpose of the present disclosure is achieved.

[0092] Although the present disclosure has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present disclosure.

Claims

1. A slice packet network path planning method, characterized in that: The method comprises: receiving a general strategy and a constraint strategy for generating a backup path, and adding the constraint conditions in the constraint strategy to a linked list; Verifying the validity of the constraint conditions in the linked list in a link database; determining a label stack according to the verified constraint conditions; Verify whether the label stack complies with the general policy, and determine the backup path according to the verification result.

2. The method according to claim 1, characterized in that The receiving of the general strategy and the constraint strategy for generating the backup path, and adding the constraint conditions in the constraint strategy to the linked list, includes: The general strategy and a plurality of constraint strategies for generating the backup path are received, and the constraint condition in one of the constraint strategies is added to the linked list.

3. The method according to claim 1, characterized in that The slice packet network path planning method also includes: calculating and outputting a native TI-LFA backup path.

4. The method according to claim 1, characterized in that: The general strategy includes: setting a maximum number of label stacks to constrain the maximum number of labels in the label stack.

5. The method according to claim 1, characterized in that The constraint conditions in the linked list are verified to be effective in the link database; The label stack is determined based on the verified constraints, including: Verify the validity of all the constraints in the linked list in the link database; The label stack is determined according to all the constraint conditions that pass verification.

6. The method according to claim 5, characterized in that The step of determining the label stack according to all the verified constraints includes: Determine the starting point of the TI-LFA path calculation, take out the constraint condition from the linked list, and determine the node where the constraint condition is located; Calculate the shortest path before convergence and the shortest path after convergence from the starting point of the TI-LFA path calculation to the node where the constraint condition is located, and compare them, and determine the difference point label according to the comparison result; When the comparison result is different, adding the difference point label and the node label where the constraint condition is located to the label stack; All the constraints in the linked list are traversed, and all the difference point labels and all the node labels where the constraints are located are added to the label stack.

7. The method according to any one of claims 1 to 6, characterized in that: The verifying whether the label stack complies with the general policy and determining the backup path according to the verification result includes: Verify whether the number of labels in the label stack exceeds the maximum number of the label stack set in the general policy.

8. A slice packet network path planning system, characterized in that: The system includes: a TI-LFA strategy module, a TI-LFA path calculation and a link database; The TI-LFA policy module is used to receive a general policy and a constraint policy for generating a backup path, and add the constraint conditions in the constraint policy to a linked list; and is also used to interact with the TI-LFA path calculation to verify whether the label stack complies with the general policy, and determine the backup path according to the verification result; The link database is used to verify the validity of the constraint conditions in the linked list in the link database; The TI-LFA path calculation is used to interact with the TI-LFA policy module and determine the label stack according to the verified constraint condition.

9. A computer-readable storage medium storing one or more programs, characterized in that: When one or more programs are executed, the slice packet network path planning method described in any one of claims 1-7 can be implemented.

10. An electronic device comprising a processor, a communication interface, the computer-readable storage medium of claim 9, and a communication bus; wherein: The processor, the communication interface, and the computer-readable storage medium communicate with each other via a communication bus; It is characterized in that The processor is configured to execute a program stored in a computer-readable storage medium.

Images