CN116112424B

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

Info

Publication number: CN116112424B
Application number: CN202310030185.XA
Authority: CN
Inventors: 吕照明
Original assignee: New H3C Information Technologies Co Ltd
Current assignee: New H3C Information Technologies Co Ltd
Priority date: 2023-01-10
Filing date: 2023-01-10
Publication date: 2025-03-11
Anticipated expiration: 2043-01-10
Also published as: CN116112424A

Abstract

The application provides a topology-based invalid traffic scheduling suppression method, network equipment and a storage medium, wherein the method is applied to management equipment and comprises the steps of judging whether a service preferential forwarding path S1 oscillates or not based on a time difference t between a current trigger preferential scheduling time CCT and a last preferential scheduling completion time ACT, and if the time difference t is smaller than or equal to a path oscillation time CRT, judging that the service preferential forwarding path S1 oscillates, suppressing preferential scheduling and continuing forwarding by a service forwarding path S2. In the continuous optimization process, the embodiment of the application can trigger the scheduling in time when the path delay, jitter, packet loss rate and the like are perceived to not meet the quality policy requirements, and simultaneously automatically identify whether the quality of the service preferred path oscillates, thereby inhibiting the invalid preferred scheduling and ensuring the stability of forwarding the service flow.

Description

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

Technical Field

The present application relates to the field of communications devices, and in particular, to a topology-based invalid traffic scheduling suppression method, a network device, and a storage medium.

Background

After the controller establishes the BGP neighbors, the device reports node, link and route prefix information to the controller through BGP-LS, and the controller completes the construction of network topology by using the information. After topology construction is completed, a user can start to deploy a service at the controller, issue tunnels, complete path selection, issue and the like so as to realize flow forwarding, and when the user configures a preferred strategy, the controller can preferentially select a preferred path formed by links meeting the preferred strategy on the premise of meeting quality strategy requirements such as service delay, jitter, packet loss rate and the like when the controller selects a path. When the quality of the forwarding path is poor and the service quality policy requirement cannot be met, the controller adjusts the path to be a non-preferred path meeting the quality policy requirement, and after the preferred path quality is recovered, the controller reselects the path. In the above scenario, if the link quality of the preferred path oscillates, a large number of invalid schedules in a short time are caused. Resulting in reduced networking forwarding capability and even service unavailability.

To the inventor's knowledge, the existing solution is to increase the global optimization period length, that is, the controller perceives the quality degradation of the link, and when the quality policy requirement of the service cannot be met, the controller triggers the relevant service scheduling to call out the path from the quality degradation link. When the link quality is recovered, if the global optimization opportunity is not reached, the fact that the current path does not meet the requirement of the optimal strategy cannot be detected, and scheduling cannot be triggered. At this time, if the link quality meets the service quality policy requirement in a short time, and does not meet the service quality policy requirement, the impact of invalid traffic scheduling on the service can be avoided, and the service forwarding capability is directly affected.

The global optimization here refers to the process of recalculating and deploying all tunnels carrying services according to the importance level from high to low and all policy requirements.

Disclosure of Invention

In order to overcome the problems in the related art, the application provides a topology-based invalid traffic scheduling suppression method, network equipment and a storage medium.

According to a first aspect of the embodiment of the present application, there is provided a topology-based invalid traffic scheduling suppression method, applied to a management device, including:

Judging whether the service preferential forwarding path S1 oscillates or not based on a time difference t between the current trigger preferential dispatching time CCT and the last preferential dispatching completion time ACT;

If the time difference t is smaller than or equal to the path oscillation duration CRT, the preferred service forwarding path S1 is determined to oscillate, and the preferred scheduling is suppressed, and the service forwarding path S2 is used for forwarding continuously.

Preferably, in the continuous optimization detection, if the detected time difference t is equal to or greater than the preferred scheduling suppression duration SCT or the detected preferred scheduling completion time act=0, the preferred scheduling is resumed, and the preferred suppression flag SCA is set to an uninhibited state until the traffic preferred forwarding path S1 is scheduled.

Preferably, when the service preferred forwarding path S1 meets both the quality of service policy and the preferred policy requirement, a preferred scheduling completion time act=0 is set for initial routing.

Preferably, when the service preferred forwarding path S1 cannot meet the service quality policy requirement;

Calculating to obtain the service forwarding path S2 based on a service quality strategy;

