CN111092824B - Traffic management system, traffic management method, electronic terminal, and storage medium - Google Patents

Traffic management system, traffic management method, electronic terminal, and storage medium Download PDF

Info

Publication number
CN111092824B
CN111092824B CN201910949921.5A CN201910949921A CN111092824B CN 111092824 B CN111092824 B CN 111092824B CN 201910949921 A CN201910949921 A CN 201910949921A CN 111092824 B CN111092824 B CN 111092824B
Authority
CN
China
Prior art keywords
traffic
strategy
control unit
flowspec
queue
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CN201910949921.5A
Other languages
Chinese (zh)
Other versions
CN111092824A (en
Inventor
张�浩
张正龙
冯汉希
訾宪娟
陈海旻
宋晗晟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Bank of Communications Co Ltd Data Center
Original Assignee
Bank of Communications Co Ltd Data Center
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Bank of Communications Co Ltd Data Center filed Critical Bank of Communications Co Ltd Data Center
Priority to CN201910949921.5A priority Critical patent/CN111092824B/en
Publication of CN111092824A publication Critical patent/CN111092824A/en
Application granted granted Critical
Publication of CN111092824B publication Critical patent/CN111092824B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/20Traffic policing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/22Traffic shaping
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS

Abstract

The application provides a traffic management system, a method, an electronic terminal, and a storage medium, the traffic management system including: the control unit is used for generating a flowspec flow management strategy; and the node unit or units are accessible to the control unit in a routing way so as to receive the flowspec traffic management strategy and carry out bandwidth allocation and/or speed limit allocation on the traffic to be transmitted according to the flowspec traffic management strategy. According to the technical scheme, the traffic can be quickly changed to enter the idle queue to avoid congestion on the premise of not changing local configuration, the bandwidth requirement of burst traffic can be met by means of local QoS configuration, the traffic speed limit can be flexibly realized, and the bandwidth requirement of important services is guaranteed. In addition, the technical scheme of the application also effectively avoids a routing loop caused by the flow strategy when the wide area network link is interrupted through real-time BGP state monitoring, ensures the consistency of the back-and-forth path of the flow by issuing the strategy or a strategy group, verifies the effectiveness of the issuing of the strategy through synchronous configuration, and prevents strategy errors and the like through a visual flow view.

Description

Traffic management system, traffic management method, electronic terminal, and storage medium
Technical Field
The present application relates to the field of traffic management technologies, and in particular, to a traffic management system, a traffic management method, an electronic terminal, and a storage medium.
Background
QoS (Quality of Service) refers to a network that can provide better Service capability for specified network communication by using various basic technologies, and is a security mechanism of the network, which is a technology for solving the problems of network delay and congestion.
However, the local QoS configuration still cannot solve the situation of bandwidth congestion well, for example, when a queue is congested and another queue is idle, or when some temporary pending traffic is newly added in the queue, the prior art cannot perform dynamic configuration flexibly, and cannot improve the traffic configuration efficiency effectively.
Content of application
In view of the above-mentioned drawbacks of the prior art, an object of the present application is to provide a traffic management system, a method, an electronic terminal, and a storage medium, which are used to solve the technical problems in the prior art, such as inability to flexibly dynamically configure traffic congestion or newly added traffic, inability to effectively improve traffic configuration efficiency, and the like.
To achieve the above and other related objects, a first aspect of the present application provides a traffic management system, comprising: the control unit is used for generating a flowspec flow management strategy; and the node unit or units are accessible to the control unit in a routing way so as to receive the flowspec traffic management strategy and perform queue distribution and/or bandwidth speed limitation on the traffic to be transmitted according to the flowspec traffic management strategy.
In some embodiments of the first aspect of the present application, the flowspec traffic management policy comprises: if one DSCP queue in the node unit is congested, introducing the traffic to be transmitted into other idle DSCP queues or limiting the speed of the transmission traffic entering the DSCP queues.
In some embodiments of the first aspect of the present application, the flowspec traffic management policy comprises: and carrying out mark change on the traffic to be transmitted so as to change marks of the traffic to be transmitted, which correspond to the DSCP queue in the first node unit, into marks which correspond to other DSCP queues in the node unit.
In some embodiments of the first aspect of the present application, the flowspec traffic management policy comprises: and if the DSCP queue in the node unit newly increases the traffic to be transmitted, performing speed-limiting distribution on the newly increased traffic to be transmitted so as to enable the newly increased traffic to be transmitted and the original traffic to be transmitted in the queue to perform bandwidth sharing.
In some embodiments of the first aspect of the present application, the control unit is further configured to determine whether a BGP neighbor is interrupted based on a BGP monitoring protocol, and revoke an already activated traffic scheduling policy if the BGP neighbor is determined to be interrupted.
In some embodiments of the first aspect of the present application, the control unit issues a single policy to specify that a certain segment of wan traffic is switched from an original path to a preset path; and/or the control unit issues a strategy group to designate the whole wide area network flow to be switched from an original path to a preset path; all node units involved in the path scheduling of the traffic perform synchronous node operation.
In some embodiments of the first aspect of the present application, the system further comprises: the first control unit and the second control unit are synchronously configured; a route reflection device; the first control unit issues a configuration strategy to the route reflection equipment; the routing reflection equipment reflects the received configuration strategy to the second control unit; and the second control unit compares the configuration strategies received from the first control unit and the route reflection equipment, and verifies whether the configuration strategies are effectively issued to the route reflection equipment according to the compared result information.
In some embodiments of the first aspect of the present application, the system further comprises: and the visualization unit is used for creating a flow scheduling strategy effect preview mechanism so as to display the path information of the pre-constructed flow scheduling after the strategy is generated.
In some embodiments of the first aspect of the present application, the system further comprises: under the condition that the BGP neighbor relation between the control unit and the network equipment is interrupted, the flowspec flow management strategy issued by the control unit is automatically invalid, and the network equipment selects a path according to a preset routing table; and/or, under the condition that the BGP neighbor relation between the control unit and the network equipment is recovered, the flowspec flow management strategy takes effect again.
To achieve the above and other related objects, a second aspect of the present application provides a traffic management method, including: generating a flowspec flow management strategy; and performing queue distribution and/or bandwidth speed limitation on the traffic to be transmitted according to the flowspec traffic management strategy.
To achieve the above and other related objects, a third aspect of the present application provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the traffic management method.
To achieve the above and other related objects, a fourth aspect of the present application provides an electronic terminal comprising: a processor and a memory; the memory is used for storing computer programs, and the processor is used for executing the computer programs stored by the memory so as to enable the terminal to execute the traffic management method.
As described above, the traffic management system, the traffic management method, the electronic terminal, and the storage medium according to the present application have the following advantageous effects: the technical scheme provided by the application can not only realize that the flow is quickly changed to enter the idle queue to avoid congestion on the premise of not changing the local configuration, but also meet the bandwidth requirement of burst flow by means of local QoS configuration, flexibly realize flow speed limit and ensure the bandwidth requirement of important services. In addition, the technical scheme of the application also effectively avoids the loop or the route black hole through the real-time BGP state monitoring, ensures the consistency of the back-and-forth path of the flow through a mode of issuing the strategy or the strategy group, verifies the effectiveness of the strategy issuing through synchronous configuration, prevents the strategy error through a visual flow view and the like. Therefore, the application effectively overcomes various defects in the prior art and has high industrial utilization value.
Drawings
Fig. 1 is a schematic structural diagram of a traffic management system according to an embodiment of the present application.
Fig. 2A is a diagram illustrating an embodiment of changing application traffic from a congested queue to a free queue.
Fig. 2B is a diagram illustrating sharing of a queue by multiple application traffics according to an embodiment of the present application.
Fig. 3A is a schematic diagram illustrating a scenario of a traffic path based on a BGP monitoring protocol according to an embodiment of the present application.
Fig. 3B is a schematic diagram illustrating a scenario of a traffic path based on a BGP monitoring protocol according to an embodiment of the present application.
Fig. 4 is a schematic structural diagram of a traffic management system according to an embodiment of the present application.
Fig. 5 is a flowchart illustrating a traffic management method according to an embodiment of the present application.
Fig. 6 is a schematic structural diagram of an electronic terminal according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application is provided by way of specific examples, and other advantages and effects of the present application will be readily apparent to those skilled in the art from the disclosure herein. The present application is capable of other and different embodiments and its several details are capable of modifications and/or changes in various respects, all without departing from the spirit of the present application. It is to be noted that the features in the following embodiments and examples may be combined with each other without conflict.
It is noted that in the following description, reference is made to the accompanying drawings which illustrate several embodiments of the present application. It is to be understood that other embodiments may be utilized and that mechanical, structural, electrical, and operational changes may be made without departing from the spirit and scope of the present application. The following detailed description is not to be taken in a limiting sense, and the scope of embodiments of the present application is defined only by the claims of the issued patent. The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. Spatially relative terms, such as "upper," "lower," "left," "right," "lower," "below," "lower," "above," "upper," and the like, may be used herein to facilitate describing one element or feature's relationship to another element or feature as illustrated in the figures.
In this application, unless expressly stated or limited otherwise, the terms "mounted," "connected," "secured," "retained," and the like are to be construed broadly and can, for example, be fixedly connected, detachably connected, or integrally connected; can be mechanically or electrically connected; they may be connected directly or indirectly through intervening media, or they may be interconnected between two elements. The specific meaning of the above terms in the present application can be understood by those of ordinary skill in the art as appropriate.
Also, as used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context indicates otherwise. It will be further understood that the terms "comprises," "comprising," and/or "comprising," when used in this specification, specify the presence of stated features, operations, elements, components, items, species, and/or groups, but do not preclude the presence, or addition of one or more other features, operations, elements, components, items, species, and/or groups thereof. The terms "or" and/or "as used herein are to be construed as inclusive or meaning any one or any combination. Thus, "A, B or C" or "A, B and/or C" means "any of the following: a; b; c; a and B; a and C; b and C; A. b and C ". An exception to this definition will occur only when a combination of elements, functions or operations are inherently mutually exclusive in some way.
The application provides a traffic management system, a method, an electronic terminal and a storage medium to solve the problems that dynamic configuration cannot be flexibly performed on the situations of traffic congestion or newly added traffic and the like, and the traffic configuration efficiency cannot be effectively improved in the prior art.
The technical scheme provided by the application can not only realize that the flow is quickly changed to enter the idle queue to avoid congestion on the premise of not changing the local configuration, but also meet the bandwidth requirement of burst flow by means of local QoS configuration, flexibly realize flow speed limit and ensure the bandwidth requirement of important services. In addition, the technical scheme of the application also effectively avoids the loop or the route black hole through the real-time BGP state monitoring, ensures the consistency of the back-and-forth path of the flow through a mode of issuing the strategy or the strategy group, verifies the effectiveness of the strategy issuing through synchronous configuration, prevents the strategy error through a visual flow view and the like. Hereinafter, the technical solution of the present application will be further explained and illustrated with reference to specific embodiments.
Example one
Fig. 1 is a schematic structural diagram illustrating a traffic management system according to an embodiment of the present application. The traffic management system of this embodiment includes a control unit and one or more node units (node unit 1, … …, node unit n), where the control unit is configured to generate a flowspec traffic management policy, and the one or more node units are reachable by routing with the control unit to receive the flowspec traffic management policy and perform queue allocation and/or bandwidth speed limitation on traffic to be transmitted according to the flowspec traffic management policy.
The dynamic QoS function realized by the flow management system can be used in linkage with the QoS function of the existing network equipment, so that the situation that the flow is changed rapidly to enter an idle queue to avoid congestion on the premise of not changing local configuration can be realized, the bandwidth requirement of burst flow can be met by means of local QoS configuration, the flow speed limit can be realized flexibly, and the bandwidth requirement of important services can be guaranteed. Among them, QoS (Quality of Service) refers to a network that can provide better Service capability for specified network communication by using various basic technologies, and is a security mechanism of the network to solve the problems of network delay and congestion.
It should be noted that the control unit may employ various types of hardware devices. The hardware device is, for example, a controller, specifically, an arm (advanced RISC machines) controller, an fpga (field Programmable Gate array) controller, a soc (system on chip) controller, a dsp (digital Signal processing) controller, or an mcu (micro controller unit) controller, etc.; such as a computer including components such as memory, a memory controller, one or more processing units (CPUs), peripheral interfaces, RF circuitry, audio circuitry, speakers, a microphone, input/output (I/O) subsystems, a display screen, other output or control units, and external ports; the computer includes, but is not limited to, personal computers such as desktop computers, notebook computers, tablet computers, smart phones, smart televisions, Personal Digital Assistants (PDAs), and the like. In other embodiments, the hardware device may also be a server, where the server may be arranged on one or more entity servers according to various factors such as functions and loads, or may be formed by a distributed or centralized server cluster, and this embodiment is not limited in this embodiment.
In some optional implementations, the flowspec traffic management policy in this embodiment includes: if the DSCP queue in the first node unit is congested, introducing the traffic to be transmitted into other idle DSCP queues or limiting the speed of the transmission traffic entering the first DSCP queue.
In other optional implementations, the flowspec traffic management policy further includes: and if the DSCP queue in the node unit newly increases the traffic to be transmitted, performing speed-limiting distribution on the newly increased traffic to be transmitted so as to enable the newly increased traffic to be transmitted and the original traffic to be transmitted in the queue to perform bandwidth sharing.
Specifically, when the local QoS configuration on the network device is still valid, after the policy delivered by the Flowspec is pushed to the network device, the valid sequence is the ingress local QoS, the Flowspec QoS policy, and the egress local QoS in turn.
To facilitate understanding for those skilled in the art, the technical solution of the present application will now be further explained and illustrated with reference to fig. 2A and 2B. Fig. 2A is a schematic diagram illustrating an embodiment of changing application traffic from a congested queue to a free queue; fig. 2B is a diagram illustrating sharing of a queue by multiple application traffics according to an embodiment of the present application.
As shown in fig. 2A, the local configuration ingress direction marks certain application traffic 10.1.1.1 as DSCP11, ingress to queue a (DSCP 11), and the traffic in the egress direction of queue a (DSCP 11) is forced to be restricted to speed no more than 2 Mb/s; the traffic in the out direction of queue B (DSCP21) is constrained to be limited to speeds no greater than 3 Mb/s.
In the case of congestion in queue a and less busy queue B, the flag for application traffic 10.1.1.1 may be changed to DSCP21 using flowspec push dynamic QoS policy. That is, the application traffic labeled DSCP11 should originally enter queue a, but since queue a is congested, the dynamic QoS policy pushed based on flowspec marks the application traffic as DSCP21, thereby causing the application traffic to enter queue B.
It should be noted that, when the congestion of the queue a is finished, the QoS policy pushed by flowspec may be cancelled, so that the application traffic returns to the queue a again. Therefore, the bandwidth of the queue A is saved, and the application flow can be guaranteed to be allocated with enough bandwidth. It should be understood that the revocation and the deletion described in this embodiment are different, that is, the QoS policy pushed by flowspec is revoked and then the policy content is still retained, which has the advantage that the retained QoS policy can be directly used when the same scene appears next time, so that the time cost is saved and the traffic management efficiency is improved.
In case a new application traffic is temporarily generated to share the queue, for example, another application traffic 10.2.2.2 is temporarily generated, it is required to achieve that the application traffic 10.1.1.1 and 10.2.2.2 can simultaneously share the 2Mb/s bandwidth of the queue a. As shown in fig. 2B, the new application traffic 10.2.2.2 is marked as DSCP11 and is rate-limited to 1Mb/s using flowspec push dynamic QoS policy. While the traffic 10.1.1.1 arrives at the network device, it goes directly into queue a, and the two flows 10.1.1.1 and 10.2.2.2 split the directional 2Mb/s bandwidth when leaving the network device, i.e. each occupies 1 Mb/s. After the traffic 10.2.2.2 finishes transmission, the traffic 10.1.1.1 can monopolize the bandwidth of 2Mb/s in the queue A outgoing direction, thereby realizing flexible and rapid allocation of the temporarily generated new traffic.
It should be noted that the QoS policy described in this embodiment is revocable, but it should be understood that the revocation and the deletion described in this embodiment are different, that is, the QoS policy pushed by flowspec is revoked, and then policy content is still retained.
Example two
In an embodiment, the control unit further implements intelligent state monitoring through a BGP Monitoring Protocol (BMP), and determines whether a BGP neighbor is interrupted according to EBGP session state information, thereby determining whether an activated traffic scheduling policy needs to be revoked. And meanwhile, when the control unit sends the strategy, the EBGP state is also checked, and if the EBGP state is abnormal, the corresponding strategy group is failed to activate.
In particular, a BGP Monitoring Protocol (BMP) function may monitor BGP neighbors (called BMP clients), the control unit being configured as a BMP server that monitors one or more BMP clients, i.e. network devices. BGP neighbors (called BMP clients) are configured to send data to a particular BMP server for monitoring. When the BMP server connects to the first BMP neighbor, it sends a refresh request to monitor the BMP client and starts monitoring BMP clients for which a connection has been established. If the BMP detects that the BGP neighbor is somehow disrupted, all flowspec related policies are withdrawn.
The connection failures referred to in this embodiment include both uplink and downlink failures, both of which may result in routing loops. For those skilled in the art to understand, a schematic view of a traffic path based on the BGP monitoring protocol in the present technical solution is shown in fig. 3A and 3B.
In FIG. 3A, without the flowspec strategy, the flow goes from ZJTRS through ZJAGG and finally to branch LZ 1; in the case of the flowspec strategy, the flow path can be changed, for example, from ZJTRS, along the dashed line through CHJAGG to branch LZ2 and finally to branch LZ 1.
In this case, when the traffic is switched from the union router 1(LZ-1) to the union router 2(LZ-2), if the uplink (the moat link) of the LZ-2 fails, the traffic may be looped between the LZ-2 and the LZ-1. Specific examples thereof include: if there is an interruption in the operator line between CHJAGG and LZ1 that the control unit cannot sense, a black hole in the flow will result, i.e. the controller tells the network device that the flow is sent to the canal line, although no path is available to reach the branch.
As shown in fig. 3B, the OA plane aggregation router downlink failure may cause traffic to loop between ZJTRSHL-1 and ZJOAHL-1 in case of ZJAGG router downlink failure.
Therefore, the BMP function of the control unit in this embodiment can solve the problem of the traffic black hole well, and the policy on a part of the interrupted path is cancelled in time through real-time BGP state monitoring, so as to avoid a routing loop or a routing black hole. Specifically, the control unit monitors all three lines leading to the branch in the graph, and if one line is interrupted, all flowspec strategies related to the line are withdrawn, so that the flow returns to the other two lines, and the phenomenon of routing loop caused by the uplink fault of the joint router is avoided.
EXAMPLE III
In this embodiment, the control unit issues a single policy or a set of multiple policies to specify that the single or multiple wan traffic is switched from the original path to the preset path. Specifically, the controller may issue a single policy specifying switching of a single wan traffic from an original path to a specified path (also referred to as a one-to-one policy), or may issue a set of policies specifying switching of multiple wan traffic from an original path to a specified path (also referred to as a many-to-many policy).
Under the scene of a many-to-many strategy, a user can select 1 head office data center and one or more branches, input corresponding IP address fields of the head office and the branches (each head office data center and each branch supports a plurality of IP address fields), and appoint a certain wide area network link as a target line. The system correspondingly generates a plurality of strategy groups according to the input of the user, and all the strategy groups are activated (issued), cancelled and deleted together; after the policy activation, if a certain policy group fails to pass the verification, the user can manually activate, cancel and delete the policy by taking the policy group as a unit.
To facilitate understanding of those skilled in the art, fig. 3A in the above embodiment is illustrated as an example. In the case of the flowspec strategy, the flow path can be changed, for example, from ZJTRS, along the dashed line through CHJAGG to branch LZ2 and finally to branch LZ 1.
In this case, the policy configuration involves a series of devices ZJTRS, CHJTRS, CHJOA, CHJAGG, LZ1, LZ 2. For this reason, the present embodiment proposes a policy group concept, in which all node units on a path involved in scheduling of multiple specified flows are integrated into one scenario, and each node unit performs a synchronized node operation, such as unified execution of operations of activation, revocation, deletion, and the like.
For example, traffic going from head office 1.1.1.1 to branch 2.2.2.2, the ZJTRS next hop is designated CHJTRS; flow from head office 1.1.1.1 to branch 2.2.2.2, the CHJTRS next hop is designated CHJOA; flow from headquarters 1.1.1.1 to branch 2.2.2.2, LZ1 next hop designated LZ 2; on return, flow from branch 2.2.2.2 to head 1.1.1.1, the LZ1 next hop designated LZ 2; in the return process, flow from branch 2.2.2.2 to head 1.1.1.1, CHJOA next hop locates CHJTRS, and so on. The strategies can be combined into a strategy group and issued or cancelled together, so that errors such as artificial mismatching and missing distribution are avoided, and the maintenance efficiency is improved.
It should be understood that the above examples are provided for illustrative purposes and should not be construed as limiting. Likewise, a policy group may additionally or alternatively include other policies or include more or fewer policies without departing from the scope of this application.
The technical scheme of the embodiment innovatively provides a strategy group concept, integrates all nodes on paths related to scheduling of a plurality of specified flows into one scene to perform unified node operation, greatly simplifies the management cost, reduces the operation risk, and ensures the consistency of the back-and-forth paths.
Example four
In this embodiment, the traffic management system includes control units deployed in pairs, that is, a control unit for issuing a policy and a control unit for receiving the policy.
Fig. 4 is a schematic structural diagram of the traffic management system in this embodiment. The flow management system comprises a control unit A, a control unit B and a route reflector, wherein the control unit A and the control unit B are arranged in pairs, namely a jumper wire for synchronous configuration is connected between the control unit A and the control unit B.
The control unit A is responsible for issuing the strategy and pushing the strategy to the network equipment; the network device acts as a route reflector and forwards the routing policy received from control unit a to control unit B. The control unit B compares the configuration strategies received from the control unit A and the network equipment so as to check whether the strategies are effectively issued to the execution equipment.
In some alternative implementations, if the verification fails, the page is marked with an "unverified" status.
EXAMPLE five
In this embodiment, the system further includes a visualization unit, configured to create a flow scheduling policy effect preview mechanism, and after generating a policy, see a specific path taken before and after the flow scheduling through the proposed topology, and after determining that there is no error through the topology, store the policy, and then activate the policy and issue the policy to the device. Therefore, the scheme of the embodiment provides a visual traffic view, prevents the error strategy from being directly issued to the node equipment, and greatly reduces the possibility of human error.
EXAMPLE six
In this embodiment, the control unit of the system is additionally provided with an escape mechanism, which specifically includes the following steps: when the BGP neighbor relation between the control unit and the network equipment is interrupted, the flowspec strategy issued by the control unit automatically fails, and the network equipment still selects a path according to the IPv4 routing table; and when the BGP neighbor relation between the control unit and the network equipment is recovered, the flowspec strategy takes effect again.
The escape mechanism added to the control unit in this embodiment ensures that when communication between the control unit and the network device is lost, the traffic policy issued by the control unit can be cancelled in time, thereby avoiding confusion of network access relation caused by operation during a fault period, and ensuring that all scheduling policies are controllable.
For example, the general traffic flows run on lines a and B on average. The quality of the operator line A is unstable, and important service flow is temporarily dispatched from the line A to the line B through the flowspec. If the controller is disconnected and the policy is still in effect, at this time, the traffic peak is gradually entered, the line B cannot support the existing traffic, and the line a has a low traffic rate and a large amount of packet loss due to a low load on one line. In the design of the controller, in consideration of the emergency condition occurring during disconnection, once the controller loses the connection with the network equipment, the flowspec strategy is automatically cancelled, so that the flow can select a path through the original routing algorithm, and the network operation and maintenance personnel can be ensured to have control right on the network access relation at any time.
EXAMPLE seven
Fig. 5 is a schematic flow chart showing a traffic management method in an embodiment of the present application. The traffic management method of the present embodiment is applied to the control unit in the above embodiment, and includes step S501 and step S502.
In step S501, a flowspec traffic management policy is generated.
In step S502, queue allocation and/or bandwidth speed limitation are performed on the traffic to be transmitted according to the flowspec traffic management policy.
It should be noted that the implementation of the traffic management method is similar to that of the traffic management system, and therefore, the detailed description is omitted.
Example eight
Fig. 6 is a schematic structural diagram of another electronic terminal according to an embodiment of the present application. This example provides an electronic terminal, includes: a processor 61, a memory 62, and a communicator 63; the memory 62 is connected to the processor 61 and the communicator 63 through a system bus and completes communication with each other, the memory 62 is used for storing computer programs, the communicator 63 is used for communicating with other devices, and the processor 61 is used for operating the computer programs, so that the electronic terminal executes the steps of the traffic management method.
The above-mentioned system bus may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The system bus may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus. The communication interface is used for realizing communication between the database access device and other equipment (such as a client, a read-write library and a read-only library). The memory may include a Random Access Memory (RAM), and may further include a non-volatile memory (non-volatile memory), such as at least one disk memory.
The Processor may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; the Integrated Circuit may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, a discrete Gate or transistor logic device, or a discrete hardware component.
Example nine
In the present embodiment, a computer-readable storage medium is provided, on which a computer program is stored, which, when executed by a processor, implements the traffic management method.
Those of ordinary skill in the art will understand that: all or part of the steps for implementing the above method embodiments may be performed by hardware associated with a computer program. The aforementioned computer program may be stored in a computer readable storage medium. When executed, the program performs steps comprising the method embodiments described above; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.
To sum up, the present application provides a traffic management system, a traffic management method, an electronic terminal, and a storage medium, and the technical solution provided by the present application not only can rapidly change traffic and enter an idle queue to avoid congestion without changing local configuration, but also can meet bandwidth requirements of burst traffic with the help of local QoS configuration, and can flexibly implement traffic speed limit and guarantee bandwidth requirements of important services. In addition, the technical scheme of the application also effectively avoids the loop or the route black hole through the real-time BGP state monitoring, ensures the consistency of the back-and-forth path of the flow through a mode of issuing the strategy or the strategy group, verifies the effectiveness of the strategy issuing through synchronous configuration, prevents the strategy error through a visual flow view and the like. Therefore, the application effectively overcomes various defects in the prior art and has high industrial utilization value.
The above embodiments are merely illustrative of the principles and utilities of the present application and are not intended to limit the application. Any person skilled in the art can modify or change the above-described embodiments without departing from the spirit and scope of the present application. Accordingly, it is intended that all equivalent modifications or changes which can be made by those skilled in the art without departing from the spirit and technical concepts disclosed in the present application shall be covered by the claims of the present application.

Claims (10)

1. A traffic management system, comprising:
the control unit is used for generating a flowspec flow management strategy;
one or more node units which are accessible to the control unit in a routing way, so as to receive the flowspec traffic management strategy and perform queue distribution and/or bandwidth speed limitation on the traffic to be transmitted according to the flowspec traffic management strategy; the flowspec flow management strategy comprises the following steps: if one DSCP queue in the node unit is congested, introducing the traffic to be transmitted into other idle DSCP queues or limiting the speed of the transmission traffic entering the DSCP queues; and carrying out mark change on the traffic to be transmitted so as to change marks of the traffic to be transmitted, which correspond to the DSCP queue in the first node unit, into marks which correspond to other DSCP queues in the node unit.
2. The system of claim 1, wherein the flowspec traffic management policy comprises:
and if the DSCP queue in the node unit newly increases the traffic to be transmitted, performing speed-limiting distribution on the newly increased traffic to be transmitted so as to enable the newly increased traffic to be transmitted and the original traffic to be transmitted in the queue to perform bandwidth sharing.
3. The system of claim 1, comprising:
the control unit is further configured to determine whether the BGP neighbor is interrupted based on the BGP monitoring protocol, and revoke the activated traffic scheduling policy when determining that the BGP neighbor is interrupted.
4. The system of claim 1, comprising:
the control unit issues a single strategy to designate a certain section of wide area network traffic to be switched from an original path to a preset path; and/or
The control unit issues a strategy group to designate the whole wide area network flow to be switched from an original path to a preset path; all node units involved in the path scheduling of the traffic perform synchronous node operation.
5. The system of claim 1, further comprising:
the first control unit and the second control unit are synchronously configured;
a route reflection device;
the first control unit issues a configuration strategy to the route reflection equipment; the routing reflection equipment reflects the received configuration strategy to the second control unit; and the second control unit compares the configuration strategies received from the first control unit and the route reflection equipment, and verifies whether the configuration strategies are effectively issued to the route reflection equipment according to the compared result information.
6. The system of claim 1, further comprising:
and the visualization unit is used for creating a flow scheduling strategy effect preview mechanism so as to display the path information of the pre-constructed flow scheduling after the strategy is generated.
7. The system of claim 1, further comprising:
under the condition that the BGP neighbor relation between the control unit and the network equipment is interrupted, the flowspec flow management strategy issued by the control unit is automatically invalid, and the network equipment selects a path according to a preset routing table; and/or
And under the condition that the BGP neighbor relation between the control unit and the network equipment is recovered, the flowspec flow management strategy takes effect again.
8. A method of traffic management, comprising:
generating a flowspec flow management strategy;
performing queue distribution and/or bandwidth speed limitation on the traffic to be transmitted according to the flowspec traffic management strategy;
the flowspec flow management strategy comprises the following steps: if one DSCP queue in the node unit is congested, introducing the traffic to be transmitted into other idle DSCP queues or limiting the speed of the transmission traffic entering the DSCP queues; and carrying out mark change on the traffic to be transmitted so as to change marks of the traffic to be transmitted, which correspond to the DSCP queue in the first node unit, into marks which correspond to other DSCP queues in the node unit.
9. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the traffic management method according to claim 8.
10. An electronic terminal, comprising: a processor and a memory;
the memory is used for storing a computer program;
the processor is configured to execute the computer program stored in the memory to cause the terminal to perform the traffic management method according to claim 8.
CN201910949921.5A 2019-10-08 2019-10-08 Traffic management system, traffic management method, electronic terminal, and storage medium Expired - Fee Related CN111092824B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910949921.5A CN111092824B (en) 2019-10-08 2019-10-08 Traffic management system, traffic management method, electronic terminal, and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910949921.5A CN111092824B (en) 2019-10-08 2019-10-08 Traffic management system, traffic management method, electronic terminal, and storage medium

Publications (2)

Publication Number Publication Date
CN111092824A CN111092824A (en) 2020-05-01
CN111092824B true CN111092824B (en) 2020-12-04

Family

ID=70393017

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910949921.5A Expired - Fee Related CN111092824B (en) 2019-10-08 2019-10-08 Traffic management system, traffic management method, electronic terminal, and storage medium

Country Status (1)

Country Link
CN (1) CN111092824B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115242641B (en) * 2021-04-23 2023-12-19 奇安信科技集团股份有限公司 Method and device for previewing strategy issuing result and computer equipment
CN114389991B (en) * 2021-12-20 2023-09-29 中盈优创资讯科技有限公司 Intelligent network flow scheduling management method and device

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106789660A (en) * 2017-03-31 2017-05-31 中国科学技术大学苏州研究院 The appreciable flow managing methods of QoS in software defined network
CN108809857A (en) * 2018-05-23 2018-11-13 中国石油大学(华东) A method of the traffic monitoring based on SDN and service quality securing strategy
CN109309624A (en) * 2017-07-28 2019-02-05 中国电信股份有限公司 Traffic scheduling method and system, software defined network controller

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040264472A1 (en) * 2003-06-27 2004-12-30 Oliver Neal C. Method and system for open-loop congestion control in a system fabric

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106789660A (en) * 2017-03-31 2017-05-31 中国科学技术大学苏州研究院 The appreciable flow managing methods of QoS in software defined network
CN109309624A (en) * 2017-07-28 2019-02-05 中国电信股份有限公司 Traffic scheduling method and system, software defined network controller
CN108809857A (en) * 2018-05-23 2018-11-13 中国石油大学(华东) A method of the traffic monitoring based on SDN and service quality securing strategy

Also Published As

Publication number Publication date
CN111092824A (en) 2020-05-01

Similar Documents

Publication Publication Date Title
RU2530338C2 (en) Prepared connection based on state of communication lines of providers (plsb) with routed redundancy
JP7417825B2 (en) slice-based routing
US10341141B2 (en) Flow entry generating method and apparatus
WO2017036288A1 (en) Network element upgrading method and device
US9065768B2 (en) Apparatus for a high performance and highly available multi-controllers in a single SDN/OpenFlow network
US8909786B2 (en) Method and system for cross-stratum optimization in application-transport networks
US10587494B2 (en) Network control method and apparatus
WO2021007963A1 (en) Route distribution method and controller, information routing method and network node device
US20140280864A1 (en) Methods of Representing Software Defined Networking-Based Multiple Layer Network Topology Views
US10439879B2 (en) Bandwidth management in a non-blocking network fabric
US20110106932A1 (en) Network Management System
EP3063903A1 (en) Method and system for load balancing at a data network
EP3123677B1 (en) A method to provide elasticity in transport network virtualisation
US8320281B2 (en) Methods, systems and computer readable media for utilizing a standard spanning tree protocol to indicate an active switching fabric in a network node
US11140091B2 (en) Openflow protocol-based resource control method and system, and apparatus
CN103477612A (en) Cloud service control and management architecture expanded to interface the network stratum
EP3541028B1 (en) Adaptive load-balancing over a multi-point logical interface
US11750440B2 (en) Fast forwarding re-convergence of switch fabric multi-destination packets triggered by link failures
CN111092824B (en) Traffic management system, traffic management method, electronic terminal, and storage medium
CN109495593A (en) Address distribution method and system
JP2019532587A (en) Multicast service providing method and software-defined networking controller
WO2017197983A1 (en) Traffic processing method and system, storage medium, switch
US7864763B2 (en) Method and device for implementing layer 1 virtual private network
WO2021219049A1 (en) Information submitting method, information processing method, apparatus, and device
JP2007201840A (en) Compound information platform device and method for guaranteeing its communication band

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20201204

Termination date: 20211008