CN112491702A - Multilink intelligent scheduling method and device based on VPP router - Google Patents

Multilink intelligent scheduling method and device based on VPP router Download PDF

Info

Publication number
CN112491702A
CN112491702A CN202011285103.9A CN202011285103A CN112491702A CN 112491702 A CN112491702 A CN 112491702A CN 202011285103 A CN202011285103 A CN 202011285103A CN 112491702 A CN112491702 A CN 112491702A
Authority
CN
China
Prior art keywords
link
data
vpp
router
weighted
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.)
Pending
Application number
CN202011285103.9A
Other languages
Chinese (zh)
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.)
Vcmy Guangzhou Technology Shares Co ltd
Original Assignee
Vcmy Guangzhou Technology Shares Co ltd
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 Vcmy Guangzhou Technology Shares Co ltd filed Critical Vcmy Guangzhou Technology Shares Co ltd
Priority to CN202011285103.9A priority Critical patent/CN112491702A/en
Publication of CN112491702A publication Critical patent/CN112491702A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/24Multipath
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46Interconnection of networks
    • H04L12/4641Virtual LANs, VLANs, e.g. virtual private networks [VPN]
    • H04L12/4645Details on frame tagging
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/08Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/10Active monitoring, e.g. heartbeat, ping or trace-route
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • H04L45/123Evaluation of link metrics
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • H04L45/124Shortest path evaluation using a combination of metrics
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/50Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • H04L45/507Label distribution
    • 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/12Avoiding congestion; Recovering from congestion
    • H04L47/125Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
    • 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
    • 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/29Flow control; Congestion control using a combination of thresholds

Abstract

The application discloses a multilink intelligent scheduling method and a device based on a VPP router, wherein the method comprises the following steps: polling each WAN port, sending heartbeat packets to nodes on each link, and monitoring link information of an ISP (Internet service provider) at the WAN side, wherein the link information comprises bandwidth, time delay, jitter and packet loss parameters of the link; if the link information is smaller than the preset value, performing weighted calculation according to the link information of each link to obtain the weighted number of each link, and taking the link with the minimum weighted number as the optimal link; and balancing the data load to different links according to the ratio of the weighted number of each link to the total weighted number. Under the environment of a normal network, the flow is balanced on a plurality of outlet links in an intelligent scheduling mode, and therefore the network pressure is relieved.

Description

