Method for determining validity of candidate path, and electronic device and storage medium

Abstract

Provided in the present application are a method for determining the validity of a candidate path, and an electronic device and a storage medium. The method comprises: acquiring validity control parameters of a candidate path of a segment routing policy; and determining the validity of the candidate path according to the validity control parameters, wherein if the candidate path satisfies the validity control parameters, the candidate path is valid.

Description

Method for determining the validity of candidate paths, electronic device, and storage medium 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) utilizes a source routing mechanism, encapsulating an ordered list of instructions at the head node to guide packet forwarding. The Segment Routing Policy (SR Policy) manages this ordered list of instructions, known as the Segment List (SL). The SR Policy framework is standardized and includes the following: each SR Policy can have one or more candidate paths (CPs); each CP can contain one or more SLs. A CP is considered valid if at least one SL is valid; each SL has a weight, and traffic carried by the CP is shared among all SLs along the path.

[0003] In some scenarios, the CP validity determination method doesn't meet requirements. For example, if a CP carries 200MB of traffic, shared by two 100MB SLs, and one of the SLs fails, the remaining SL cannot carry 200MB of traffic, effectively rendering the CP invalid. Therefore, the reliability of determining CP validity is low.

[0004] Summary of the Invention

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

[0006] This embodiment of the present application provides a method for determining the validity of a candidate path, including:

[0007] Obtaining validity control parameters of candidate paths of a segment routing policy;

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

[0009] An embodiment of the present application further provides a communication node, comprising: 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 candidate paths when executing the program.

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

[0011] FIG1 is a flowchart of a method for determining the validity of a candidate path provided by an embodiment;

[0012] FIG2 is a schematic diagram of a sub-domain format setting method provided by an embodiment;

[0013] FIG3 is a schematic diagram of determining the validity of a candidate path based on a validity control parameter according to an embodiment;

[0014] FIG4 is a schematic structural diagram of a device for determining the validity of a candidate path provided by an embodiment;

[0015] FIG5 is a schematic diagram of the hardware structure of a communication node provided by an embodiment. DETAILED DESCRIPTION

[0016] The present application is described below in conjunction with the accompanying drawings and embodiments. It will be understood that the specific embodiments described herein are merely intended to explain the present application and are not intended to limit the present application. It should be noted that, unless there is a conflict, the embodiments and features within the embodiments of the present application may be combined with each other in any manner. It should also be noted that, for ease of description, the accompanying drawings only illustrate portions relevant to the present application, not all structures.

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

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

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

[0020] 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.

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

[0022] 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.

[0023] 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 a candidate path is greater than or equal to the value of this field, the candidate path is determined to be valid. A value of 0xff in this field indicates that the candidate path is determined to be valid when all SLs are valid.

[0024] 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.

[0025] 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.

[0026] 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.

[0027] In this embodiment, a third parameter can be added to the candidate path to control the validity determination of the candidate path. The field of the third parameter can be recorded as valid_SL_weight_percent, which can 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 the 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 the 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, the value of this field is 0, which means that there is no requirement for the weight percentage, and the value of this field is 100, which means that the candidate path is determined to be valid when all SLs are valid.

[0028] 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.

[0029] 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.

[0030] In one embodiment, the validity control parameters of the candidate path can be announced through protocol extensions such as 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, and NETCONF YANG, but are not limited to these protocols.

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

[0032] In this embodiment, the BGPSR Policy supports the notification of the validity control parameters of the candidate paths. A setting sub-field (denoted as cp_valid_control_parameter Sub-TLV) may be added to the SR Policy and Tunnel Encapsulation Attribute to carry the validity control parameters of the candidate paths.

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

[0034] In this embodiment, BGP-LS 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.

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

[0036] 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) can be added therein to carry the validity control parameters of the candidate paths.

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