the traffic forwarding path S2 is a non-preferred forwarding path triggering a preferred scheduling based on a preferred policy.

Preferably, based on the time difference t between the current trigger preferential scheduling time CCT and the last preferential scheduling completion time ACT, determining whether the preferential forwarding path S1 of the service oscillates includes:

the service forwarding path S2 meets the requirements of the service quality policy, and when the requirements of the preference policy are not met, the optimization detection is continuously carried out, the preference scheduling is triggered, and the preference scheduling time CCT of the triggering is set;

If the preferred scheduling is not inhibited, executing the preferred scheduling when the last preferred scheduling completion time act=0 or CCT-ACT > CRT, and the service forwarding path recalls the service preferred forwarding path S1 and records the current preferred scheduling completion time ACT';

Scheduling to other traffic forwarding paths than the traffic preferred forwarding path S1;

when the other service forwarding paths can meet the service quality policy and cannot meet the requirement of the preferred policy, continuous optimization detection is performed, preferred scheduling is triggered, and if CCT-ACT' is less than or equal to CRT, the quality of the service preferred forwarding path S1 is judged to oscillate, and a preferred suppression flag bit SCA is set to be in a suppression state.

Preferably, in the continuous optimization detection process, whether the preferred schedule is suppressed is detected based on the recorded status of the preferred suppression flag SCA.

Preferably, when the preferred policy of the trigger schedule changes, the ACT is set to 0, and the preferred suppression flag SCA is set to an uninhibited state.

Preferably, when the trigger schedule is based on a quality of service policy and other policies than the preferred policy, the ACT is set to 0, and the preferred suppression flag SCA is set to an uninhibited state.

A second aspect of the present application provides a network device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor executing the program to perform a method comprising topology-based null traffic scheduling suppression as described above.

A third aspect of the present application provides a storage medium having stored thereon computer program instructions which, when executed by a processor, are adapted to carry out the topology-based null traffic scheduling suppression method described above.

The technical scheme provided by the embodiment of the application can have the following beneficial effects:

in the continuous optimization process, the embodiment of the application can trigger the scheduling in time when the path delay, jitter, packet loss rate and the like are perceived to not meet the quality policy requirements, and simultaneously automatically identify whether the quality of the service preferred path oscillates, thereby inhibiting the invalid preferred scheduling and ensuring the stability of forwarding the service flow.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application as claimed.

Drawings

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.

FIG. 1 is a schematic flow chart of an embodiment of the present application;

Fig. 2 is a schematic flow chart for judging whether a service forwarding path oscillates or not according to the present application;

FIG. 3 is a schematic illustration of a process for practicing the present application;

FIG. 4 is a block diagram of the network device structure of the present application.

Detailed Description

Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated. The implementations described in the following exemplary examples do not represent all implementations consistent with the application. Rather, they are merely examples of apparatus and methods consistent with aspects of the application as detailed in the accompanying claims.

Under the condition that the link quality in the topology is stable, the controller can preferentially adopt an optimal service optimal forwarding path S1 to deploy and forward the service traffic, and at the moment, if the condition that the quality degradation such as path delay, jitter, packet loss rate and the like does not meet the quality policy requirement occurs, the controller can be automatically switched to a suboptimal path S2 to deploy and forward the service traffic. And the suboptimal path cannot meet the quality of service policy requirements. The above-mentioned problem of deterioration of the path quality is only short time or instant, so that the optimum path S1 is restored to normal soon, and thus it is necessary to switch the traffic forwarding path again to the optimum path S1. When the problems of poor quality such as path delay, jitter, packet loss rate and the like occur again, the service forwarding path is automatically switched to the suboptimal path S2 again, and the process is repeated. Resulting in a large number of frequent schedules in a short time. The networking forwarding capability is reduced, and the service forwarding stability is affected.

In order to solve the problems in the background art and the above description, a first embodiment of the present application provides a topology-based invalid traffic scheduling suppression method, which is applied to a management device, as shown in fig. 1, and includes:

101, calculating a time difference t between the current trigger optimal scheduling time CCT and the last optimal scheduling completion time ACT;

102, judging whether a service preferential forwarding path S1 oscillates or not;

As an example, the steps are included as follows, as depicted in fig. 2:

1021, when the current service forwarding path S2 meets the service quality policy requirement but does not meet the preference policy requirement, continuously optimizing detection, triggering preference scheduling, and setting the preference scheduling time CCT of the triggering;