Multilink intelligent scheduling method and device based on VPP router
Technical Field
The present application relates to the field of network link scheduling technologies, and in particular, to a method and an apparatus for multilink intelligent scheduling based on a VPP router.
Background
A Software Defined Network (SDN) redefines a traditional network structure, and enables original network equipment to be more flexibly and conveniently located to operators and users in a network virtualization mode. And as the most important branch of the SDN, the software defined wide area network (SD-WAN) has undoubtedly important research value and application value. VPP is a good platform in SD-WAN open source, can provide production quality switch/router functions used in an open box, is an open source version of Cisco Vector Packet Processing (VPP) technology, can run on a commercial CPU, and is popular with people through verified technology, high performance, modularization, flexibility and rich function sets.
In the existing network environment, most of the enterprises at present basically adopt a master-slave mode for network links at the WAN side, that is, one link is used as a main egress link, and other links are used as backup links. This obviously has a certain disadvantage that only one of the links is used in the case of multiple links, and manual switching is required when the network fails, thereby wasting network resources and human resources.
Disclosure of Invention
The embodiment of the application provides a multilink intelligent scheduling method and device based on a VPP router, so that under the environment of a normal network, flow is balanced on a plurality of outlet links in an intelligent scheduling mode, and network pressure is relieved.
In view of the above, a first aspect of the present application provides a method for intelligent multi-link scheduling based on a VPP router, the method comprising:
polling each WAN port, sending heartbeat packets to nodes on each link, and monitoring link information of an ISP (Internet service provider) at the WAN side, wherein the link information comprises time delay, jitter and packet loss parameters of the link;
if the link information is smaller than the preset value, performing weighted calculation according to the link information of each link to obtain the weighted number of each link, and taking the link with the minimum weighted number as the optimal link;
and balancing the data load to different links according to the ratio of the weighted number of each link to the total weighted number.
Optionally, the method further includes:
if the data with special forwarding requirements exist, marking VLAN labels on the data with special forwarding requirements, and forwarding the data with the same labels through fixed links, wherein each VLAN label corresponds to a fixed link.
Optionally, the method further includes:
carrying out priority division on the traffic data of different applications;
different QOS levels are distributed to the flow data of different applications according to the priority of the data, so that when network congestion occurs, the data with high priority is transmitted preferentially.
Optionally, the method further includes:
and monitoring the bandwidth, time delay, jitter and packet loss parameters of each link at regular time, and updating the weighting number of each link.
Optionally, the method further includes:
when any link information is larger than the preset threshold value, the current link network is abnormal;
multiplying the weighting number of the abnormal link by a weight reduction factor so as to reduce the data traffic of the abnormal link, and distributing the reduced part of the data traffic to the link without network abnormality according to the proportion of the weighting number to the total weighting number.
A second aspect of the present application provides a multi-link intelligent scheduling apparatus based on a VPP router, the apparatus comprising:
the monitoring unit is used for polling each WAN port, sending heartbeat packets to nodes on each link, and monitoring link information of an ISP (Internet service provider) at the WAN side, wherein the link information comprises bandwidth, time delay, jitter and packet loss parameters of the link;
the calculation unit is used for performing weighted calculation according to the link information of each link when the link information is smaller than preset information to obtain the weighted number of each link, and taking the link with the minimum weighted number as an optimal link;
and the load balancing unit is used for balancing the data load to different links according to the ratio of the weighted number of each link to the total weighted number.
Optionally, the method further includes:
and the special data forwarding unit is used for marking the data with the special forwarding requirement with VLAN labels if the data with the special forwarding requirement exists, and forwarding the data with the same labels through fixed links, wherein each VLAN label corresponds to a fixed link.
Optionally, the method further includes:
the priority dividing unit is used for carrying out priority division on the flow data of different applications;
the distribution unit is used for distributing different QOS levels to the flow data of different applications according to the priority of the data, so that the data with high priority is transmitted preferentially when network congestion occurs.
Optionally, the method further includes:
and the monitoring updating unit is used for monitoring the bandwidth, the time delay, the jitter and the packet loss parameters of each link at regular time and updating the weighting number of each link.
Optionally, the method further includes:
the data traffic distribution unit is used for indicating that the current link network is abnormal when any link information is larger than the preset threshold value;
multiplying the weighting number of the abnormal link by a weight reduction factor so as to reduce the data traffic of the abnormal link, and distributing the reduced part of the data traffic to the link without network abnormality according to the proportion of the weighting number to the total weighting number.
According to the technical scheme, the embodiment of the application has the following advantages:
in the embodiment of the application, a multilink intelligent scheduling method based on a VPP router is provided, which comprises the following steps: polling each WAN port, sending heartbeat packets to nodes on each link, and monitoring link information of an ISP (Internet service provider) at the WAN side, wherein the link information comprises bandwidth, time delay, jitter and packet loss parameters of the link; if the link information is smaller than the preset value, performing weighted calculation according to the link information of each link to obtain the weighted number of each link, and taking the link with the minimum weighted number as the optimal link; and balancing the data load to different links according to the ratio of the weighted number of each link to the total weighted number.
The method comprises the steps of sending a heartbeat packet to a node on each link through a router of the VPP, obtaining link information of each link, distributing a weighted value to each link according to bandwidth, time delay, jitter and packet loss parameters of each link, and balancing flow data load to the corresponding link according to the proportion of the weighted value to the total weighted value.
Drawings
FIG. 1 is a flowchart of a method of one embodiment of a VPP router-based intelligent scheduling method of the present application;
FIG. 2 is a flowchart of a method of another embodiment of a VPP router-based intelligent scheduling method of the present application;
FIG. 3 is a block diagram of an embodiment of an intelligent multi-link scheduler based on VPP router according to the present application;
FIG. 4 is a diagram of a network topology including a VPP router according to the present application.
Detailed Description
In order to make the technical solutions of the present application better understood, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Fig. 1 is a flowchart of a method of an embodiment of a method for intelligent multilink scheduling based on a VPP router according to the present application, where fig. 1 includes:
101. and polling each WAN port, sending heartbeat packets to nodes on each link, and monitoring link information of an ISP (Internet service provider) at the WAN side, wherein the link information comprises bandwidth, time delay, jitter and packet loss parameters of the link.
It should be noted that, the VPP router in the present application has a probe, periodically polls each WAN port through the load balancing device, sends a heartbeat packet to a node on a link, monitors the network state of the ISP on each WAN side, obtains the bandwidth, delay, jitter, and packet loss network conditions of different links through the ICMP ECHO message, and can also determine whether a failure such as network congestion occurs according to the bandwidth, delay, jitter, and packet loss network conditions of the link.
FIG. 4 is a network topology diagram of the present application including a VPP router in which LAN devices are connected to the WAN side by connecting VPP routers.
102. And if the link information is less than the preset value, performing weighted calculation according to the link information of each link to obtain the weighted number of each link, and taking the link with the minimum weighted number as the optimal link.
It should be noted that, the present application may compare the time delay, jitter, and packet loss parameters of the link with a preset threshold, so as to determine whether the link is abnormal; and performing weighting calculation according to the parameters of the bandwidth, the time delay, the packet loss and the jitter of each link to obtain the weighting number of each link, and obtaining the network state of each link according to the weighting number of the link. And selecting the link with the minimum weighting number as the optimal link.
103. And balancing the data load to different links according to the ratio of the weighted number of each link to the total weighted number.
It should be noted that, the present application can perform load balancing distribution on the data packets once according to the weighted value of each link, thereby improving the utilization rate of the multilinks, reducing the transmission pressure of the multilinks, and further ensuring the stability of the multilinks.
The method comprises the steps of sending a heartbeat packet to a node on each link through a router of the VPP, obtaining link information of each link, distributing a weighted value to each link according to bandwidth, time delay, jitter and packet loss parameters of each link, and balancing flow data load to the corresponding link according to the proportion of the weighted value to the total weighted value.
The present application further provides another embodiment of a multilink intelligent scheduling method based on a VPP router, as shown in fig. 2, where fig. 2 includes:
201. and polling each WAN port, sending heartbeat packets to nodes on each link, and monitoring link information of an ISP (Internet service provider) at the WAN side, wherein the link information comprises time delay, jitter and packet loss parameters of the link.
202. And judging whether the link is normal or not according to the link information, if so, performing weighted calculation according to the link information of each link to obtain the weighted number of each normal link, and taking the normal link with the minimum weighted number as the optimal link.
It should be noted that, according to the present application, whether a link is normal may be determined according to link information, specifically, time delay, jitter, and packet loss parameters of the link are compared with preset thresholds, and if the time delay, jitter, and packet loss parameters of the link are all smaller than the corresponding time delay threshold, jitter threshold, and packet loss threshold, the link is determined to be a normal link. And performing weighting calculation on all normal links to obtain the weighting number of each normal link, and taking the normal link with the minimum weighting number as the optimal link.
For example, the delay, packet loss and jitter of the PING message can be directly obtained according to the PING message of the ICMP, such as a PING hundred-degree process. It can be obtained that the packet loss is 0, the jitter is 2.58ms, and the delay is 5.711ms, and under the same bandwidth condition, the smaller these data are, the better the network state is represented. Here, corresponding thresholds may be set, for example, the packet loss threshold is 50%, the jitter threshold is 10ms, and the delay threshold is 20ms, where exceeding the threshold represents a network anomaly.
The links with abnormal network can be directly excluded, and the optimal link is selected from the links with normal network, for example, A, C, D links are normal, and for convenience of calculation, the packet loss is assumed to be lossA-0, lossC-0, and lossD-20%; the jitter value is mdevA being 2ms, mdevC being 1ms, and mdevD being 3 ms; the delay has the value avqA 5ms, avqC 5ms, and avqD 6 ms.
In one specific embodiment, the weighting formula may be:
the link A weight is: (0 × 1+2 × 1+5 × 1)/(1+1+1) ═ 7/3 ═ 2.33333
The link C weight is: (0 × 1+1+ 5 × 1)/(1+1+1) ═ 6/3 ═ 2
The link D weight is: (0.2 × 1+3 × 1+6 × 1)/(1+1+1) ═ 9.2/3 ═ 3.6666
The weight of the C link can be obtained to be the minimum, that is, the C link is the optimal link.
203. If the data with special forwarding requirements exist, marking the data with the special forwarding requirements with VLAN labels, and forwarding the data with the same labels through fixed links, wherein each VLAN label corresponds to a fixed link.
For data with special forwarding requirements, for example, for confidential data traffic of corporate financial business and the like, the data with the special forwarding requirements may be VLAN tagged, that is, corporate financial data may be VLAN100 tagged, and all data with VLAN100 tags may be transmitted from the same link, for example, the data with VLAN100 tags may be transmitted through a dedicated line. For large-flow data such as audio and video conferences, VLAN200 tags are marked, and all data with the VLAN200 tags are transmitted through an ISP1 link.
204. Carrying out priority division on the traffic data of different applications; different QOS levels are distributed to the flow data of different applications according to the priority of the data, so that when network congestion occurs, the data with high priority is transmitted preferentially.
It should be noted that, in the present application, the quality of service (QOS) technology is combined to prioritize traffic of different applications, so that when a link is blocked by a network, priority transmission of important data can be ensured. For example, for data with larger bandwidth and higher network quality requirement, such as an online conference, the QOS level of the data is set to be high, and the QOS level of the data for general mail chat is set to be low, so that the priority of the data for different applications can be specifically set according to the requirements of the user. Therefore, under the condition of unstable network congestion, the flow of the service with higher priority can be guaranteed to be forwarded preferentially, for example, the data of a video conference is transmitted preferentially, and the chat data of the common mail is transmitted after being delayed, so that the important service is guaranteed to be performed preferentially.
205. And balancing the data load to different links according to the ratio of the weighted number of each link to the total weighted number.
It should be noted that, when there is data required for special forwarding or prioritized data, data of the same label is forwarded through a fixed link, or data with high priority is transmitted according to priority. And if the data with special forwarding requirements does not exist or the data with priority division exists, balancing the data load to different links according to the ratio of the weighted number of each normal link to the total weighted number.
In a specific implementation manner, the present application may also monitor bandwidth, delay, jitter, and packet loss parameters of each link at regular time, and update the weighting number of each link.
206. And judging whether the link is normal or not according to the link information, if the link is abnormal, multiplying the weighting number of the abnormal link by a weight reduction factor to reduce the data traffic of the abnormal link, and distributing the reduced partial data traffic to the link without the network abnormality according to the proportion of the weighting number to the total weighting number.
It should be noted that, when the delay, jitter, and packet loss parameters of the link are all greater than the corresponding delay threshold, jitter threshold, and packet loss threshold, the link is determined to be an abnormal link. Therefore, if the data sent to the abnormal link needs to be reduced, the weighting number of the abnormal link may be multiplied by the weight reduction factor, so as to reduce the data traffic of the abnormal link, and the reduced partial data traffic may be distributed to the normal link according to the proportion of the weighting number of the normal link to the total weighting number of the normal link. And by monitoring the link information of each link in real time, when the link returns to normal, the distributed data flow is redistributed to the original link.
The method comprises the steps of sending a heartbeat packet to a node on each link through a router of the VPP, obtaining link information of each link, distributing a weighted value to each link according to bandwidth, time delay, jitter and packet loss parameters of each link, and balancing flow data load to the corresponding link according to the proportion of the weighted value to the total weighted value. Through identifying different application data, marking VLAN labels on data with special forwarding requirements, forwarding the data marked with the same labels through a fixed link, and performing priority division according to data importance, the method and the device can intelligently schedule the traffic of different services or different services to different outlets; and the network congestion can be reduced by reducing the data traffic of the abnormal link and distributing the reduced part of the data traffic to the link without network abnormality according to the proportion of the weighted number to the total weighted number.
The foregoing is an embodiment of the method of the present application, and the present application further includes an embodiment of a multi-link intelligent scheduling apparatus based on a VPP router, as shown in fig. 3, where fig. 3 includes:
a monitoring unit 301, configured to poll each WAN port, send a heartbeat packet to a node on each link, and monitor link information of an ISP on the WAN side, where the link information includes bandwidth, time delay, jitter, and packet loss parameters of the link;
a calculating unit 302, configured to perform weighting calculation according to the link information of each link when the link information is smaller than a preset value, to obtain a weight of each link, and use the link with the smallest weight as the optimal link.
And the load balancing unit 303 is configured to balance the data load to different links according to a ratio of the weighted number of each link to the total weighted number.
In a specific embodiment, the method further comprises the following steps:
and the special data forwarding unit is used for marking the data with the special forwarding requirement with VLAN labels if the data with the special forwarding requirement exists, and forwarding the data with the same labels through fixed links, wherein each VLAN label corresponds to a fixed link.
The priority dividing unit is used for carrying out priority division on the flow data of different applications;
the distribution unit is used for distributing different QOS levels to the flow data of different applications according to the priority of the data, so that the data with high priority is transmitted preferentially when network congestion occurs.
And the monitoring updating unit is used for monitoring the bandwidth, the time delay, the jitter and the packet loss parameters of each link at regular time and updating the weighting number of each link.
The data traffic distribution unit is used for indicating that the current link network is abnormal when any link information is larger than a preset threshold value;
and multiplying the weighting number of the abnormal link by a weight reduction factor so as to reduce the data traffic of the abnormal link, and distributing the reduced partial data traffic to the link without the network abnormality according to the proportion of the weighting number to the total weighting number.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
The terms "comprises," "comprising," and any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
It should be understood that in the present application, "at least one" means one or more, "a plurality" means two or more. "and/or" for describing an association relationship of associated objects, indicating that there may be three relationships, e.g., "a and/or B" may indicate: only A, only B and both A and B are present, wherein A and B may be singular or plural. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of single item(s) or plural items. For example, at least one (one) of a, b, or c, may represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", wherein a, b, c may be single or plural.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The above embodiments are only used for illustrating the technical solutions of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions in the embodiments of the present application.