[0038] Figure 3 is a schematic diagram of determining the validity of a candidate path based on validity control parameters provided by an embodiment. As shown in Figure 3, an SR Policy is created on R1 to reach R6, and the service traffic assumed by the SR policy is 1.5GB; the SR Policy contains two candidate paths, the candidate path CP1 has a priority of 200, and contains SL1<R2,R6> and SL2<R3,R6> ; Candidate path CP2 has a priority of 100 and includes SL3<R4,R6> and SL4<R5,R6> SR Policy prioritizes CP1 as the active candidate path (Active Candidate Path) to carry service traffic. If CP1 fails, CP2 can be used as the active candidate path to carry service traffic. The p_valid_control_parameter for CP1 and CP2 is set to valid_SL_num = 2. When the R2 node fails, the SL fails, and CP1 has only one valid SL, which is less than the number of 2 set in valid_SL_num. Therefore, R1 declares CP1 invalid and switches service traffic to CP2, thus preventing service loss.

[0039] The present application also provides a device for determining the validity of a candidate path. FIG4 is a schematic diagram of the structure of a device for determining the validity of a candidate path provided by an embodiment. As shown in FIG4 , the device for determining the validity of a candidate path includes:

[0040] A parameter acquisition module 210 is configured to acquire validity control parameters of candidate paths of a segment routing policy;

[0041] 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 meets the validity control parameter, the candidate path is valid.

[0042] 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.

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

[0044] 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.

[0045] In one embodiment, the validity control parameter includes a second parameter;

[0046] 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.

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

[0048] 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.

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

[0050] 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.

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

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

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

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

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

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

[0057] 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.

[0058] An embodiment of the present application also provides a communication node. Figure 5 is a schematic diagram of the hardware structure of a communication node provided by an embodiment. As shown in Figure 5, the communication node provided by the present application includes a processor 510 and a memory 520; the processor 510 in the communication node can be one or more, and Figure 5 takes one processor 510 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.

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

[0060] 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. FIG5 takes the bus connection as an example.

[0061] 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.

[0062] 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.

[0063] The memory 520, as a computer-readable storage medium, can 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 (for example, 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; and the data storage area may store data created according to the use of the communication node. 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.

[0064] The present application also provides a storage medium storing a computer program, which, when executed by a processor, implements the method for determining the validity of a candidate path described in any one of the embodiments of the present application. The method includes:

[0065] Acquire a validity control parameter of a candidate path of a segment routing strategy; 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.

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

[0067] A computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such a propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transport a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0068] 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 foregoing.

[0069] The computer program code for performing the operations 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 conventional procedural programming languages ​​such as "C" 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 a remote computer, or entirely on a 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 via the Internet).

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

[0071] It will be appreciated by those skilled in the art that the term user terminal encompasses 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.

[0072] In general, various embodiments of the present application may be implemented in hardware or dedicated circuits, software, logic, or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may 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.

[0073] 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.

[0074] The block diagram of any logical flow in the drawings of this application may represent program steps, or may represent interconnected logical circuits, modules and functions, or may represent a combination of program steps and logical circuits, modules and functions. A computer program may be stored on 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 storage 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 a general-purpose computer, a special-purpose computer, a microprocessor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), and a processor based on a multi-core processor architecture.

Claims

1. A method for determining the validity of a candidate path, 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 the candidate path is valid if the candidate path satisfies the validity control parameter.

2. The method according to claim 1, in, The validity control parameters include a first parameter; When 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, in, The validity control parameters include a second parameter; In the case where 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, in, The validity control parameters include a third parameter; In the case where 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, in, The effectiveness control parameters include a first parameter, a second parameter and a third parameter; The candidate path is valid 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.

6. The method according to claim 1, in, Get the validity control parameters of the segment routing policy, including: The validity control parameter is obtained based on the segment routing 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, in, 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, in, 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, include: at least one processor; A storage device for storing at least one program; When the at least one program is executed by the at least one processor, the at least one processor implements the method for determining the validity of a candidate path as described in any one of claims 1 to 8.

10. A computer-readable storage medium having a computer program stored thereon, in, 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