1022, if the preferred scheduling is not inhibited, executing the preferred scheduling if the last preferred scheduling completion time act=0 or CCT-ACT > CRT, and the service forwarding path recalls the service preferred forwarding path S1 and records the current preferred scheduling completion time ACT';

1023, dispatching to other service forwarding paths except S1;

It should be noted that, the other traffic forwarding paths described herein are other traffic forwarding paths than the most preferred traffic forwarding path S1 among the paths achievable from a to B in the topology. There are typically multiple traffic forwarding paths from a to B under topology, which may be classified as optimal, sub-optimal, etc. by priority. The other forwarding paths may be sub-optimal paths, or otherwise.

1024, When the other service forwarding paths can meet the service quality policy and cannot meet the requirement of the optimization policy, continuously optimizing detection, triggering optimization scheduling, and if CCT-ACT' is less than or equal to CRT, judging that the quality of the service optimization forwarding path S1 oscillates, and setting an optimization suppression flag bit SCA to be in a suppression state.

103, If the time difference t is smaller than or equal to the path oscillation time CRT, judging that the service preferred forwarding path S1 oscillates, inhibiting preferred scheduling and continuing forwarding by the service forwarding path S2.

The preferred forwarding path S1 for traffic here is typically the optimal path from a to B under topology, but may also be a default or pre-selected path for the system. The traffic forwarding path S2 is also a forwarding path from a to B under topology, but is an optimal path other than the traffic preferred forwarding path S1. Of course, an alternative path may be a default or preselected path for the system.

When the current forwarding path is in S2, the switching to S1 is only performed when the service preferred forwarding path S1 meets the preferred scheduling condition, so that frequent invalid scheduling is avoided.

In the continuous optimization detection, if the time difference t is detected to be equal to or greater than the preferred scheduling suppression duration SCT or the preferred scheduling completion time act=0 is detected, the preferred scheduling is resumed, the traffic is scheduled to the preferred forwarding path S1, and the preferred suppression flag SCA is set to an uninhibited state, as shown in fig. 3. The SCT may be set according to the dependency on the preferred path resources, such as 30 minutes by default. The detected optimal schedule completion time ACT is 0, possibly due to the fact that when the optimal policy triggering the scheduling is changed, the optimal suppression flag SCA is set to an uninhibited state. It is also possible that the trigger schedule is based on a quality of service policy and other policies than the preferred policy, when the preferred suppression flag SCA is set to the non-suppressed state. This does not enter the preferred inhibit test, but rather directly restores the factory settings. Other policies herein include, but are not limited to, affinity properties, cross-domain, hop count, standby-to-primary, etc.

In the embodiment of the application, the step 103 and the step 104 are optional steps, and are not separated successively. Also in some embodiments there may be only step 103 and no step 104. These embodiments are all within the scope of the present application.

It should be noted that in the first embodiment, in the case of stable link quality in the topology, the service forwarding path will adopt the optimal path S1, so when the current service forwarding path S1 meets both the service quality policy and the preferred policy requirement, the preferred scheduling completion time act=0 is recorded for initial routing.

The controller performs continuous optimization detection, when the service optimal forwarding path S1 cannot meet the service quality policy requirement, the service forwarding path S2 is obtained through calculation based on the service quality policy, the service forwarding path S2 is a non-optimal forwarding path, and optimal scheduling based on an optimal policy is triggered. And calculating the optimal scheduling path S1 through the service quality strategy. The quality of service policies and preferred policies are pre-stored in the policy templates bound by the controller application group.

The controller detects whether the preferred schedule is suppressed during the continuous optimization detection process based on the recorded status of the preferred suppression flag SCA. For example, if the recorded preferred suppression flag SCA is false, the preferred schedule is not suppressed, and if the recorded preferred suppression flag SCA is true, the preferred schedule is suppressed. In the process of continuous optimization detection, whether the optimal scheduling is restrained or not can be known through the recorded current state of the optimal restraint flag bit SCA.

The preferred path in the present application refers to the consistency of the color attribute and the preferred color of the topology downlink.

The preferred scheduling refers to the scheduling triggered when the coloring of the links through which the path passes and the color required by the preferred policy are detected to be different.