Claims (10)

1. A multilink intelligent scheduling method based on a VPP router is characterized by comprising the following steps:
polling each WAN port, sending heartbeat packets to nodes on each link, and monitoring link information of an ISP (Internet service provider) at the WAN side, wherein the link information comprises time delay, jitter and packet loss parameters of the link;
if the link information is smaller than the preset value, performing weighted calculation according to the link information of each link to obtain the weighted number of each link, and taking the link with the minimum weighted number as the optimal link;
and balancing the data load to different links according to the ratio of the weighted number of each link to the total weighted number.
2. The intelligent multi-link scheduling method based on VPP router of claim 1, further comprising:
if the data with special forwarding requirements exist, marking VLAN labels on the data with special forwarding requirements, and forwarding the data with the same labels through fixed links, wherein each VLAN label corresponds to a fixed link.
3. The intelligent multi-link scheduling method based on VPP router of claim 1, further comprising:
carrying out priority division on the traffic data of different applications;
different QOS levels are distributed to the flow data of different applications according to the priority of the data, so that when network congestion occurs, the data with high priority is transmitted preferentially.
4. The intelligent multi-link scheduling method based on VPP router of claim 1, further comprising:
and monitoring the bandwidth, time delay, jitter and packet loss parameters of each link at regular time, and updating the weighting number of each link.
5. The intelligent multi-link scheduling method based on VPP router of claim 1, further comprising:
when any link information is larger than the preset threshold value, the current link network is abnormal;
multiplying the weighting number of the abnormal link by a weight reduction factor so as to reduce the data traffic of the abnormal link, and distributing the reduced part of the data traffic to the link without network abnormality according to the proportion of the weighting number to the total weighting number.
6. A multilink intelligent scheduling device based on VPP router, comprising:
the monitoring unit is used for polling each WAN port, sending heartbeat packets to nodes on each link, and monitoring link information of an ISP (Internet service provider) at the WAN side, wherein the link information comprises bandwidth, time delay, jitter and packet loss parameters of the link;
the calculation unit is used for performing weighted calculation according to the link information of each link when the link information is smaller than preset information to obtain the weighted number of each link, and taking the link with the minimum weighted number as an optimal link;
and the load balancing unit is used for balancing the data load to different links according to the ratio of the weighted number of each link to the total weighted number.
7. The intelligent multi-link VPP router-based scheduling apparatus of claim 6, further comprising:
and the special data forwarding unit is used for marking the data with the special forwarding requirement with VLAN labels if the data with the special forwarding requirement exists, and forwarding the data with the same labels through fixed links, wherein each VLAN label corresponds to a fixed link.
8. The intelligent multi-link VPP router-based scheduling apparatus of claim 6, further comprising:
the priority dividing unit is used for carrying out priority division on the flow data of different applications;
the distribution unit is used for distributing different QOS levels to the flow data of different applications according to the priority of the data, so that the data with high priority is transmitted preferentially when network congestion occurs.
9. The intelligent multi-link VPP router-based scheduling apparatus of claim 6, further comprising:
and the monitoring updating unit is used for monitoring the bandwidth, the time delay, the jitter and the packet loss parameters of each link at regular time and updating the weighting number of each link.
10. The intelligent multi-link VPP router-based scheduling apparatus of claim 6, further comprising:
the data traffic distribution unit is used for indicating that the current link network is abnormal when any link information is larger than the preset threshold value;
multiplying the weighting number of the abnormal link by a weight reduction factor so as to reduce the data traffic of the abnormal link, and distributing the reduced part of the data traffic to the link without network abnormality according to the proportion of the weighting number to the total weighting number.
CN202011285103.9A 2020-11-17 2020-11-17 Multilink intelligent scheduling method and device based on VPP router Pending CN112491702A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011285103.9A CN112491702A (en) 2020-11-17 2020-11-17 Multilink intelligent scheduling method and device based on VPP router

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011285103.9A CN112491702A (en) 2020-11-17 2020-11-17 Multilink intelligent scheduling method and device based on VPP router

