CN115037680B - SASE-oriented flow routing method and system - Google Patents
SASE-oriented flow routing method and system Download PDFInfo
- Publication number
- CN115037680B CN115037680B CN202210437934.6A CN202210437934A CN115037680B CN 115037680 B CN115037680 B CN 115037680B CN 202210437934 A CN202210437934 A CN 202210437934A CN 115037680 B CN115037680 B CN 115037680B
- Authority
- CN
- China
- Prior art keywords
- traffic
- link
- algorithm
- bandwidth
- path
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/302—Route determination based on requested QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2441—Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Abstract
A SASE-oriented flow routing method and system, which comprises obtaining flow service quality classification information; the method comprises the steps of obtaining link state information, operating a routing algorithm on the classified information of the traffic service quality and the link state information to obtain a traffic forwarding path, solving the technical problems of low efficiency and poor safety of the existing path selection method, and the path generated by the method considers the specific requirements of traffic flow on the service quality, improves the utilization rate of network bandwidth, and can be widely applied to the field of big data processing.
Description
Technical Field
The application relates to the field of big data processing, in particular to a SASE-oriented flow routing method and system.
Background
With the rapid development of various internet technologies, the number of network users is increased, and the short boards with complex structure, lack of expandability and flexibility, poor application service sensitivity and the like of the existing network architecture are more obvious. In this case, a Software Defined Network (SDN) has been developed by the university of stenford, which concept is to separate the forwarding plane from the control plane and to hand over control to a software controller with programmable capabilities; the message forwarding of the traditional network is distributed and controlled independently one by one, the software defined network separates the control surfaces of each device and is concentrated together to form a controller, the controller issues unified instructions to manage all devices, forwarding rules are also provided by the controller, network operation is greatly simplified and network performance is improved while hardware tasks are simplified, services formed by applying SDN to a wide area network scene are SDWAN (software defined network) which is a key component of a SASE (secure access service edge) platform, and the SASE expands the SDWAN for delivering aggregated enterprise network and security services from distributed cloud services.
The traditional forwarding paths are all obtained through network protocol calculation, so that the actually selected paths, the congestion degree of the paths and the like are difficult to perceive, better path information is difficult to obtain, rapid path exchange is realized, the service quality requirement of the data flow is difficult to meet, meanwhile, the configuration of the traditional network is difficult, a large amount of manual configuration is required, the deployment efficiency of new service is quite low, and the security of the service flow is difficult to effectively protect.
Disclosure of Invention
The application aims to provide a SASE-oriented flow routing method and system, and aims to solve the technical problems of low efficiency and poor safety of the traditional path selection method.
A first aspect of an embodiment of the present application provides a SASE-oriented traffic routing method, which includes:
acquiring flow service quality classification information;
and acquiring link state information, and running a routing algorithm on the traffic quality of service classification information and the link state information to obtain a traffic forwarding path.
Preferably, obtaining traffic quality of service classification information includes:
acquiring a link state attribute of unknown forwarding path traffic;
constructing a classification discriminator;
and classifying the unknown forwarding path traffic to obtain the traffic service quality classification information.
Preferably, the obtaining the link state attribute of the unknown forwarding path traffic specifically includes the following contents:
the service quality level and the corresponding bandwidth, time delay and packet loss rate.
Preferably, the classification discriminator is constructed, in particular by:
capturing a data packet according to a source address, a destination address and service quality to obtain a data set with a label, and carrying out data enhancement on the data set by generating an countermeasure network to obtain a data set data1; and grabbing the data packet according to the source address and the destination address to obtain a data set data2, and obtaining a classification discriminator to classify.
Preferably, the data set data1 and the data set data2 are processed, specifically by the following modes:
respectively training a k nearest neighbor classification model and a convolutional neural network classification model by using a data set data1 to obtain a preliminary model, and simultaneously calculating the respective accuracy rates; for each data in the data set data2, if the type labels predicted by the two models are consistent, the data are marked with the predicted labels and put into data1, and if the type labels are inconsistent, the data are marked with the model predicted labels with higher accuracy and put into data1; and repeating the process until no data exists in the data2, and obtaining the classification discriminator.
Preferably, the routing algorithm is specifically implemented in the following manner:
(1) For all L C ∈S 1 Recording the flow Q with minimum occupied bandwidth min Including the bandwidth size T used min ；
(2) Taking the residual bandwidth as an index, and S 1 The links in the list are ordered, and the link with the largest residual bandwidth between the source address and the destination address is selected and used as a default path;
(3) Will S 1 、S 2 Carrying out data standardization processing;
(4) For a certain Q r ∈S 2 And all L r ∈S 1 Obtaining the top k link set P nearest to the data according to the data standardization processing result 1 ；
(5) Will P 1 Link-down in (a)The residual bandwidths are arranged in ascending order, at this time P 1 ＝{X 1 ,X 2 ,…,X k From link X with minimum residual bandwidth 1 Initially, the current link residual bandwidth sur and the minimum bandwidth traffic Q thereon min Bandwidth size T of (2) min And Q is equal to r Required bandwidth R r1 Comparing, and updating the related information of the traffic occupying the minimum bandwidth on the path to be Q min Running the algorithm until the algorithm is finished;
wherein L is C For the actual link, S 1 ＝{L 1 ,L 2 … is the actual set of links between the existing source and destination addresses, S 2 ＝{Q 1 ,Q 2 … is a set of categories of traffic to be routed.
Preferably, in step (3), S 1 、S 2 The data standardization processing is carried out by the following steps:
for a pair ofFor->
Preferably, step (4) is specifically implemented by:
for a certain Q r ∈S 2 And all L r ∈S 1 Respectively calculating according to the data standardization processing resultAnd ordering them to obtain the nearest top k link set P 1 Wherein->For P 1 There are three cases:
if P 1 If the traffic is empty, the algorithm outputs a default path, and updates the traffic Q occupying the minimum bandwidth on the default path min The algorithm is ended after the related information of (2);
if P 1 One link is provided, the algorithm outputs the link, and the flow Q occupying the minimum bandwidth on the path is updated min The algorithm is ended after the related information of (2);
if P 1 More than one link, the algorithm continues.
Preferably, step (5) is specifically implemented by:
a: for the current link residual bandwidth sur and minimum bandwidth traffic Q above it min Bandwidth size T of (2) min Consider Q r Required bandwidth R r1 Corresponding to B, C, D three cases:
b: if R is r1 The algorithm outputs the link, and the algorithm is finished after updating the related information of the flow occupying the minimum bandwidth on the path;
c: if R is r1 >sur is simultaneously R r1 ≤sur+T min Will Q min Removing from the link, outputting the link by algorithm, updating the related information of the traffic occupying the minimum bandwidth on the path to Q min Running the algorithm until the algorithm is finished;
d: if R is r1 >sur+T min And the current link is not X k Let the link be P 1 The next link after the current link is positioned in the middle, and then the step A is returned to; if R is r1 >sur+T min And the current link is X k The algorithm outputs a default path and updates the flow Q occupying the minimum bandwidth on the default path min After which the algorithm ends.
A second aspect of the present application provides a SASE-oriented traffic routing system, comprising:
and a flow classification module: the method is used for acquiring flow service quality classification information;
the path generation module: and the method is used for acquiring link state information, and running a routing algorithm on the traffic service quality classification information and the link state information to obtain a traffic forwarding path.
The application divides the service quality into different grades through the flow classifying module, obtains the flow service quality classifier through training, classifies the data flow to be forwarded according to the service quality, and runs the routing algorithm to obtain the paths meeting the conditions to meet the requirements of different service flows because the service quality of different grades has different specific requirements on the network link, so that the requirements of the service quality and the actual condition of the link are considered; the design scheme of the application sets the requirements of different types of service quality on links, classifies unknown forwarding path flow in the SASE network, determines the requirements of the unknown forwarding path flow on the links, and obtains the final forwarding path through a routing algorithm, thereby solving the problems that the traditional routing algorithm only considers the minimum hop count and does not consider the specific requirements of the application service flow on the service quality, and the paths generated by the application consider the specific requirements of the service flow on the service quality, and simultaneously improve the utilization rate of network bandwidth.
Drawings
Fig. 1 is a schematic flow chart of a SASE-oriented flow routing method according to an embodiment of the present application;
FIG. 2 is a flow chart of acquiring quality of service class information for a traffic according to the embodiment shown in FIG. 1;
FIG. 3 is a schematic flow chart of constructing a classification discriminator according to the embodiment shown in FIG. 2;
FIG. 4 is a flow chart of a routing algorithm according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a SASE-oriented flow routing system according to an embodiment of the present application.
Detailed Description
In order to make the technical problems, technical schemes and beneficial effects to be solved more clear, the application is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application.
It should be noted that, the positional or positional relationship indicated by the terms such as "upper", "lower", "inner", "outer", "top", "bottom", etc. are based on the positional or positional relationship shown in the drawings, and are merely for convenience of describing the present application and simplifying the description, and are not to be construed as indicating or implying that the apparatus or element in question must be provided with a specific orientation, be configured and operated in a specific orientation, and therefore should not be construed as limiting the present application.
Referring to fig. 1, a flow chart of a SASE-oriented flow routing method according to an embodiment of the present application is shown, for convenience of explanation, only the portions related to the embodiment are shown, and the details are as follows:
in one embodiment, a SASE-oriented traffic routing method includes:
s101, acquiring flow service quality classification information.
Specifically, obtaining traffic quality of service classification information includes the following steps:
referring to fig. 2, a flow chart for obtaining flow quality of service classification information according to an embodiment of the present application is shown, for convenience of explanation, only the portions related to the embodiment are shown, and the details are as follows:
s1011, obtaining the link state attribute of the unknown forwarding path flow.
The link state attribute of the unknown forwarding path traffic specifically includes: the service quality level and the corresponding bandwidth, time delay, packet loss rate and the like are used for classifying the service quality according to different requirements of different businesses on the network bandwidth, time delay and other services.
S1012, constructing a classification discriminator.
Referring to fig. 3, a flow chart for constructing a classification discriminator according to an embodiment of the application is shown only in the parts related to the embodiment for convenience of explanation, and is described in detail as follows:
capturing a data packet according to a source address, a destination address and service quality, marking a class label corresponding to the data packet to obtain a labeled data set, and carrying out data enhancement on the data set by generating an countermeasure network to obtain a data set data1; in addition, capturing data packets according to the source address and the destination address, wherein the data do not have category labels and are used as a data set data2; respectively training a k nearest neighbor classification model and a convolutional neural network classification model by using a data set data1 to obtain a preliminary model, and simultaneously calculating the respective accuracy rates; for each data in the data set data2, if the type labels predicted by the two models are consistent, the data is marked with the predicted label and put into data1, and if the type labels predicted by the two models are inconsistent, the model with higher marking accuracy is marked with the predicted label and put into data 1. This process is repeated until there is no data in data2, at which point a classification discriminator is obtained.
S1013, classifying the unknown forwarding path flow to obtain flow service quality classification information.
And classifying the unknown forwarding path traffic by an allocation discriminator to obtain traffic quality of service classification information.
S102, acquiring link state information, and running a routing algorithm on the flow service quality classification information and the link state information to obtain a flow forwarding path.
Referring to fig. 4, a flow chart of a routing algorithm provided in an embodiment of the present application is shown, for convenience of explanation, only the portions related to the embodiment are shown in detail as follows:
specifically, the link state information may be obtained directly from the controller, running a routing algorithm based on the source and destination addresses of unknown traffic, wherein the QS 1, QS 2 ,…,QS n Is the n quality of service classes divided in 1, QS i ＝{QS i1 ，QS i2 ，QS i3 ，…,QS im Is QS i And the requirements on m indexes such as network bandwidth, time delay, packet loss rate and the like are met. R is R c ＝{R c1 ，R c2 ，R c3 ,……R cm Is the actual link L C Residual bandwidth, time delay, packet loss rate, etc. and QS of (a) i Corresponding indexes. S is S 1 ＝{L 1 ,L 2 … is the actual set of links between existing source and destination addresses, S 2 ＝{Q 1 ,Q 2 … is a set of categories of traffic to be routed; the routing algorithm is specifically realized by the following modes:
(1) For all L C ∈S 1 Recording the flow Q with minimum occupied bandwidth min Including the bandwidth size T used min ；
(2) The remaining bandwidth is used as an index of the remaining bandwidth,will S 1 The links in the list are ordered, and the link with the largest residual bandwidth between the source address and the destination address is selected and used as a default path;
(3) Will S 1 、S 2 And (3) carrying out data standardization processing:
for a pair ofFor->
(4) For a certain Q r ∈S 2 And all L r ∈S 1 Respectively calculating according to the data standardization processing resultAnd ordering them to obtain the nearest top k link set P 1 Wherein->For P 1 There are three cases:
i: if P 1 If the traffic is empty, the algorithm outputs a default path, and updates the traffic Q occupying the minimum bandwidth on the default path min The algorithm is ended after the related information of (2);
ii: if P 1 One link is provided, the algorithm outputs the link, and the flow Q occupying the minimum bandwidth on the path is updated min The algorithm is ended after the related information of (2);
iii: if P 1 More than one link is in, and the algorithm continues;
(5) Will P 1 The links in (a) are arranged in ascending order of the residual bandwidth, at this time P 1 ＝{X 1 ,X 2 ,…,X k From link X with minimum residual bandwidth 1 Initially, the following procedure is performed:
a: for the current link residual bandwidth sur and minimum bandwidth traffic Q above it min Bandwidth size T of (2) min Consider Q r Required bandwidth R r1 Corresponding to B, C, D three cases:
b: if R is r1 The algorithm outputs the link, and the algorithm is finished after updating the related information of the flow occupying the minimum bandwidth on the path;
c: if R is r1 >sur is simultaneously R r1 ≤sur+T min Will Q min Removing from the link, outputting the link by algorithm, updating the related information of the traffic occupying the minimum bandwidth on the path to Q min Running the algorithm until the algorithm is finished;
d: if R is r1 >sur+T min And the current link is not X k Let the link be P 1 The next link after the current link is positioned in the middle, and then the step A is returned to; if R is r1 >sur+T min And the current link is X k The algorithm outputs a default path and updates the flow Q occupying the minimum bandwidth on the default path min After which the algorithm ends.
A second aspect of the present application provides a SASE-oriented traffic routing system, comprising:
referring to fig. 5, a schematic structural diagram of a SASE-oriented flow routing system according to an embodiment of the present application is shown, for convenience of explanation, only the portions related to the embodiment are shown in detail as follows:
in one embodiment, a SASE-oriented traffic routing system includes a traffic classification module 100, and a path generation module 200.
Specifically, by the characteristics of the SASE network, after the forwarding plane receives the data packet, the forwarding plane analyzes the data packet and matches the data packet with the flow table, and if the data packet is mismatched, the related information is reported to the controller.
The flow classification module 100 obtains complete information of an unknown forwarding path data packet from the controller, preprocesses the data, extracts features, transmits the data to the classification discriminator for quality of service class prediction, and transmits flow quality of service classification information to the path generation module 200.
The path generating module 200 obtains the unknown traffic quality of service classification information from the traffic classifying module 100, obtains the link state information from the controller, and operates the routing algorithm according to the source address and the destination address of the unknown traffic to obtain the traffic forwarding path, and the controller updates the flow table according to the path information and simultaneously issues the flow table to the forwarding plane, and the forwarding plane completes the forwarding operation according to the new flow table.
It should be noted that, in this embodiment, a SASE-oriented traffic routing system is an embodiment of a traffic routing system corresponding to the SASE-oriented traffic routing method, so for the specific implementation of the software method in each module of the traffic routing system, reference may be made to the embodiments of fig. 1-4, and detailed descriptions thereof are omitted herein.
According to the SASE-oriented flow routing method and system provided by the embodiment of the application, the service quality is divided into different grades through the flow classification module, the flow service quality classifier is obtained through training, the data flow to be forwarded is classified according to the service quality, and as the specific requirements of the service quality of different grades on the network link are different, the service quality requirement and the actual condition of the link are considered, a routing algorithm is operated to obtain a path meeting the conditions so as to meet the requirements of different service flows; the design scheme of the application sets the requirements of different types of service quality on links, classifies unknown forwarding path flow in the SASE network, determines the requirements of the unknown forwarding path flow on the links, and obtains the final forwarding path through a routing algorithm, thereby solving the problems that the traditional routing algorithm only considers the minimum hop count and does not consider the specific requirements of the application service flow on the service quality, and the paths generated by the application consider the specific requirements of the service flow on the service quality, and simultaneously improve the utilization rate of network bandwidth.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The above embodiments are only for illustrating the technical solution of the present application, and not for limiting the same; although the application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present application, and are intended to be included in the scope of the present application.
Claims (6)
1. A SASE-oriented traffic routing method, comprising:
acquiring flow service quality classification information;
acquiring link state information, and running a routing algorithm on the traffic quality of service classification information and the link state information to obtain a traffic forwarding path;
the routing algorithm is specifically realized by the following steps:
(1) For all L C ∈S 1 Recording the flow Q with minimum occupied bandwidth min Including the bandwidth size T used min ；
(2) Taking the residual bandwidth as an index, and S 1 The links in the list are ordered, and the link with the largest residual bandwidth between the source address and the destination address is selected and used as a default path;
(3) Will S 1 、S 2 And (3) carrying out data standardization processing:
for L t ∈S 1 ,For Q t ∈S 2 ,/>
(4) For a certain Q r ∈S 2 And all L r ∈S 1 Respectively calculating according to the data standardization processing resultAnd ordering them to obtain the nearest top k link set P 1 Wherein->For P 1 There are three cases:
if P 1 If the traffic is empty, the algorithm outputs a default path, and updates the traffic Q occupying the minimum bandwidth on the default path min The algorithm is ended after the related information of (2);
if P 1 One link is provided, the algorithm outputs the link, and the flow Q occupying the minimum bandwidth on the path is updated min The algorithm is ended after the related information of (2);
if P 1 More than one link is in, and the algorithm continues;
(5) Will P 1 The links in (a) are arranged in ascending order of the residual bandwidth, at this time P 1 ＝{X 1 ,X 2 ,…,X k From link X with minimum residual bandwidth 1 Initially, the current link residual bandwidth sur and the minimum bandwidth traffic Q thereon min Bandwidth size T of (2) min And Q is equal to r Required bandwidth R r1 Comparing, and updating the related information of the traffic occupying the minimum bandwidth on the path to be Q min Running the algorithm until the algorithm is finished;
a: for the current link residual bandwidth sur and minimum bandwidth traffic Q above it min Bandwidth size T of (2) min Consider Q r Required bandwidth R r1 Corresponding to B, C, D three cases:
b: if R is r1 The algorithm outputs the link, and the algorithm is finished after updating the related information of the flow occupying the minimum bandwidth on the path;
c: if R is r1 >sur is simultaneously R r1 ≤sur+T min Will Q min Removing from the link, outputting the link by algorithm, updating the related information of the traffic occupying the minimum bandwidth on the path to Q min Running the algorithm until the algorithm is finished;
d: if R is r1 >sur+T min And the current link is not X k Let the link be P 1 The next link after the current link is positioned in the middle, and then the step A is returned to; if R is r1 >sur+T min And the current link is X k The algorithm outputs a default path and updates the flow Q occupying the minimum bandwidth on the default path min The algorithm is ended after the related information of (2);
wherein L is C For the actual link, S 1 ＝{L 1 ,L 2 … is the actual set of links between the existing source and destination addresses, S 2 ＝{Q 1 ,Q 2 … is a set of categories of traffic to be routed.
2. The SASE-oriented traffic routing method of claim 1, wherein obtaining traffic quality of service classification information comprises:
acquiring a link state attribute of unknown forwarding path traffic;
constructing a classification discriminator;
and classifying the unknown forwarding path traffic to obtain the traffic service quality classification information.
3. The SASE-oriented traffic routing method according to claim 2, wherein obtaining the link state attribute of the unknown forwarding path traffic specifically comprises the following:
the service quality level and the corresponding bandwidth, time delay and packet loss rate.
4. The SASE-oriented traffic routing method of claim 2, wherein the classification discriminator is constructed by:
capturing a data packet according to a source address, a destination address and service quality to obtain a data set with a label, and carrying out data enhancement on the data set by generating an countermeasure network to obtain a data set data1; and grabbing the data packet according to the source address and the destination address to obtain a data set data2, and obtaining a classification discriminator to classify.
5. The SASE-oriented traffic routing method according to claim 4, wherein the data set data1 and the data set data2 are processed by:
respectively training a k nearest neighbor classification model and a convolutional neural network classification model by using a data set data1 to obtain a preliminary model, and simultaneously calculating the respective accuracy rates; for each data in the data set data2, if the type labels predicted by the two models are consistent, the data are marked with the predicted labels and put into data1, and if the type labels are inconsistent, the data are marked with the model predicted labels with higher accuracy and put into data1; and repeating the process until no data exists in the data2, and obtaining the classification discriminator.
6. A SASE-oriented traffic routing system, comprising a traffic classification module and a path generation module, wherein the traffic classification module and the path generation module cooperatively execute the traffic routing method according to claim 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210437934.6A CN115037680B (en) | 2022-04-25 | 2022-04-25 | SASE-oriented flow routing method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210437934.6A CN115037680B (en) | 2022-04-25 | 2022-04-25 | SASE-oriented flow routing method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115037680A CN115037680A (en) | 2022-09-09 |
| CN115037680B true CN115037680B (en) | 2023-08-22 |
Family
ID=83119285
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210437934.6A Active CN115037680B (en) | 2022-04-25 | 2022-04-25 | SASE-oriented flow routing method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115037680B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7742406B1 (en) * | 2004-12-20 | 2010-06-22 | Packeteer, Inc. | Coordinated environment for classification and control of network traffic |
| WO2017139699A1 (en) * | 2016-02-10 | 2017-08-17 | Hughes Network Systems, Llc | System and method for policy-based multipath wan transports for improved quality of service over broadband networks |
| CN108521375A (en) * | 2018-04-17 | 2018-09-11 | 中国矿业大学 | The transmission of the network multi-service flow QoS based on SDN a kind of and dispatching method |
| WO2020119662A1 (en) * | 2018-12-14 | 2020-06-18 | 深圳先进技术研究院 | Network traffic classification method |
| CN112202672A (en) * | 2020-09-17 | 2021-01-08 | 华中科技大学 | Network route forwarding method and system based on service quality requirement |
| CN113114573A (en) * | 2021-04-16 | 2021-07-13 | 重庆邮电大学 | Video stream classification and scheduling system in SDN network |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100429904B1 (en) * | 2002-05-18 | 2004-05-03 | 한국전자통신연구원 | Router providing differentiated quality-of-service and fast internet protocol packet classification method for the same |
| US6968374B2 (en) * | 2002-07-03 | 2005-11-22 | Telefonaktiebolaget Lm Ericsson (Publ) | Quality of service (QOS) mechanism in an internet protocol (IP) network |
| US11140059B1 (en) * | 2020-03-24 | 2021-10-05 | Fortinet, Inc. | Active path detection for on-demand network links in a software-defined wide area network (SDWAN) |
-
2022
- 2022-04-25 CN CN202210437934.6A patent/CN115037680B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7742406B1 (en) * | 2004-12-20 | 2010-06-22 | Packeteer, Inc. | Coordinated environment for classification and control of network traffic |
| WO2017139699A1 (en) * | 2016-02-10 | 2017-08-17 | Hughes Network Systems, Llc | System and method for policy-based multipath wan transports for improved quality of service over broadband networks |
| CN108521375A (en) * | 2018-04-17 | 2018-09-11 | 中国矿业大学 | The transmission of the network multi-service flow QoS based on SDN a kind of and dispatching method |
| WO2020119662A1 (en) * | 2018-12-14 | 2020-06-18 | 深圳先进技术研究院 | Network traffic classification method |
| CN112202672A (en) * | 2020-09-17 | 2021-01-08 | 华中科技大学 | Network route forwarding method and system based on service quality requirement |
| CN113114573A (en) * | 2021-04-16 | 2021-07-13 | 重庆邮电大学 | Video stream classification and scheduling system in SDN network |
Non-Patent Citations (1)
| Title |
|---|
| 可编程数据平面的业务相关路由方法;吴博;吴静;罗威;朱劼;;计算机工程与应用(03);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115037680A (en) | 2022-09-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Szigeti et al. | End-to-End QoS network design: Quality of Service for rich-media & cloud networks | |
| US10999189B2 (en) | Route optimization using real time traffic feedback | |
| US10070328B2 (en) | Predictive network traffic management | |
| CN104012063B (en) | Controller for flexible and extensible flow processing in software-defined networks | |
| CN104717098B (en) | A kind of data processing method and device | |
| CN110521169A (en) | Strategy for service chaining guarantees | |
| CN107566440A (en) | The automatic discovery that is serviced in the network environment of software definition and automatic scalable | |
| CN104704779A (en) | Method and apparatus for accelerating forwarding in software-defined networks | |
| US11431808B2 (en) | Systems and methods for dynamically connecting network elements to enable a service | |
| CN107819742B (en) | System architecture and method for dynamically deploying network security service | |
| CN109831386A (en) | Optimal route selection algorithm based on machine learning under a kind of SDN | |
| CN111130858B (en) | Dynamic multi-target virtual network mapping method in SD-WAN scene | |
| CN106161275A (en) | Prediction for service quality exports packet classification | |
| CN108289061B (en) | Service chain topology system based on SDN | |
| US11456917B2 (en) | Analyzing deployed networks with respect to network solutions | |
| CN106453138A (en) | Message processing method and apparatus | |
| Shirmarz et al. | An autonomic software defined network (SDN) architecture with performance improvement considering | |
| RU2697648C2 (en) | Traffic classification system | |
| Elbasheer et al. | Video streaming adaptive QoS routing with resource reservation (VQoSRR) model for SDN networks | |
| CN115037680B (en) | SASE-oriented flow routing method and system | |
| Salamai | An Approach Based on Decision-Making Algorithms for Qos-Aware Iot Services Composition. | |
| CN112260953A (en) | Multi-channel data forwarding decision method based on reinforcement learning | |
| CN115695280A (en) | Routing method and device based on edge node, electronic equipment and storage medium | |
| Gomes et al. | A generic sla negotiation protocol for virtualized environments | |
| Song et al. | Research on routing and scheduling algorithms for the simultaneous transmission of diverse data streaming services on the industrial internet |
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 |