Topology-based invalid traffic scheduling suppression method, network device and storage medium

Abstract

The present application provides a method, network device and storage medium for suppressing invalid traffic scheduling based on topology, wherein the method is applied to management equipment, including: judging whether the service preferred forwarding path S1 is oscillating based on the time difference t between the current triggering preferred scheduling time CCT and the last preferred scheduling completion time ACT; if the time difference t is less than or equal to the path oscillation duration CRT, it is determined that the service preferred forwarding path S1 is oscillating, then suppressing the preferred scheduling, and continuing to forward with the service forwarding path S2. In the continuous optimization process, the embodiment of the present application can trigger scheduling in time when it is perceived that the path delay, jitter, packet loss rate, etc. do not meet the quality policy requirements, and automatically identify whether the quality of the service preferred path is oscillating, thereby suppressing invalid preferred scheduling and ensuring stable service traffic forwarding.

Description

Technical Field

[0001] The present application relates to the technical field of communication equipment, and in particular to a method for suppressing invalid traffic scheduling based on topology, a network device and a storage medium. Background Art

[0002] After the controller establishes a BGP neighbor, the device reports the node, link, and route prefix information to the controller through BGP-LS, and the controller uses the above information to complete the construction of the network topology. After the topology is built, the user can start to deploy services on the controller, issue tunnels, complete path selection and issuance, etc., so as to realize traffic forwarding; when the user configures the preferred policy, when the controller selects the path, it will give priority to the preferred path composed of links that meet the preferred policy, provided that the quality policy requirements such as service delay, jitter, and packet loss rate are met. When the forwarding path quality deteriorates and cannot meet the service quality policy requirements, the controller will adjust the path to a non-preferred path that meets the quality policy requirements, and reselect the path after the quality of the preferred path is restored. In the above scenario, if the quality of the link through which the preferred path passes fluctuates, it will cause a large amount of invalid scheduling in a short period of time. This will lead to a decrease in the network forwarding capability and even cause the service to be unavailable.

[0003] As far as the inventors know, the current solution is to increase the length of the global optimization cycle, that is, when the controller senses that the quality of the link has deteriorated and cannot meet the service quality policy requirements, it will trigger the relevant service scheduling and adjust the path from the link with deteriorated quality. When the link quality is restored, if the time for global optimization has not arrived and it is impossible to detect that the current path does not meet the requirements of the optimization policy, the scheduling will not be triggered. At this time, if the quality of the above-mentioned link sometimes meets the service quality policy requirements and sometimes does not meet the service quality policy requirements in a short period of time, it can avoid the impact of invalid traffic scheduling on the service, which directly affects the service forwarding capability.

[0004] The global optimization here refers to the process of recalculating and deploying all tunnels that carry services according to their importance, from high to low, and in accordance with all policy requirements. Summary of the invention

[0005] In order to overcome the problems existing in the related art, the present application provides a topology-based invalid traffic scheduling suppression method, a network device and a storage medium.

[0006] According to a first aspect of an embodiment of the present application, a method for suppressing invalid traffic scheduling based on topology is provided, which is applied to a management device, including:

[0007] Based on the time difference t between the current triggering optimal scheduling time CCT and the last optimal scheduling completion time ACT, it is determined whether the service optimal forwarding path S1 is oscillating;

[0008] If the time difference t is less than or equal to the path oscillation duration CRT, it is determined that the service preferred forwarding path S1 oscillates, and the preferred scheduling is suppressed, and forwarding is continued through the service forwarding path S2.

[0009] Preferably, in continuous optimization detection, if it is detected that the time difference t reaches or exceeds the preferred scheduling suppression time SCT or the preferred scheduling completion time ACT=0, the preferred scheduling is restored and scheduled to the service preferred forwarding path S1, and the preferred suppression flag SCA is set to the unsuppressed state.

[0010] Preferably, when the service preferred forwarding path S1 satisfies both the service quality policy and the preferred policy requirements, it is an initial route selection, and the preferred scheduling completion time ACT is set to 0.

[0011] Preferably, when the service preferred forwarding path S1 cannot meet the service quality policy requirements;

[0012] The service forwarding path S2 is obtained by calculation based on the service quality policy;

[0013] The service forwarding path S2 is a non-preferred forwarding path, triggering the preferred scheduling based on the preferred strategy.

[0014] Preferably, judging whether the service preferred forwarding path S1 oscillates based on the time difference t between the current triggering preferred scheduling time CCT and the last preferred scheduling completion time ACT includes:

[0015] When the service forwarding path S2 meets the service quality policy requirements but does not meet the optimization policy requirements, continuous optimization detection is performed to trigger the optimization scheduling and set the triggering optimization scheduling time CCT;