Publications (1)

Publication Number Publication Date
CN112491702A true CN112491702A (en) 2021-03-12

Family

ID=74930903

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011285103.9A Pending CN112491702A (en) 2020-11-17 2020-11-17 Multilink intelligent scheduling method and device based on VPP router

Country Status (1)

Country Link
CN (1) CN112491702A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113452723A (en) * 2021-08-31 2021-09-28 深圳鼎信通达股份有限公司 Voice processing method, device and storage medium
CN113542051A (en) * 2021-05-27 2021-10-22 贵州电网有限责任公司 Monitoring flow load balancing method based on software defined network
CN113660163A (en) * 2021-08-18 2021-11-16 奇安信科技集团股份有限公司 Internet path selection method and device
CN115550242A (en) * 2022-11-29 2022-12-30 北京天维信通科技有限公司 Communication link selection method, system, equipment and readable storage medium
CN116668359A (en) * 2023-07-31 2023-08-29 杭州网鼎科技有限公司 Intelligent non-inductive switching method, system and storage medium for network paths

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102006221A (en) * 2010-09-30 2011-04-06 北京交通大学 Method for optimizing quality of service of stream media
CN103297341A (en) * 2013-07-04 2013-09-11 清华大学 Method for configuring flow on nodes of internal router
CN104869076A (en) * 2014-02-24 2015-08-26 中兴通讯股份有限公司 Load balance adjusting method and device
CN106998302A (en) * 2016-01-26 2017-08-01 华为技术有限公司 The distribution method and device of a kind of service traffics

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102006221A (en) * 2010-09-30 2011-04-06 北京交通大学 Method for optimizing quality of service of stream media
CN103297341A (en) * 2013-07-04 2013-09-11 清华大学 Method for configuring flow on nodes of internal router
CN104869076A (en) * 2014-02-24 2015-08-26 中兴通讯股份有限公司 Load balance adjusting method and device
CN106998302A (en) * 2016-01-26 2017-08-01 华为技术有限公司 The distribution method and device of a kind of service traffics

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113542051A (en) * 2021-05-27 2021-10-22 贵州电网有限责任公司 Monitoring flow load balancing method based on software defined network
CN113542051B (en) * 2021-05-27 2022-08-30 贵州电网有限责任公司 Monitoring flow load balancing method based on software defined network
CN113660163A (en) * 2021-08-18 2021-11-16 奇安信科技集团股份有限公司 Internet path selection method and device
CN113452723A (en) * 2021-08-31 2021-09-28 深圳鼎信通达股份有限公司 Voice processing method, device and storage medium
CN115550242A (en) * 2022-11-29 2022-12-30 北京天维信通科技有限公司 Communication link selection method, system, equipment and readable storage medium
CN115550242B (en) * 2022-11-29 2023-04-11 北京天维信通科技有限公司 Communication link selection method, system, equipment and readable storage medium
CN116668359A (en) * 2023-07-31 2023-08-29 杭州网鼎科技有限公司 Intelligent non-inductive switching method, system and storage medium for network paths
CN116668359B (en) * 2023-07-31 2023-10-10 杭州网鼎科技有限公司 Intelligent non-inductive switching method, system and storage medium for network paths

