Candidate path validity determination method, electronic equipment and storage medium

Abstract

The invention provides a candidate path validity determination method, electronic equipment and a storage medium. The method comprises the following steps: acquiring validity control parameters of candidate paths of a segmented routing strategy; and determining the validity of a candidate path according to the validity control parameter, and if the candidate path satisfies the validity control parameter, determining that the candidate path is valid.

Description

Technical Field

[0001] The present application relates to a wireless communication network, for example, to a method for determining the validity of a candidate path, an electronic device, and a storage medium. Background Art

[0002] Segment-Routing (SR) uses the source routing mechanism to encapsulate an ordered instruction list at the head node to guide packet forwarding. The segment routing policy (SR Policy) is the management entity of this ordered instruction list, which is called the segment list (SL). The SR Policy framework is standardized and includes: each SRPolicy can have one or more candidate paths (CP); each CP can contain one or more SLs. As long as one SL under the CP is valid, the entire CP is considered valid; each SL has a weight, and the services carried by the CP are shared among all SLs under the path according to the weight.

[0003] In some scenarios, the CP validity determination method cannot meet the needs. For example, if a CP carries 200MB of traffic, which is shared by two 100MB SLs, if one of the SLs fails, the remaining SL cannot carry 200MB of traffic, and the CP is essentially invalid. Therefore, the reliability of determining the validity of the CP is low. Summary of the invention

[0004] The present application provides a method for determining the validity of a candidate path, an electronic device, and a storage medium.

[0005] The present application provides a method for determining the validity of a candidate path, including:

[0006] Obtaining validity control parameters of candidate paths of a segment routing strategy;

[0007] The validity of the candidate path is determined according to the validity control parameter, wherein if the candidate path satisfies the validity control parameter, the candidate path is valid.

[0008] An embodiment of the present application also provides a communication node, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned method for determining the validity of a candidate path when executing the program.

[0009] An embodiment of the present application also provides a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, the above-mentioned method for determining the validity of a candidate path is implemented. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] Figure 1 A flowchart of a method for determining the validity of a candidate path provided by an embodiment;

[0011] Figure 2 A schematic diagram of setting a sub-domain format provided by an embodiment;

[0012] Figure 3 A schematic diagram of determining the validity of a candidate path based on a validity control parameter provided by an embodiment;

[0013] Figure 4 A schematic diagram of the structure of a device for determining the validity of a candidate path provided by an embodiment;

[0014] Figure 5 A schematic diagram of the hardware structure of a communication node provided by an embodiment. DETAILED DESCRIPTION

[0015] The present application is described below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the present application, rather than to limit the present application. It should be noted that, in the absence of conflict, the embodiments in the present application and the features in the embodiments can be combined with each other arbitrarily. It should also be noted that, for ease of description, only the parts related to the present application rather than all structures are shown in the accompanying drawings.

[0016] In the existing methods, as long as there is a valid SL under a candidate path, the entire candidate path is considered valid, but the valid SL in the candidate path may not meet the business needs, such as being insufficient to carry traffic and unable to achieve shared sharing. The method for determining the validity of a candidate path provided in the present application can more reliably determine the validity of a candidate path and ensure that there are enough SLs in the candidate path to achieve shared sharing.

[0017] Figure 1 A flowchart of a method for determining the validity of a candidate path provided by an embodiment is shown in FIG. Figure 1 As shown, the method provided in this embodiment includes step 110 and step 120.

[0018] In step 110, validity control parameters of candidate paths of the segment routing strategy are obtained.

[0019] In step 120, the validity of the candidate path is determined according to the validity control parameter, wherein if the candidate path satisfies the validity control parameter, the candidate path is valid.

