CN114070786B - Policy routing dynamic scheduling method and device - Google Patents
Policy routing dynamic scheduling method and device Download PDFInfo
- Publication number
- CN114070786B CN114070786B CN202111334890.6A CN202111334890A CN114070786B CN 114070786 B CN114070786 B CN 114070786B CN 202111334890 A CN202111334890 A CN 202111334890A CN 114070786 B CN114070786 B CN 114070786B
- Authority
- CN
- China
- Prior art keywords
- policy
- routes
- route
- strategy
- dynamic scheduling
- 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
Images
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
- H04L45/306—Route determination based on the nature of the carried application
-
- 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]
-
- 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/29—Flow control; Congestion control using a combination of thresholds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/622—Queue service order
Abstract
The embodiment of the application provides a policy route dynamic scheduling method and device, which relate to the field of network information processing, and the policy route dynamic scheduling method comprises the following steps: acquiring a plurality of strategy routes and initializing the strategy routes; classifying the plurality of strategy routes according to the inclusion relation among the plurality of strategy routes to obtain a first strategy route and a second strategy route; the first policy route is a policy route set, and the policy routes in the policy route set have a mutual inclusion relationship; collecting hit numbers corresponding to both the first policy route and the second policy route according to a preset time period; the plurality of policy routes are ordered in order of number of hits from more to less. Therefore, by implementing the embodiment, the automatic scheduling policy routing can be realized, so that when the number of policy routing is very large, the flow matching efficiency can be ensured, and the forwarding performance of the policy routing can be further improved.
Description
Technical Field
The application relates to the field of network information processing, in particular to a policy routing dynamic scheduling method and device.
Background
Policy routing is a routing forwarding mechanism where traffic is forwarded according to a source address, a destination address, a source port, a destination port, a protocol, etc. Because the basis of the policy route for guiding the forwarding of the traffic is uncertain, the accurate hash matching cannot be performed according to the characteristics of the received traffic, and only the policy route list can be traversed until the policy route capable of guiding the forwarding is matched. If the number of policy route entries on the network device is very large, the policy route ranking which can be really used for guiding the traffic forwarding is very low in traffic matching efficiency, and the situation of slow forwarding of the policy route is indirectly caused.
Disclosure of Invention
An object of the embodiments of the present application is to provide a policy route dynamic scheduling method and apparatus, which can implement automatic scheduling of policy routes, so that when the number of policy routes is very large, the traffic matching efficiency can be ensured, and further, the forwarding performance of the policy routes can be improved.
An embodiment of the present application provides a policy routing dynamic scheduling method, where the method includes:
acquiring a plurality of strategy routes, and initializing the plurality of strategy routes;
classifying the plurality of strategy routes according to the inclusion relation among the plurality of strategy routes to obtain a first strategy route and a second strategy route; the first policy route is a policy route set, and the policy routes in the policy route set have a mutual inclusion relationship;
collecting hit numbers corresponding to the first policy route and the second policy route according to a preset time period;
and sequencing the plurality of policy routes according to the sequence of the hit numbers from the high to the low.
In the implementation process, the method can preferentially perform initialization sequencing on the strategy routes, so that the strategy routes can be arranged according to the configuration sequence of an administrator, and then classification is performed on the basis, so that the strategy routes with correlations form one class, and the single strategy routes without correlations form one class. At this time, the method periodically acquires the hit numbers of the two types of strategy routes, and reorders the two types of strategy routes from large to small according to the number of the hit numbers, thereby realizing periodic dynamic scheduling. And when the number of the policy routes is very large, the flow matching efficiency can be ensured, and the forwarding performance of the policy routes can be improved.
As an optional implementation manner, the step of obtaining a plurality of policy routes and initializing the plurality of policy routes includes:
acquiring a plurality of strategy routes and acquiring an administrator configuration sequence corresponding to the plurality of strategy routes;
and sequencing the plurality of policy routes according to the administrator configuration order.
As an optional implementation manner, the step of classifying the plurality of policy routes according to the inclusion relationship between the plurality of policy routes to obtain the first policy route and the second policy route includes:
among the plurality of policy routes, adding the policy route which does not participate in dynamic scheduling into a dynamic scheduling blacklist; the strategy routes in the dynamic scheduling blacklist are all arranged at the tail end of the strategy route sequence;
classifying the strategy routes participating in the dynamic scheduling according to the inclusion relation among the strategy routes participating in the dynamic scheduling to obtain a first strategy route and a second strategy route.
As an alternative embodiment, the method further comprises:
acquiring first flow matching times of the first strategy route and second flow matching times of the second strategy route;
judging whether the sum of the first flow matching times and the second flow matching times is larger than a preset time threshold value or not;
and when the sum of the first flow matching times and the second flow matching times is larger than the preset times threshold, executing the step of collecting the number of hits corresponding to the first policy route and the second policy route according to a preset time period.
As an alternative embodiment, the method further comprises:
judging whether the number of the second strategy routes is larger than the preset route number or not;
and when the number of the second policy routes is greater than the preset number of routes, executing the step of collecting the number of hits corresponding to both the first policy routes and the second policy routes according to a preset time period.
A second aspect of the embodiments of the present application provides a policy routing dynamic scheduling device, where the policy routing dynamic scheduling device includes:
an initializing unit, configured to obtain a plurality of policy routes, and initialize the plurality of policy routes;
the classification unit is used for classifying the plurality of strategy routes according to the inclusion relation among the plurality of strategy routes to obtain a first strategy route and a second strategy route; the first policy route is a policy route set, and the policy routes in the policy route set have a mutual inclusion relationship;
a collecting unit, configured to collect hit numbers corresponding to both the first policy route and the second policy route according to a preset time period;
and the scheduling unit is used for sequencing the plurality of strategy routes according to the sequence of the hit numbers from the high to the low.
It can be seen that, by implementing this embodiment, the policy route dynamic scheduling device can perform timing rearrangement on the policy route, so as to implement dynamic scheduling on the policy route. Specifically, the policy route dynamic scheduling device can comprehensively and dynamically schedule the single policy route and the group policy routes according to the inclusion relation among the policy routes, so that the common policy route is always located at the front end, the matching efficiency is further guaranteed, and the forwarding performance is improved.
As an alternative embodiment, the initialization unit includes:
an obtaining subunit, configured to obtain a plurality of policy routes, and obtain an administrator configuration sequence corresponding to the plurality of policy routes;
and the sequencing subunit is used for sequencing the plurality of strategy routes according to the administrator configuration sequence.
As an alternative embodiment, the classification unit includes:
the blacking subunit is used for adding the strategy route which does not participate in dynamic scheduling into a dynamic scheduling blacklist in the plurality of strategy routes; the strategy routes in the dynamic scheduling blacklist are all arranged at the tail end of the strategy route sequence;
and the classification subunit is used for classifying the strategy routes participating in the dynamic scheduling according to the inclusion relation among the strategy routes participating in the dynamic scheduling to obtain a first strategy route and a second strategy route.
A third aspect of the embodiments of the present application provides an electronic device, including a memory and a processor, where the memory is configured to store a computer program, and the processor is configured to execute the computer program to cause the electronic device to perform the policy routing dynamic scheduling method according to any one of the first aspect of the embodiments of the present application.
A fourth aspect of the embodiments of the present application provides a computer readable storage medium storing computer program instructions that, when read and executed by a processor, perform the method for dynamically scheduling policy routing according to any one of the first aspect of the embodiments of the present application.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments of the present application will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and should not be considered as limiting the scope, and other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic flow chart of a policy routing dynamic scheduling method provided in an embodiment of the present application;
fig. 2 is a flow chart of another policy routing dynamic scheduling method according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a policy routing dynamic scheduling device according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of another policy routing dynamic scheduling device according to an embodiment of the present application;
fig. 5 is a schematic diagram of a policy routing initial entry provided in an embodiment of the present application;
fig. 6 is a schematic diagram of statistics of matching times of policy routes with inclusion relations according to an embodiment of the present application;
FIG. 7 is a diagram of overall internal matching order adjustment results for a policy routing with inclusion relationships according to an embodiment of the present application;
FIG. 8 is a schematic diagram of a policy routing traffic hit provided in an embodiment of the present application;
fig. 9 is a schematic diagram of dynamic scheduling of policy routing according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application.
It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further definition or explanation thereof is necessary in the following figures. Meanwhile, in the description of the present application, the terms "first", "second", and the like are used only to distinguish the description, and are not to be construed as indicating or implying relative importance.
Example 1
Referring to fig. 1, fig. 1 is a schematic flow chart of a policy routing dynamic scheduling method according to an embodiment of the present application. The policy routing dynamic scheduling method comprises the following steps:
s101, acquiring a plurality of strategy routes and initializing the strategy routes.
In this embodiment, if ten thousand policy routes are configured on a network device, each policy route includes information such as a source address, a destination address, a source port, a destination port, and a protocol; initially, the policy routes will be ordered in the order of administrator configuration. Wherein, the administrator configuration order may be an order of policy routing IDs from small to large.
S102, classifying a plurality of strategy routes according to inclusion relations among the strategy routes to obtain a first strategy route and a second strategy route; the first policy route is a policy route set, and the policy routes in the policy route set have a mutual inclusion relationship.
In this embodiment, the first policy route is a policy route with an inclusion relationship, and the policy route with an inclusion relationship is referred to as a first policy route as a whole.
S103, collecting the number of hits corresponding to both the first policy route and the second policy route according to a preset time period.
S104, sequencing the plurality of strategy routes according to the sequence of the number of the hits from the high to the low.
By implementing the embodiment, the number of strategy route hits can be used as a basis for judging whether the strategy route is active or not, the strategy route with highest activity is sequentially adjusted, the strategy route with highest activity is placed at the forefront, and strategy hit statistics is restarted, so that the matching efficiency of the strategy route is ensured, and the forwarding performance is improved.
In this embodiment of the present application, the execution subject of the method may be a computing device such as a computer or a server, which is not limited in this embodiment.
In this embodiment of the present application, the execution body of the method may also be an intelligent device such as a smart phone, a tablet computer, and the like, which is not limited in this embodiment.
Therefore, by implementing the policy route dynamic scheduling method described in this embodiment, the policy routes can be preferentially ordered in an initializing manner, so that the policy routes can be arranged according to the configuration sequence of the administrator, and then classified on the basis, so that the policy routes with correlations form a class, and the single policy routes without correlations form a class. At this time, the method periodically acquires the hit numbers of the two types of strategy routes, and reorders the two types of strategy routes from large to small according to the number of the hit numbers, thereby realizing periodic dynamic scheduling. And when the number of the policy routes is very large, the flow matching efficiency can be ensured, and the forwarding performance of the policy routes can be improved.
Example 2
Referring to fig. 2, fig. 2 is a flow chart of a policy routing dynamic scheduling method according to an embodiment of the present application. As shown in fig. 2, the policy routing dynamic scheduling method includes:
s201, acquiring a plurality of strategy routes and acquiring an administrator configuration sequence corresponding to the plurality of strategy routes.
S202, sequencing the plurality of policy routes according to the configuration sequence of the administrator.
In this embodiment, each of the plurality of policy routes corresponds to an ID value.
In this embodiment, the administrator configuration order may be an order in which a plurality of ID values are small to large.
S203, adding the strategy route which does not participate in dynamic scheduling into a dynamic scheduling blacklist in a plurality of strategy routes; the strategy routes in the dynamic dispatching blacklist are all arranged at the tail end of the strategy route sequence.
In this embodiment, the policy routes not participating in dynamic scheduling may include default policy routes, and the like.
In this embodiment, in the dynamic scheduling blacklist of the policy route, the policy route that does not participate in the dynamic scheduling is mainly used. Such routes, because they contain too large intervals, have hit them all if they are first matched, which tends to result in confusion in the matching of traffic to the network device.
Referring to fig. 5, fig. 5 shows a schematic diagram of a policy routing initial entry. The last policy route is a default policy route, and the function of the last policy route is: when traffic arriving at the network device has not yet been matched after all policy routes have been matched, then the route directs the traffic to the default gateway. Default policy routing cannot participate in dynamic scheduling and needs to be added to the dynamic scheduling blacklist.
S204, classifying the strategy routes participating in the dynamic scheduling according to the inclusion relation among the strategy routes participating in the dynamic scheduling to obtain a first strategy route and a second strategy route.
In this embodiment, the first policy route is a policy route set, and policy routes in the policy route set have a relationship therebetween.
S205, judging whether the number of the second strategy routes is larger than the preset route number, if so, executing steps S206-S207; if not, the process is ended.
In this embodiment, the preset number of routes is generally 2.
In this embodiment, the method preferably defines the inclusion relationship of the policy route, and takes the policy route with the inclusion relationship as a whole to participate in dynamic scheduling. Policy routing is divided into two categories: (1) has inclusion relation; (2) there is no inclusion relationship. Only when the policy route without the inclusion relation reaches a certain scale (> =2), the dynamic scheduling of the policy route can be started; the policy routes without the inclusion relationship participate solely in the dynamic scheduling, and the policy routes with the inclusion relationship participate in the dynamic scheduling as a whole.
S206, acquiring the first traffic matching times of the first policy route and the second traffic matching times of the second policy route.
S207, judging whether the sum of the first flow matching times and the second flow matching times is larger than a preset time threshold value, if so, executing steps S208-S209; if not, the process is ended.
By implementing this embodiment, the method can count the number of hits for each (or each global) policy route during a fixed period of time, based on determining whether the policy route is active during the period of time.
Referring to fig. 6, fig. 6 shows a statistical diagram of the number of times of matching policy routes with inclusion relations. After dynamic scheduling of policy routes is started, the policy routes with inclusion relations are automatically taken as a whole to participate in statistics of flow matching times. And counting the sum of the matching times of all the policy routes in the whole body, and taking the sum as a basis for judging whether the whole body is active or not.
In this embodiment, since the first policy route including the relationship participates in the policy route dynamic scheduling as a whole, the traffic matching sequence inside the whole is still dependent on the order of policy route configuration, which may cause confusion of traffic matching reaching the network device. To solve this problem, the administrator may manually adjust the internal routing order of the first policy route after dynamic scheduling of policy routes is started. This process is generally performed after the execution of step S207.
Referring to fig. 7, fig. 7 shows a diagram of a policy routing overall internal matching order adjustment result with inclusion relationships. After dynamic scheduling of the policy routes is started, an administrator can manually adjust the flow matching sequence in the whole interior of the policy routes with the inclusion relationship, so that the policy routes with the inclusion relationship can be ensured to accurately guide forwarding of the flow.
S208, collecting the number of hits corresponding to both the first policy route and the second policy route according to a preset time period.
Referring to fig. 8, fig. 8 shows a schematic diagram of a policy routing traffic hit. Because the network traffic has timeliness, the number of data packets hitting each policy route is different in a fixed time period, so that after the network equipment operates for a period of time, the situations that some policy routes are hit for a large number of times and some policy routes are hit for a small number of times can occur.
S209, sequencing the plurality of policy routes according to the sequence of the number of the hits from the high to the low.
By implementing the embodiment, the hit number of the strategy route in the time period can be analyzed, the strategy route activity level is sorted according to the hit number, and the strategy route activity level is ranked according to the activity level.
Referring to fig. 9, fig. 9 shows a schematic diagram after dynamic scheduling of policy routing. The dynamic scheduling of the policy routes collects and counts the hit number of each (each whole) policy route in a fixed time period, then analyzes and sorts the hit number of the policy routes, readjusts the order of the policy routes according to the order, places the most active policy route entry at the forefront, and restarts counting the hit number so as to ensure the matching efficiency of the policy routes.
Therefore, by implementing the policy routing dynamic scheduling method described in the embodiment, the dynamic scheduling function of policy routing entries can be realized, and when the number of policy routing entries is very large, the matching efficiency is ensured, and the forwarding performance is improved. Specifically, the method can place the most active policy route at the forefront by counting the hit times of the policy route in a fixed time period, so that the matching efficiency is improved, the forwarding performance is improved, and the problem of dynamic scheduling of the policy routes which are mutually contained can be solved.
Example 3
Referring to fig. 3, fig. 3 is a schematic structural diagram of a policy routing dynamic scheduling device according to an embodiment of the present application. As shown in fig. 3, the policy routing dynamic scheduling apparatus includes:
an initializing unit 310, configured to obtain a plurality of policy routes, and initialize the plurality of policy routes;
a classification unit 320, configured to classify the plurality of policy routes according to the inclusion relationship between the plurality of policy routes, so as to obtain a first policy route and a second policy route; the first policy route is a policy route set, and the policy routes in the policy route set have a mutual inclusion relationship;
a collecting unit 330 for collecting hit numbers corresponding to both the first policy route and the second policy route according to a preset time period;
a scheduling unit 340, configured to sort the plurality of policy routes in order of more hits.
In this embodiment of the present application, the explanation of the policy routing dynamic scheduling device may refer to the description in embodiment 1 or embodiment 2, and no redundant description is given in this embodiment.
It can be seen that the policy route dynamic scheduling device described in this embodiment is implemented, and the policy route dynamic scheduling device may perform timing rearrangement on the policy route, so as to implement dynamic scheduling on the policy route. Specifically, the policy route dynamic scheduling device can comprehensively and dynamically schedule the single policy route and the group policy routes according to the inclusion relation among the policy routes, so that the common policy route is always located at the front end, the matching efficiency is further guaranteed, and the forwarding performance is improved.
Example 4
Referring to fig. 4 together, fig. 4 is a schematic structural diagram of a policy routing dynamic scheduling apparatus according to an embodiment of the present application. The policy routing dynamic scheduling device shown in fig. 4 is obtained by optimizing the policy routing dynamic scheduling device shown in fig. 3. As shown in fig. 4, the initializing unit 310 includes:
an obtaining subunit 311, configured to obtain a plurality of policy routes, and obtain an administrator configuration order corresponding to the plurality of policy routes;
a ranking subunit 312, configured to rank the plurality of policy routes in an administrator-configured order.
As an alternative embodiment, the classification unit 320 includes:
a blacking subunit 321, configured to add, among the plurality of policy routes, a policy route that does not participate in dynamic scheduling to a dynamic scheduling blacklist; the strategy routes in the dynamic dispatching blacklist are all arranged at the tail end of the strategy route sequence;
and the classification subunit 322 is configured to classify the policy routes participating in the dynamic scheduling according to the inclusion relationship between the policy routes participating in the dynamic scheduling, so as to obtain a first policy route and a second policy route.
As an optional implementation manner, the policy routing dynamic scheduling device further includes:
an obtaining unit 350, configured to obtain a first traffic matching number of times of the first policy route and a second traffic matching number of times of the second policy route;
a judging unit 360, configured to judge whether the sum of the first flow matching times and the second flow matching times is greater than a preset times threshold;
the collecting unit 330 is further configured to collect, according to a preset time period, the number of hits corresponding to both the first policy route and the second policy route when the sum of the first traffic matching number and the second traffic matching number is greater than a preset number threshold.
As an optional implementation manner, the determining unit 360 is further configured to determine whether the number of second policy routes is greater than the preset number of routes;
the collecting unit 330 is further configured to collect, according to a preset time period, the number of hits corresponding to both the first policy route and the second policy route when the number of second policy routes is greater than the preset number of routes.
In this embodiment of the present application, the explanation of the policy routing dynamic scheduling device may refer to the description in embodiment 1 or embodiment 2, and no redundant description is given in this embodiment.
It can be seen that the policy route dynamic scheduling device described in this embodiment is implemented, and the policy route dynamic scheduling device may perform timing rearrangement on the policy route, so as to implement dynamic scheduling on the policy route. Specifically, the policy route dynamic scheduling device can comprehensively and dynamically schedule the single policy route and the group policy routes according to the inclusion relation among the policy routes, so that the common policy route is always located at the front end, the matching efficiency is further guaranteed, and the forwarding performance is improved.
An embodiment of the present application provides an electronic device, including a memory and a processor, where the memory is configured to store a computer program, and the processor is configured to execute the computer program to cause the electronic device to perform any one of the policy routing dynamic scheduling method of embodiment 1 or embodiment 2 of the present application.
Embodiments of the present application provide a computer readable storage medium storing computer program instructions that, when read and executed by a processor, perform the policy routing dynamic scheduling method of any one of embodiments 1 or 2 of the present application.
In the several embodiments provided in this application, it should be understood that the disclosed apparatus and method may be implemented in other manners as well. The apparatus embodiments described above are merely illustrative, for example, flow diagrams and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition, the functional modules in the embodiments of the present application may be integrated together to form a single part, or each module may exist alone, or two or more modules may be integrated to form a single part.
The functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, randomAccess Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The foregoing is merely exemplary embodiments of the present application and is not intended to limit the scope of the present application, and various modifications and variations may be suggested to one skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principles of the present application should be included in the protection scope of the present application. It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further definition or explanation thereof is necessary in the following figures.
The foregoing is merely specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily think about changes or substitutions within the technical scope of the present application, and the changes and substitutions are intended to be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
It is noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
Claims (8)
1. A method for dynamic scheduling of policy routing, the method comprising:
acquiring a plurality of strategy routes, and initializing the plurality of strategy routes;
classifying the plurality of strategy routes according to the inclusion relation among the plurality of strategy routes to obtain a first strategy route and a second strategy route; the first policy route is a policy route set, and the policy routes in the policy route set have a mutual inclusion relationship;
collecting hit numbers corresponding to the first policy route and the second policy route according to a preset time period;
sorting the plurality of policy routes in order of the number of hits from more to less;
the step of obtaining a plurality of policy routes and initializing the plurality of policy routes comprises the following steps:
acquiring a plurality of strategy routes and acquiring an administrator configuration sequence corresponding to the plurality of strategy routes;
and sequencing the plurality of policy routes according to the administrator configuration order.
2. The method for dynamically scheduling policy routes according to claim 1, wherein said step of classifying said plurality of policy routes according to inclusion relationships between said plurality of policy routes to obtain a first policy route and a second policy route comprises:
among the plurality of policy routes, adding the policy route which does not participate in dynamic scheduling into a dynamic scheduling blacklist; the strategy routes in the dynamic scheduling blacklist are all arranged at the tail end of the strategy route sequence;
classifying the strategy routes participating in the dynamic scheduling according to the inclusion relation among the strategy routes participating in the dynamic scheduling to obtain a first strategy route and a second strategy route.
3. The policy routing dynamic scheduling method of claim 1, wherein said method further comprises:
acquiring first flow matching times of the first strategy route and second flow matching times of the second strategy route;
judging whether the sum of the first flow matching times and the second flow matching times is larger than a preset time threshold value or not;
and when the sum of the first flow matching times and the second flow matching times is larger than the preset times threshold, executing the step of collecting the number of hits corresponding to the first policy route and the second policy route according to a preset time period.
4. The policy routing dynamic scheduling method of claim 1, wherein said method further comprises:
judging whether the number of the second strategy routes is larger than the preset route number or not;
and when the number of the second policy routes is greater than the preset number of routes, executing the step of collecting the number of hits corresponding to both the first policy routes and the second policy routes according to a preset time period.
5. A policy routing dynamic scheduling apparatus, characterized in that the policy routing dynamic scheduling apparatus comprises:
an initializing unit, configured to obtain a plurality of policy routes, and initialize the plurality of policy routes;
the classification unit is used for classifying the plurality of strategy routes according to the inclusion relation among the plurality of strategy routes to obtain a first strategy route and a second strategy route; the first policy route is a policy route set, and the policy routes in the policy route set have a mutual inclusion relationship;
a collecting unit, configured to collect hit numbers corresponding to both the first policy route and the second policy route according to a preset time period;
a scheduling unit, configured to sort the plurality of policy routes according to the order of the hit numbers from more to less;
wherein the initialization unit includes:
an obtaining subunit, configured to obtain a plurality of policy routes, and obtain an administrator configuration sequence corresponding to the plurality of policy routes;
and the sequencing subunit is used for sequencing the plurality of strategy routes according to the administrator configuration sequence.
6. The policy routing dynamic scheduling apparatus of claim 5, wherein said classification unit comprises:
the blacking subunit is used for adding the strategy route which does not participate in dynamic scheduling into a dynamic scheduling blacklist in the plurality of strategy routes; the strategy routes in the dynamic scheduling blacklist are all arranged at the tail end of the strategy route sequence;
and the classification subunit is used for classifying the strategy routes participating in the dynamic scheduling according to the inclusion relation among the strategy routes participating in the dynamic scheduling to obtain a first strategy route and a second strategy route.
7. An electronic device comprising a memory for storing a computer program and a processor that runs the computer program to cause the electronic device to perform the policy routing dynamic scheduling method of any one of claims 1 to 4.
8. A readable storage medium having stored therein computer program instructions which, when read and executed by a processor, perform the policy routing dynamic scheduling method of any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111334890.6A CN114070786B (en) | 2021-11-11 | 2021-11-11 | Policy routing dynamic scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111334890.6A CN114070786B (en) | 2021-11-11 | 2021-11-11 | Policy routing dynamic scheduling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114070786A CN114070786A (en) | 2022-02-18 |
| CN114070786B true CN114070786B (en) | 2023-07-11 |
Family
ID=80275577
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111334890.6A Active CN114070786B (en) | 2021-11-11 | 2021-11-11 | Policy routing dynamic scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114070786B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3133893A1 (en) * | 2014-04-18 | 2017-02-22 | China Academy of Telecommunications Technology | Method and device for determining ip flow routing rule |
| CN108259343A (en) * | 2017-06-14 | 2018-07-06 | 新华三技术有限公司 | The matching process and device of routing policy |
| WO2018217143A1 (en) * | 2017-05-24 | 2018-11-29 | Telefonaktiebolaget Lm Ericsson (Publ) | Routing table selection in a policy based routing system |
| CN113438164A (en) * | 2021-06-07 | 2021-09-24 | 中宇联云计算服务(上海)有限公司 | Dynamic multi-path optimization method, system and equipment based on cloud network fusion technology |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8064443B2 (en) * | 2009-05-11 | 2011-11-22 | Juniper Networks, Inc. | Scalable routing policy construction using dynamic redefinition of routing preference value |
| CN106230791A (en) * | 2016-07-20 | 2016-12-14 | 杭州迪普科技有限公司 | A kind of method and apparatus of single business many strategies Rapid matching |
| US10506083B2 (en) * | 2017-06-27 | 2019-12-10 | Cisco Technology, Inc. | Segment routing gateway storing segment routing encapsulating header used in encapsulating and forwarding of returned native packet |
| CN108768879B (en) * | 2018-04-26 | 2022-04-22 | 新华三信息安全技术有限公司 | Method and device for adjusting policy priority |
| CN112788059A (en) * | 2021-01-28 | 2021-05-11 | 新华三信息安全技术有限公司 | Policy identification method and device |
| CN113595907A (en) * | 2021-07-27 | 2021-11-02 | 北京天融信网络安全技术有限公司 | Aggregation method and device for issuing routing strategy based on SSLVPN |
-
2021
- 2021-11-11 CN CN202111334890.6A patent/CN114070786B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3133893A1 (en) * | 2014-04-18 | 2017-02-22 | China Academy of Telecommunications Technology | Method and device for determining ip flow routing rule |
| WO2018217143A1 (en) * | 2017-05-24 | 2018-11-29 | Telefonaktiebolaget Lm Ericsson (Publ) | Routing table selection in a policy based routing system |
| CN108259343A (en) * | 2017-06-14 | 2018-07-06 | 新华三技术有限公司 | The matching process and device of routing policy |
| CN113438164A (en) * | 2021-06-07 | 2021-09-24 | 中宇联云计算服务(上海)有限公司 | Dynamic multi-path optimization method, system and equipment based on cloud network fusion technology |
Non-Patent Citations (3)
| Title |
|---|
| IPv6网络数据包分类的研究与实现;唐兴旺;《CNKI》;全文 * |
| Viviana Solla ; Gabriel Jambrina ; Eduardo Grampín.Route reflection topology planning in service provider networks.《2017 IEEE URUCON》.2017,全文. * |
| 基于报文分类的策略路由体系及其算法的研究;王志恒;《WFCD》;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114070786A (en) | 2022-02-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8738721B1 (en) | System and method for detecting spam using clustering and rating of E-mails | |
| US7814165B2 (en) | Message classification system and method | |
| US20100211644A1 (en) | Prioritization of recipient email messages | |
| CN111917863B (en) | Message pushing method and device, television equipment and computer storage medium | |
| CN106202280B (en) | Information processing method and server | |
| CN111131084B (en) | QoS-aware OpenFlow flow table searching method | |
| WO2020143170A1 (en) | Predicted path acquisition method and apparatus, computer device, and storage medium | |
| RU2014133875A (en) | SYSTEMS AND METHODS FOR DETECTING SPAM BY USING SYMBOL HISTOGRAMS | |
| CN115858180B (en) | Time slicing method and device and electronic equipment | |
| US20150169698A1 (en) | Method and apparatus of determining time for sending information | |
| US7940775B2 (en) | Priority-based data message publishing method and system according to a data message chain | |
| US9948570B2 (en) | Stream data processing method and stream data processing device | |
| WO2010037292A1 (en) | Method and system for determining suspicious spam range | |
| CN114070786B (en) | Policy routing dynamic scheduling method and device | |
| CN106789450B (en) | message feature statistical method and device | |
| CN109450797B (en) | Message forwarding method and device and computer equipment | |
| CN107256130A (en) | Data store optimization method and system based on Cuckoo Hash calculations | |
| US20170295113A1 (en) | Longest queue identification | |
| CN110110081B (en) | Hierarchical classification processing method and system for mobile internet mass monitoring data | |
| CN113992364A (en) | Network data packet blocking optimization method and system | |
| CN114443246A (en) | Intelligent scheduling method, device, equipment and computer readable storage medium | |
| US7599361B2 (en) | Wire-speed packet management in a multi-pipeline network processor | |
| CN107171944B (en) | Junk mail identification method and device | |
| CN111309475A (en) | Detection task execution method and device | |
| WO2019217125A1 (en) | Dynamic, load balanced task routing |
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 |