[0016] If the optimal scheduling is not suppressed, and the last optimal scheduling completion time ACT = 0 or CCT-ACT>CRT, the optimal scheduling is executed, the service forwarding path is adjusted back to the service optimal forwarding path S1, and the current optimal scheduling completion time ACT' is recorded;

[0017] Scheduling to other service forwarding paths except the service preferred forwarding path S1;

[0018] When the other service forwarding paths can meet the service quality policy but cannot meet the requirements of the preferred policy, continuous optimization detection is performed to trigger the preferred scheduling. If CCT-ACT'≤CRT, it is determined that the quality of the service preferred forwarding path S1 fluctuates, and the preferred suppression flag SCA is set to the suppression state.

[0019] Preferably, during the continuous optimization detection process, it is detected whether the preferred scheduling is suppressed based on the state of the recorded preferred suppression flag SCA.

[0020] Preferably, when the preferred strategy for triggering scheduling changes, ACT is set to 0, and the preferred suppression flag SCA is set to an unsuppressed state.

[0021] Preferably, when the trigger scheduling is based on a policy other than the service quality policy and the preferred policy, ACT is set to 0, and the preferred suppression flag SCA is set to an unsuppressed state.

[0022] A second aspect of the present application provides a network device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, the program includes the above-mentioned topology-based invalid traffic scheduling suppression method.

[0023] The third aspect of the present application provides a storage medium on which computer program instructions are stored. When the program instructions are executed by a processor, they are used to implement the above-mentioned topology-based invalid traffic scheduling suppression method.

[0024] The technical solution provided by the embodiments of the present application may have the following beneficial effects:

[0025] During the continuous optimization process, the embodiment of the present application can trigger scheduling in a timely manner when it is perceived that the path delay, jitter, packet loss rate, etc. do not meet the quality policy requirements, and automatically identify whether the quality of the service preferred path fluctuates, thereby suppressing invalid preferred scheduling and ensuring stable service traffic forwarding.

[0026] It should be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] The accompanying drawings, which are incorporated in and constitute a part of this application, illustrate embodiments consistent with the application and, together with the application, serve to explain the principles of the application.

[0028] Figure 1 This is a schematic diagram of the process of Embodiment 1 of the present application;

[0029] Figure 2 This is a flow chart of the application for determining whether the service forwarding path is oscillating;

[0030] Figure 3 This is a schematic diagram of the second process of implementing this application;

[0031] Figure 4 This is the structural framework diagram of the network equipment of this application. DETAILED DESCRIPTION

[0032] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with the present application. Instead, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.

[0033] When the link quality in the topology is stable, the controller will give priority to the optimal service forwarding path S1 for deployment and forwarding service traffic. At this time, if the path delay, jitter, packet loss rate and other quality deterioration occur and fail to meet the quality policy requirements, the controller will usually automatically switch to the suboptimal path S2 for deployment and forwarding service traffic. However, the suboptimal path cannot meet the service quality policy requirements. The above-mentioned path quality deterioration problem is only short-term or instantaneous, so the optimal path S1 will soon return to normal, so it is necessary to switch the service forwarding path to the optimal path S1 again. When the path delay, jitter, packet loss rate and other quality deterioration problems occur again, the service forwarding path automatically switches to the suboptimal path S2, and so on. This leads to a large number of frequent scheduling in a short period of time. This leads to a decrease in the network forwarding capability and affects the stability of service forwarding.

[0034] To solve the problems in the background technology and the above description, the first embodiment of the present application provides a method for suppressing invalid traffic scheduling based on topology, which is applied to a management device, such as Figure 1 As shown, including:

[0035] 101: Calculate the time difference t between the current triggering optimal scheduling time CCT and the last optimal scheduling completion time ACT;

[0036] 102: Determine whether the service preferred forwarding path S1 is flapping;

[0037] As an example, the following steps are included: Figure 2 Said:

[0038] 1021: when the current service forwarding path S2 meets the service quality policy requirement but does not meet the optimization policy requirement, continuous optimization detection is performed, the optimization scheduling is triggered, and the triggering time CCT of the optimization scheduling is set;

[0039] 1022: If the optimal scheduling is not suppressed, and the last optimal scheduling completion time ACT=0 or CCT-ACT>CRT, the optimal scheduling is executed, the service forwarding path is adjusted back to the service optimal forwarding path S1, and the current optimal scheduling completion time ACT' is recorded;

[0040] 1023: dispatch to other service forwarding paths except S1;

[0041] It should be noted that the other service forwarding paths mentioned here are other service forwarding paths except the most preferred service forwarding path S1 among the achievable paths from A to B under the topology. Usually, there are multiple service forwarding paths from A to B under the topology, and these service forwarding paths can be divided into optimal, suboptimal, suboptimal, etc. according to priority. The other forwarding paths here can be suboptimal paths, suboptimal paths, or other paths.