[0020] In this embodiment, the validity control parameter is used to determine whether the candidate path is valid, and may be a parameter that limits the number of valid SLs and the corresponding weights in the candidate path, so as to ensure that there are enough SLs in the candidate path or the valid SLs have sufficiently large weights, thereby achieving effective load sharing and meeting business requirements. For example, the validity control parameter may include the minimum number of valid SLs in the candidate path, the minimum weight of the valid SLs, the minimum sum of the weights of the valid SLs, the proportion of the valid SLs in all SLs, the sum of the weights of the valid SLs in the sum of the weights of all SLs, etc. In addition, there may be multiple validity control parameters to further ensure the reliability of the validity determination.

[0021] In one embodiment, the validity control parameter includes a first parameter; if the number of valid segment lists in the candidate path is greater than or equal to the first parameter, the candidate path is valid.

[0022] In this embodiment, a first parameter may be added to the candidate path to control the validity determination of the candidate path. The field of the first parameter may be recorded as valid_SL_num, which may be an 8-bit integer with a value range of 1-0xff, indicating the minimum number of valid SLs under a valid candidate path. If the number of valid SLs under the candidate path is greater than or equal to the value of this field, the candidate path is determined to be valid. Among them, the value of this field is 0xff, which means that the candidate path is determined to be valid when all SLs are valid.

[0023] In one embodiment, the validity control parameter includes a second parameter; if the sum of the weights of the valid segment lists in the candidate path is greater than or equal to the second parameter, the candidate path is valid.

[0024] In this embodiment, a second parameter can be added to the candidate path to control the validity determination of the candidate path. The field of the second parameter can be recorded as valid_SL_weight, which can be a 32-bit integer with a value range of 0-0xffffffff, indicating the minimum value of the sum of the weights of the valid SLs under the valid candidate path. If the sum of the weights of the valid SLs under the candidate path is greater than or equal to this field, the candidate path is determined to be valid. Among them, the value of this field is 0, which means that there is no requirement for the weight, and the value of this field is 0xffffffff, which means that the candidate path is determined to be valid when all SLs are valid.

[0025] In one embodiment, the validity control parameter includes a third parameter; if the sum of the weights of the valid segment lists in the candidate path is greater than or equal to the third parameter, the candidate path is valid.

[0026] In this embodiment, a third parameter may be added to the candidate path to control the validity determination of the candidate path. The field of the third parameter may be recorded as valid_SL_weight_percent, which may be a one-bit integer with a value range of 0-100, indicating the minimum value of the percentage of the sum of the weights of valid SLs under the valid candidate path to the sum of the weights of all SLs under the candidate path. If the percentage of the sum of the weights of valid SLs under the candidate path to the sum of the weights of all SLs is greater than or equal to this field, the candidate path is determined to be valid. Among them, a value of 0 for this field indicates that there is no requirement for the weight percentage, and a value of 100 for this field indicates that the candidate path is determined to be valid when all SLs are valid.

[0027] In one embodiment, the validity control parameters include a first parameter, a second parameter and a third parameter; if the number of valid segment lists in the candidate path is greater than or equal to the first parameter, the sum of the weights of the valid segment lists is greater than or equal to the second parameter, and the sum of the weights of the valid segment lists in the valid candidate path is greater than or equal to the third parameter, then the candidate path is valid.

[0028] In this embodiment, three validity control parameters may be added to the candidate path: a first parameter, a second parameter and a third parameter. If a valid SL in the candidate path satisfies the above three validity control parameters, it is determined to be valid.

[0029] In one embodiment, the validity control parameters of the candidate path can be announced through the Border Gateway Protocol (BGP), the SR policy and tunnel encapsulation attributes (BGP Link-state, BGP-LS) in the BGP segment routing policy (SR Policy), the Path Computation Element Protocol (PCEP) SR Policy, NETCONF YANG and other protocol extensions, but are not limited to these protocols.

[0030] In one embodiment, obtaining the validity control parameter of the segment routing policy includes: obtaining the validity control parameter based on a setting subfield (Type-Length-Value) in an SR policy and tunnel encapsulation attribute (SR Policy and Tunnel Encapsulation Attribute) in the BGP segment routing policy.

[0031] In this embodiment, BGP SR Policy supports notifying the validity control parameters of the candidate paths, and a setting sub-domain (denoted as cp_valid_control_parameter Sub-TLV) may be added to the SRPolicy and Tunnel Encapsulation Attribute to carry the validity control parameters of the candidate paths.