Continuous optimization refers to the process that the delay, jitter, packet loss rate and the like of a forwarding path deployed under a tunnel carrying a service do not meet the quality policy requirement, the optimal coloring requirement, the policy requirement which is not required to be eliminated, or the controller recalculates and deploys the forwarding path deployed under the current tunnel when traffic is congested.

The embodiment of the application also provides network equipment, as shown in fig. 4, comprising a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor executes the method for suppressing the invalid traffic scheduling based on topology when executing the program. The network devices herein may be routers and switches, etc., managed by the controller. The controller is deployed on a physical server, and performs scheduling on traffic in a topology networking of the access router and the switch.

The storage medium of the embodiment of the application stores computer program instructions which are used for realizing the invalid traffic scheduling suppression method based on topology when being executed by a processor.

Wherein the machine-readable storage medium may be any electronic, magnetic, optical, or other physical storage device that can contain or store information, such as executable instructions, data, or the like. For example, the machine-readable storage medium may be RAM (Radom Access Memory, random access memory), volatile memory, non-volatile memory, flash memory, a storage drive (e.g., hard drive), a solid state disk, any type of storage disk (e.g., optical disk, dvd, etc.), or a similar storage medium, or a combination thereof.

The system, apparatus, module or unit set forth in the above embodiments may be implemented in particular by a computer chip or entity, or by a product having a certain function. A typical implementation device is a computer, which may be in the form of a personal computer, laptop computer, cellular telephone, camera phone, smart phone, personal digital assistant, media player, navigation device, email device, game console, tablet computer, wearable device, or a combination of any of these devices.

It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the application may take the form of a computer program product on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

Moreover, these computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

The foregoing is merely exemplary of the present application and is not intended to limit the present application. Various modifications and variations of the present application will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. which come within the spirit and principles of the application are to be included in the scope of the claims of the present application.

It is to be understood that the application is not limited to the precise arrangements and instrumentalities shown in the drawings, which have been described above, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the application is limited only by the appended claims.

The foregoing description of the preferred embodiments of the application is not intended to be limiting, but rather is intended to cover all modifications, equivalents, alternatives, and improvements that fall within the spirit and scope of the application.

Claims

1. The topology-based invalid traffic scheduling suppression method is applied to management equipment and is characterized by comprising the following steps:

If the time difference t is smaller than or equal to the path oscillation time CRT, judging that the service preferred forwarding path S1 oscillates, inhibiting preferred scheduling, and continuing forwarding by the service forwarding path S2;

based on the time difference t between the current trigger optimal scheduling time CCT and the last optimal scheduling completion time ACT, judging whether the service optimal forwarding path S1 oscillates or not, including:

scheduling to other service forwarding paths except S1;

2. The topology-based on-nothing traffic scheduling suppression method according to claim 1, wherein in the continuous optimization detection, if it is detected that the time difference t reaches or exceeds the preferred scheduling suppression duration SCT or the last preferred scheduling completion time act=0 is detected, the preferred scheduling is resumed, the scheduling is to the traffic preferred forwarding path S1, and the preferred suppression flag SCA is set to an uninhibited state.

3. The topology-based invalid traffic scheduling suppression method according to claim 2, wherein when the service preferred forwarding path S1 satisfies both the service quality policy and the preferred policy requirement, a last preferred scheduling completion time act=0 is set for the initial routing.

4. The topology-based null traffic scheduling suppression method of claim 3, wherein when the traffic preferred forwarding path S1 fails to meet the quality of service policy requirement;

5. The topology-based null traffic schedule suppression method of claim 1 or 4, wherein in the continuous optimization detection process, it is detected whether the preferential schedule is suppressed based on the status of the recorded preferential suppression flag bit SCA.

6. A topology-based null traffic schedule suppression method according to claim 3, wherein when a change occurs to the preferred policy triggering the schedule, the ACT is set to 0 and the preferred suppression flag SCA is set to an uninhibited state.

7. A topology-based null traffic schedule suppression method according to claim 3, wherein when the trigger schedule is based on a policy other than the quality of service policy and the preferred policy, then ACT is set to 0 and the preferred suppression flag SCA is set to an uninhibited state.

8. Network device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor executes the program comprising a topology-based null traffic scheduling suppression method according to any of claims 1-7.

9. A storage medium having stored thereon computer program instructions, which when executed by a processor are adapted to implement the topology-based null traffic scheduling suppression method of any of claims 1-7.