[0042] 1024: When the other service forwarding paths can meet the service quality policy but cannot meet the requirements of the preferred policy, continue to optimize the detection and trigger the preferred scheduling. If CCT-ACT'≤CRT, it is determined that the quality of the service preferred forwarding path S1 fluctuates, and the preferred suppression flag SCA is set to the suppression state.

[0043] 103: If the time difference t is less than or equal to the path oscillation duration CRT, it is determined that the service preferred forwarding path S1 oscillates, and the preferred scheduling is suppressed, and forwarding is continued through the service forwarding path S2.

[0044] The service preferred forwarding path S1 here is usually the optimal path from A to B under the topology, and of course it can also be a path that is defaulted or pre-selected by the system. The service forwarding path S2 is also a forwarding path from A to B under the topology, but it is the optimal path other than the service preferred forwarding path S1. Of course, it can also be an alternative path that is defaulted or pre-selected by the system.

[0045] When the current forwarding path is in S2, the service will be switched back to S1 only when the service preferred forwarding path S1 meets the preferred scheduling conditions, thus avoiding frequent invalid scheduling.

[0046] Implementation 2 based on Implementation 1, such as Figure 3 As shown, step 104 is included: in the continuous optimization detection, if it is detected that the time difference t reaches or exceeds the preferred scheduling suppression time SCT or the preferred scheduling completion time ACT=0, the preferred scheduling is restored and scheduled to the service preferred forwarding path S1, and the preferred suppression flag SCA is set to the unsuppressed state. SCT can be set according to the dependence on the preferred path resources, such as the default of 30 minutes. The detected preferred scheduling completion time ACT is 0, which may be due to the change of the preferred policy that triggers the scheduling. At this time, the preferred suppression flag SCA is set to the unsuppressed state. It may also be because the triggered scheduling is based on other policies other than the service quality policy and the preferred policy. At this time, the preferred suppression flag SCA is set to the unsuppressed state. In this way, the preferred suppression detection will not be entered, but the factory settings will be directly restored. Other policies here include but are not limited to affinity attributes, cross-domain, number of hops, backup-to-primary, etc.

[0047] In the embodiment of the present application, step 103 and step 104 are optional steps, and there is no order. In addition, in some embodiments, there may be only step 103 but no step 104. These embodiments are all within the protection scope of the present application.

[0048] It should be noted that in the first embodiment, when the link quality in the topology is stable, the service forwarding path will adopt the optimal path S1. Therefore, when the current service forwarding path S1 meets both the service quality strategy and the optimization strategy requirements, it is the initial routing, and the optimization scheduling completion time ACT=0 is recorded at this time.

[0049] The controller performs continuous optimization detection. When the service preferred forwarding path S1 fails to meet the service quality policy requirements, the service forwarding path S2 is calculated based on the service quality policy. The service forwarding path S2 is a non-preferred forwarding path, triggering the preferred scheduling based on the preferred policy. The preferred scheduling path S1 is calculated by the service quality policy. The service quality policy and the preferred policy are pre-stored in the policy template bound to the controller application group.

[0050] During the continuous optimization detection process, the controller detects whether the preferred scheduling is suppressed based on the state of the recorded preferred suppression flag SCA. For example, if the recorded preferred suppression flag SCA is false, the preferred scheduling is not suppressed; if the recorded preferred suppression flag SCA is true, the preferred scheduling is suppressed. In this way, during the continuous optimization detection process, it can be known whether the preferred scheduling is suppressed by the current state of the recorded preferred suppression flag SCA.

[0051] The preferred path in this application refers to a link in the topology whose color attribute is consistent with the preferred color.

[0052] Optimal scheduling refers to scheduling that is triggered when it is detected that the color of the link through which the path passes is different from the color required by the optimal strategy.

[0053] Continuous optimization refers to the process in which the controller recalculates and re-deploys the forwarding path deployed under the tunnel that carries the service when the latency, jitter, packet loss rate, etc. of the forwarding path deployed under the tunnel does not meet the quality policy requirements, does not meet the preferential coloring requirements, does not meet the must-exclusion policy requirements, or when there is traffic congestion.

[0054] The present application also provides a network device, such as Figure 4 As shown, it includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, the above-mentioned invalid traffic scheduling suppression method based on topology is executed. The network devices here can be routers and switches managed by the controller. The controller is deployed on a physical server, connected to the topological network of routers and switches, and schedules the service traffic.