[0032] In one embodiment, obtaining the validity control parameter of the segment routing policy includes: obtaining the validity control parameter based on a set subdomain in the BGP segment routing policy of the link state.

[0033] In this embodiment, BGP-LS SR Policy supports the notification of the validity control parameters of the candidate paths, and a setting subdomain (denoted as cp_valid_control_parameter TLV) may be added therein to carry the validity control parameters of the candidate paths.

[0034] In one embodiment, obtaining the validity control parameter of the segment routing policy includes: obtaining the validity control parameter based on a setting subdomain in the PCEP segment routing policy.

[0035] In this embodiment, the PCEP SR Policy supports the notification of the validity control parameters of the candidate paths, and a setting subfield (denoted as cp_valid_control_parameter TLV) may be added therein to carry the validity control parameters of the candidate paths.

[0036] Figure 2 FIG. 1 is a schematic diagram of setting a sub-domain format provided by an embodiment. Figure 2 As shown, in the setting subfield, Value may include a first parameter (valid SL num), a second parameter (valid SL weight), and a third parameter (validSL weight percent).

[0037] Figure 3 FIG. 1 is a schematic diagram of determining the validity of a candidate path based on a validity control parameter provided by an embodiment. Figure 3As shown in the figure, an SR Policy is created on R1 to reach R6. The service traffic carried by the SR policy is 1.5 GB. The SRPolicy contains two candidate paths. The candidate path CP1 has a priority of 200 and contains SL1<R2,R6> and SL2<R3,R6> ; The priority of candidate path CP2 is 100, including SL3<R4,R6> and SL4<R5,R6> . SR Policy preferentially selects CP1 as the active candidate path (Active Candidate Path) to bear service traffic. After CP1 fails, CP2 can be used as the Active Candidate Path to bear service traffic. The p_valid_control_parameter of CP1 and CP2 is set to valid_SL_num=2. When the R2 node fails, the SL fails, and the number of valid SLists of CP1 is only 1, which is less than the number 2 set by valid_SL_num. Therefore, the R1 node sets CP1 to fail and switches the service traffic to CP2 to avoid service damage.

[0038] The embodiment of the present application also provides a device for determining the validity of a candidate path. Figure 4 FIG. 1 is a schematic diagram of a device for determining the validity of a candidate path provided by an embodiment. Figure 4 As shown, the device for determining the validity of the candidate path includes:

[0039] A parameter acquisition module 210, configured to acquire validity control parameters of candidate paths of a segment routing strategy;

[0040] The determination module 220 is configured to determine the validity of the candidate path according to the validity control parameter, wherein if the candidate path satisfies the validity control parameter, the candidate path is valid.

[0041] The device for determining the validity of a candidate path in this embodiment determines the validity of the candidate path based on the validity control parameter, thereby ensuring the reliability of the validity determination.

[0042] In one embodiment, the validity control parameter includes a first parameter;

[0043] If the number of valid segment lists in the candidate path is greater than or equal to the first parameter, the candidate path is valid.

[0044] In one embodiment, the effectiveness control parameter includes a second parameter;

[0045] If the sum of the weights of the valid segment lists in the candidate path is greater than or equal to the second parameter, the candidate path is valid.

[0046] In one embodiment, the validity control parameter includes a third parameter;

[0047] If the sum of the weights of the valid segment lists in the candidate path is greater than or equal to the third parameter, the candidate path is valid.

[0048] In one embodiment, the effectiveness control parameters include a first parameter, a second parameter and a third parameter;

[0049] If the number of valid segment lists in the candidate path is greater than or equal to the first parameter, the sum of the weights of the valid segment lists is greater than or equal to the second parameter, and the sum of the weights of the valid segment lists in the valid candidate path is greater than or equal to the third parameter, then the candidate path is valid.

[0050] In one embodiment, the parameter acquisition module 210 is configured as follows:

[0051] The validity control parameter is obtained based on the SR policy in the BGP segment routing policy and the setting subdomain in the tunnel encapsulation attribute.

[0052] In one embodiment, the parameter acquisition module 210 is configured as follows:

[0053] The validity control parameter is obtained based on a setting subdomain in a link-state BGP segment routing policy.

[0054] In one embodiment, the parameter acquisition module 210 is configured as follows:

[0055] The validity control parameter is obtained based on a set subdomain in a PCEP segment routing policy.

[0056] The device for determining the validity of a candidate path proposed in this embodiment and the method for determining the validity of a candidate path proposed in the above embodiment belong to the same inventive concept. Technical details not fully described in this embodiment can be referred to any of the above embodiments, and this embodiment has the same beneficial effects as executing the method for determining the validity of a candidate path.

[0057] The embodiment of the present application also provides a communication node, Figure 5 A schematic diagram of the hardware structure of a communication node provided by an embodiment is shown in FIG. Figure 5 As shown, the communication node provided in the present application includes a processor 510 and a memory 520; the processor 510 in the communication node may be one or more, Figure 5 A processor 510 is taken as an example; the memory 520 is configured to store one or more programs; the one or more programs are executed by the one or more processors 510, so that the one or more processors 510 implement the method for determining the validity of the candidate path as described in the embodiment of the present application.

[0058] The communication node further includes: a communication device 530 , an input device 540 and an output device 550 .

[0059] The processor 510, memory 520, communication device 530, input device 540 and output device 550 in the communication node may be connected via a bus or other means. Figure 5 The example of connecting through bus is taken in the following.

[0060] The input device 540 may be used to receive input digital or character information and generate key signal input related to user settings and function control of the communication node. The output device 550 may include a display device such as a display screen.

[0061] The communication device 530 may include a receiver and a transmitter. The communication device 530 is configured to perform information transmission and reception communication according to the control of the processor 510.

[0062] The memory 520, as a computer-readable storage medium, may be configured to store software programs, computer executable programs, and modules, such as program instructions / modules corresponding to the method for determining the validity of the candidate path described in the embodiment of the present application (e.g., the parameter acquisition module 210 and the determination module 220 in the device for determining the validity of the candidate path). The memory 520 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created according to the use of the communication node, etc. In addition, the memory 520 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some instances, the memory 520 may further include a memory remotely arranged relative to the processor 510, and these remote memories may be connected to the communication node via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0063] The embodiment of the present application also provides a storage medium, the storage medium stores a computer program, and when the computer program is executed by a processor, the method for determining the validity of a candidate path described in any one of the embodiments of the present application is implemented. The method includes: obtaining a validity control parameter of a candidate path of a segment routing strategy; determining the validity of the candidate path according to the validity control parameter, wherein if the candidate path satisfies the validity control parameter, the candidate path is valid.

[0064] The computer storage medium of the embodiment of the present application can adopt any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium can be, for example, but not limited to: an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples (non-exhaustive list) of computer-readable storage media include: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (Random Access Memory, RAM), a read-only memory (Read Only Memory, ROM), an erasable programmable read-only memory (ErasableProgrammable Read Only Memory, EPROM), a flash memory, an optical fiber, a portable CD-ROM, an optical storage device, a magnetic storage device, or any suitable combination of the above. The computer-readable storage medium can be any tangible medium containing or storing a program, which can be used by an instruction execution system, a device or a device or used in combination with it.

[0065] Computer-readable signal media may include data signals propagated in baseband or as part of a carrier wave, which carry computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to: electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0066] The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, radio frequency (RF), etc., or any suitable combination of the above.

[0067] The computer program code for performing the operation of the present application can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages, such as Java, Smalltalk, C++, and also conventional procedural programming languages, such as "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as an independent software package, partially on the user's computer and partially on the remote computer, or completely on the remote computer or server. In the case of a remote computer, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (e.g., using an Internet service provider to connect through the Internet).

[0068] The above description is merely an exemplary embodiment of the present application and is not intended to limit the protection scope of the present application.