Similar Documents

Publication Publication Date Title
CN112491702A (en) Multilink intelligent scheduling method and device based on VPP router
CN114073052B (en) Systems, methods, and computer readable media for slice-based routing
Zhang et al. Load balancing in data center networks: A survey
US8750117B2 (en) Dynamic service-aware flow control in packet networks
US20110019572A1 (en) Method and apparatus for shared shaping
US8520534B2 (en) In-service throughput testing in distributed router/switch architectures
US20150103652A1 (en) Configuring traffic allocations in a router
CN108337184A (en) Flow equalization dispatching method and device
Wang et al. Control link load balancing and low delay route deployment for software defined networks
Bakhshi et al. User-centric traffic optimization in residential software defined networks
KR20180122513A (en) Method and framework for traffic engineering in network hypervisor of sdn-based network virtualization platform
Nedyalkov et al. Modeling of the convergence time of an IP-based network with different traffic loads
CN110838986A (en) Method, equipment and system for balancing LACP load
CN116319565A (en) Load balancing system, method, equipment and storage medium based on online computing
Mirjalily et al. Best multiple spanning tree in metro ethernet networks
Domzal et al. The cross-protect router: implementation tests and opportunities
CN114389915A (en) Cloud VPN management optimization method and system based on oscillation suppression
Mirjalily et al. An approach to select the best spanning tree in Metro Ethernet networks
Benito et al. Extending commodity OpenFlow switches for large-scale HPC deployments
Kassim et al. Adaptive Policing Algorithms on inbound internet traffic using Generalized Pareto model
Heise et al. Self-configuring real-time communication network based on OpenFlow
Adomnicăi Routing protocols behaviour under bandwidth limitation
Domżał et al. Click-based tests of QoS mechanisms for flow-based router
Zhanikeev The switchboard optimization problem and heuristics for cut-through networking
Wette et al. HybridTE: traffic engineering for very low-cost software-defined data-center networks

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20210312

RJ01 Rejection of invention patent application after publication