[0055] The storage medium of the embodiment of the present application stores computer program instructions thereon, and when the program instructions are executed by a processor, they are used to implement the above-mentioned invalid traffic scheduling suppression method based on topology.

[0056] The above-mentioned machine-readable storage medium may be any electronic, magnetic, optical or other physical storage device, which may contain or store information, such as executable instructions, data, etc. For example, the machine-readable storage medium may be: RAM (Radom Access Memory), volatile memory, non-volatile memory, flash memory, storage drive (such as hard disk drive), solid state drive, any type of storage disk (such as CD, DVD, etc.), or similar storage medium, or a combination thereof.

[0057] The systems, devices, modules or units described in the above embodiments may be implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer, which may be in the form of a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email transceiver, a game console, a tablet computer, a wearable device or a combination of any of these devices.

[0058] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the embodiments of the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0059] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0060] Moreover, these computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory produce a product including an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.

[0061] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for executing on the computer or other programmable device to implement the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0062] The above are only embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included within the scope of the claims of the present application.

[0063] It should be understood that the present application is not limited to the precise structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present application is limited only by the appended claims.

[0064] The above are only preferred embodiments of the present application and are not intended to limit the present application. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present application should be included in the scope of protection of the present application.

Claims

1. A topology-based invalid traffic scheduling suppression method is applied to management equipment, characterized in that: include: Based on the time difference t between the current triggering optimal scheduling time CCT and the last optimal scheduling completion time ACT, it is determined whether the service optimal forwarding path S1 is oscillating; If the time difference t is less than or equal to the path oscillation duration CRT, it is determined that the service preferred forwarding path S1 is oscillating, and the preferred scheduling is suppressed, and the service forwarding path S2 is used to continue forwarding; Based on the time difference t between the current triggering optimal scheduling time CCT and the last optimal scheduling completion time ACT, it is determined whether the service optimal forwarding path S1 has flapped, including: When the service forwarding path S2 meets the service quality policy requirements but does not meet the optimization policy requirements, continuous optimization detection is performed to trigger the optimization scheduling and set the triggering optimization scheduling time CCT; If the optimal scheduling is not suppressed, and the last optimal scheduling completion time ACT = 0 or CCT-ACT>CRT, the optimal scheduling is executed, the service forwarding path is adjusted back to the service optimal forwarding path S1, and the current optimal scheduling completion time ACT' is recorded; Schedule to other service forwarding paths except S1; When the other service forwarding paths can meet the service quality policy but cannot meet the requirements of the preferred policy, continuous optimization detection is performed to trigger the preferred scheduling. If CCT-ACT'≤CRT, it is determined that the quality of the service preferred forwarding path S1 fluctuates, and the preferred suppression flag SCA is set to the suppression state.

2. The method for suppressing invalid traffic scheduling based on topology according to claim 1 is characterized in that: In the continuous optimization detection, if it is detected that the time difference t reaches or exceeds the preferred scheduling suppression time SCT or the last preferred scheduling completion time ACT=0, the preferred scheduling is restored and scheduled to the service preferred forwarding path S1, and the preferred suppression flag SCA is set to the unsuppressed state.

3. The method for suppressing invalid traffic scheduling based on topology according to claim 2 is characterized in that: When the service preferred forwarding path S1 satisfies both the service quality policy and the preferred policy requirements, it is an initial route selection, and the last preferred scheduling completion time ACT is set to 0.

4. The method for suppressing invalid traffic scheduling based on topology according to claim 3 is characterized in that: When the service preferred forwarding path S1 cannot meet the service quality policy requirements; The service forwarding path S2 is obtained by calculation based on the service quality policy; The service forwarding path S2 is a non-preferred forwarding path, triggering the preferred scheduling based on the preferred strategy.

5. The method for suppressing invalid traffic scheduling based on topology according to claim 1 or 4, characterized in that: During the continuous optimization detection process, based on the state of the recorded preferred suppression flag SCA, it is detected whether the preferred scheduling is suppressed.

6. The method for suppressing invalid traffic scheduling based on topology according to claim 3 is characterized in that: When the preferred strategy for triggering scheduling changes, ACT is set to 0 and the preferred suppression flag SCA is set to the unsuppressed state.

7. The method for suppressing invalid traffic scheduling based on topology according to claim 3 is characterized in that: When the trigger scheduling is based on a policy other than the service quality policy and the preferred policy, ACT is set to 0, and the preferred suppression flag SCA is set to the unsuppressed state.

8. A network device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the topology-based invalid traffic scheduling suppression method described in any one of claims 1-7 is executed.

9. A storage medium having computer program instructions stored thereon, characterized in that: When the program instructions are executed by the processor, they are used to implement the topology-based invalid traffic scheduling suppression method described in any one of claims 1-7.

Images