[0069] It will be appreciated by those skilled in the art that the term user terminal covers any suitable type of wireless user equipment, such as a mobile phone, a portable data processing device, a portable web browser or a vehicle-mounted mobile station.

[0070] In general, various embodiments of the present application can be implemented in hardware or dedicated circuits, software, logic or any combination thereof. For example, some aspects can be implemented in hardware, while other aspects can be implemented in firmware or software that can be executed by a controller, microprocessor or other computing device, although the present application is not limited thereto.

[0071] Embodiments of the present application may be implemented by executing computer program instructions by a data processor of a mobile device, for example in a processor entity, or by hardware, or by a combination of software and hardware. The computer program instructions may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages.

[0072] The block diagram of any logic flow in the drawings of the present application may represent program steps, or may represent interconnected logic circuits, modules and functions, or may represent a combination of program steps and logic circuits, modules and functions. A computer program may be stored in a memory. The memory may be of any type suitable for the local technical environment and may be implemented using any suitable data storage technology, such as but not limited to read-only memory (ROM), random access memory (RAM), optical memory devices and systems (digital versatile discs (DVD) or compact disks (CD), etc. Computer-readable media may include non-transitory storage media. The data processor may be of any type suitable for the local technical environment, such as but not limited to general-purpose computers, special-purpose computers, microprocessors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FGPAs) and processors based on multi-core processor architectures.

[0073] By way of exemplary and non-limiting examples, a detailed description of exemplary embodiments of the present application has been provided above. However, various modifications and adjustments to the above embodiments will be apparent to those skilled in the art when considered in conjunction with the accompanying drawings and claims, but will not depart from the scope of the present application. Therefore, the proper scope of the present application will be determined according to the claims.

Claims

1. A method for determining the validity of a candidate path, It is characterized in that include: Obtaining validity control parameters of candidate paths of a segment routing strategy; The validity of the candidate path is determined according to the validity control parameter, wherein if the candidate path satisfies the validity control parameter, the candidate path is valid.

2. The method according to claim 1, It is characterized in that The validity control parameters include a first parameter; If the number of valid segment lists in the candidate path is greater than or equal to the first parameter, the candidate path is valid.

3. The method according to claim 1, It is characterized in that The validity control parameters include a second parameter; If the sum of the weights of the valid segment lists in the candidate path is greater than or equal to the second parameter, the candidate path is valid.

4. The method according to claim 1, It is characterized in that The validity control parameters include a third parameter; If the sum of the weights of the valid segment lists in the candidate path is greater than or equal to the third parameter, the candidate path is valid.

5. The method according to claim 1, It is characterized in that The effectiveness control parameters include a first parameter, a second parameter and a third parameter; If the number of valid segment lists in the candidate path is greater than or equal to the first parameter, the sum of the weights of the valid segment lists is greater than or equal to the second parameter, and the sum of the weights of the valid segment lists in the valid candidate path is greater than or equal to the third parameter, then the candidate path is valid.

6. The method according to claim 1, It is characterized in that Get the validity control parameters of the segment routing policy, including: The validity control parameter is obtained based on the SR policy in the Border Gateway Protocol BGP segment routing policy and the setting subdomain in the tunnel encapsulation attribute.

7. The method according to claim 1, It is characterized in that Get the validity control parameters of the segment routing policy, including: The validity control parameter is obtained based on a setting subdomain in a link-state BGP segment routing policy.

8. The method according to claim 1, It is characterized in that Get the validity control parameters of the segment routing policy, including: The validity control parameter is obtained based on a set subdomain in a Path Computation Element Communication Protocol (PCEP) segment routing policy.

9. An electronic device, It is characterized in that include: one or more processors; A storage device for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the method for determining the validity of a candidate path as described in any one of claims 1-8.

10. A computer-readable storage medium having a computer program stored thereon, It is characterized in that When the program is executed by a processor, the method for determining the validity of a candidate path as described in any one of claims 1 to 8 is implemented.

Images