CN107864100A - Network link flow equalization method and computer-readable storage medium - Google Patents
Network link flow equalization method and computer-readable storage medium Download PDFInfo
- Publication number
- CN107864100A CN107864100A CN201711429455.5A CN201711429455A CN107864100A CN 107864100 A CN107864100 A CN 107864100A CN 201711429455 A CN201711429455 A CN 201711429455A CN 107864100 A CN107864100 A CN 107864100A
- Authority
- CN
- China
- Prior art keywords
- link
- dimensional
- mrow
- macro
- network
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 48
- 238000012545 processing Methods 0.000 claims description 10
- 238000004364 calculation method Methods 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 description 10
- 238000010586 diagram Methods 0.000 description 8
- 238000011161 development Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 230000004927 fusion Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000012913 prioritisation Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
Classifications
-
- 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/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides a kind of network link flow equalization method and computer-readable storage medium, wherein, method includes：Obtain the grand stream on overload link；Obtain the two-dimentional routing iinformation of the grand stream；The part grand stream on the overload link is switched to by other links according to the two-dimentional routing iinformation.The present invention can be can adapt to dispose in large, medium and small scale network, strong support provided for later multidimensional routing forwarding with the flexible design two-dimentional Routing Protocol compatible with traditional routing.
Description
Technical Field
The invention relates to the technical field of internet, in particular to a method for balancing network data link flow in an intra-domain, and specifically relates to a method for balancing network link flow and a computer storage medium.
Background
With the rapid development of the internet, the scale of internet users and the number of application programs show explosive growth, various problems existing in the traditional internet become more obvious, and the rapid development of the internet is severely restricted. In the aspect of information transmission, a traditional network is a network architecture based on an IP model, emphasizes that information is quickly reachable, and provides the same "best effort" service for all data flows by adopting a message forwarding mode based on the "shortest path". This approach tends to result in some network links being highly utilized, even congested, and some network links being poorly utilized, even idle. However, since the routing protocol and the data forwarding are implemented in one dimension based on the destination address, the traditional network has difficulty in solving the problem of unbalanced network link traffic.
In order to solve the above problems, many solutions, such as Equal Cost Multi Path (ECMP), Multi Protocol Label Switching (MPLS), policy routing, etc., have appeared in the development of network technologies, but these technologies all have respective problems. Although the ECMP technique can achieve multi-path load balancing and Open Shortest Path First (OSPF) basically supports ECMP functions, the actual load balancing effect is not ideal when the difference between paths is large in an actual network. Although the MPLS technology is a very effective solution for solving the congestion of network links, the closure of MPLS causes considerable inconvenience to the network measurement, management and security, and MPLS is not deployed in all networks, so that the application field of the MPLS technology is very limited. Policy routing needs to be configured on a path through which a data packet passes, the configuration process is very complex, although the problem of routing configuration can be well solved by the emergence of an SDN (software defined network), the SDN cannot be deployed in a large scale at present, and many problems exist in the aspect of fusion of the SDN and a traditional network.
Therefore, a need exists in the art for developing a network link traffic balancing method with a wide application range and good compatibility with a conventional route, so as to effectively achieve network link traffic balancing and reduce link congestion.
Disclosure of Invention
In view of this, the technical problem to be solved by the present invention is to provide a method for balancing network link traffic and a computer storage medium, which solve the problems of poor compatibility and limited application range of the existing network link traffic balancing method and the existing IP network.
In order to solve the above technical problem, a specific embodiment of the present invention provides a method for balancing network link traffic, including: acquiring a macro flow on an overload link; acquiring two-dimensional routing information of the macro flow; and switching part of the macro flow on the overloaded link to other links according to the two-dimensional routing information.
The specific implementation manner of the present invention also provides a computer storage medium containing computer execution instructions, and when the computer execution instructions are processed by the data processing device, the data processing device executes the network link traffic balancing method.
According to the above embodiments of the present invention, the method for balancing network link traffic and the computer storage medium have at least the following advantages: the purpose of load balancing is to reduce the bandwidth utilization rate of a congested network link, but the traditional route can only forward according to a destination address, and the flow balance of the network link is difficult to realize. Therefore, the method and the device are based on a two-dimensional routing technology, distinguish data traffic (macro flow) transmitted on a network link by using a source address, and switch a part of the data traffic to other paths (network links) except for a shortest path, thereby effectively realizing network load balancing, reducing network link congestion, avoiding the problem of closure of an MPLS (multiprotocol label switching) technology and the problem of compatibility of an SDN (software defined network) mode and the existing IP (Internet protocol) network, flexibly designing a two-dimensional routing protocol compatible with the traditional routing according to specific network requirements, being suitable for large-scale, medium-scale and small-scale network deployment, and providing powerful support for the forwarding of the multidimensional routing in the future.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate exemplary embodiments of the invention and together with the description, serve to explain the principles of the invention.
Fig. 1 is a flowchart of a first embodiment of a method for balancing network link traffic according to a specific embodiment of the present invention.
Fig. 2 is a flowchart of a second embodiment of a method for balancing network link traffic according to a specific embodiment of the present invention.
Fig. 3 is a flowchart of a third embodiment of a method for balancing network link traffic according to a specific embodiment of the present invention.
Fig. 4 is a schematic diagram of OSPF path selection according to an embodiment of the present invention.
Fig. 5 is a schematic diagram of two-dimensional link status broadcast forwarding according to an embodiment of the present invention.
Fig. 6 is a schematic propagation path diagram of a two-dimensional link status broadcast according to an embodiment of the present invention.
Fig. 7 is a schematic diagram of two-dimensional link status broadcast forwarding after the TOL is operated according to an embodiment of the present invention.
Detailed Description
For the purpose of promoting a clear understanding of the objects, aspects and advantages of the embodiments of the invention, reference will now be made to the drawings and detailed description, wherein there are shown in the drawings and described in detail, various modifications of the embodiments described herein, and other embodiments of the invention will be apparent to those skilled in the art.
The exemplary embodiments of the present invention and the description thereof are provided to explain the present invention and not to limit the present invention. Additionally, the same or similar numbered elements/components used in the drawings and the embodiments are used to represent the same or similar parts.
As used herein, the terms "first," "second," …, etc., do not denote any order or sequence, nor are they used to limit the present invention, but rather are used to distinguish one element from another or from another element or operation described in the same technical language.
With respect to directional terminology used herein, for example: up, down, left, right, front or rear, etc., are simply directions with reference to the drawings. Accordingly, the directional terminology used is intended to be illustrative and is not intended to be limiting of the present teachings.
As used herein, the terms "comprising," "including," "having," "containing," and the like are open-ended terms that mean including, but not limited to.
As used herein, "and/or" includes any and all combinations of the described items.
References to "plurality" herein include "two" and "more than two"; reference to "multiple sets" herein includes "two sets" and "more than two sets".
As used herein, the terms "substantially", "about" and the like are used to modify any slight variation in quantity or error that does not alter the nature of the variation. Generally, the range of slight variations or errors modified by such terms may be 20% in some embodiments, 10% in some embodiments, 5% in some embodiments, or other values. It should be understood by those skilled in the art that the aforementioned values can be adjusted according to actual needs, and are not limited thereto.
Certain words used to describe the present application are discussed below or elsewhere in this specification to provide additional guidance to those skilled in the art in describing the present application.
Fig. 1 is a flowchart of a first embodiment of a method for balancing network link traffic according to a specific embodiment of the present invention, and as shown in fig. 1, a macro flow on an overloaded link is obtained, and then two-dimensional routing information of the macro flow is obtained, and partial link data on the overloaded link is switched to other non-congested links.
In the specific implementation shown in the drawing, the method for balancing network link traffic includes:
step 101: and acquiring the macro flow on the overload link, wherein the macro flow is a network data flow of a data layer. In an embodiment of the present invention, if the bandwidth utilization of the link is higher than the set threshold, the link is determined to be an overloaded link, and multiple macro flows are transmitted simultaneously on the overloaded link.
Step 102: and acquiring the two-dimensional routing information of the macro flow. In the specific embodiment of the present invention, the macro flow includes two-dimensional routing information, that is, the macro flow includes a source address and a destination address of the data flow. The specific method for acquiring the two-dimensional routing information of the macro flow may adopt a netflow and other data analysis algorithms.
Step 103: and switching part of the macro flow on the overloaded link to other links according to the two-dimensional routing information. In the specific embodiment of the invention, part of the macro flow is switched to the link without congestion according to the source address of the macro flow on the overloaded link.
Referring to fig. 1, based on a two-dimensional routing technology, data traffic transmitted on a network link is distinguished by using a source address, and a part of the data traffic is switched to other paths except for a shortest path, so that the load of an overloaded link is effectively relieved, the congestion of the network link is reduced, the problem of the closure of an MPLS (multiprotocol label switching) technology is solved, the problem of the compatibility of an SDN (software defined network) mode and the existing IP (internet protocol) network is solved, a two-dimensional routing protocol compatible with the traditional routing can be flexibly designed according to specific network requirements, the two-dimensional routing protocol can be adapted to large-scale, medium-scale and small-scale network deployment, and a powerful support is provided for the forwarding of multidimensional routing in the future.
Fig. 2 is a flowchart of a second embodiment of a method for balancing network link traffic according to a specific embodiment of the present invention, and as shown in fig. 2, before acquiring a macro flow on an overloaded link, the overloaded link needs to be determined according to a dynamic metric value.
In the embodiment shown in the drawing, before step 101, the method for balancing network link traffic further includes:
step 100: and determining the overload link according to the real-time bandwidth utilization rate. In the specific embodiment of the invention, the real-time bandwidth utilization rate of the link is too high and is larger than the set value, which indicates that the link is overloaded, thereby determining that the link is an overloaded link.
Referring to fig. 2, the overloaded link is determined according to the real-time bandwidth utilization rate of the link, so that the load condition of the link can be dynamically reflected, and the load of the link can be effectively balanced.
Fig. 3 is a flowchart of a third embodiment of a method for balancing network link traffic according to a specific embodiment of the present invention, as shown in fig. 3, a part of macro flows on an overloaded link are switched to other non-overloaded links according to two-dimensional routing information of the macro flows on the overloaded link.
In the embodiment shown in the drawing, step 103 specifically includes:
step 1031: a macro-stream is selected from the overloaded link. In an embodiment of the invention, where there are multiple macroflows on the overloaded link, one macroflow (data flow) is selected according to the following steps. Step 1031 specifically includes: searching whether a macro flow switched to the overload link before exists according to a two-dimensional link state broadcast database; selecting a macro flow that has recently switched to the overloaded link, if any; if not, the smallest macroflow is selected according to a minimum traffic first algorithm. The step of searching whether a macro flow switched to the overloaded link before exists according to a two-dimensional link state broadcast database specifically includes: and searching whether the macro flow switched to the overload link before exists according to a two-dimensional link state broadcast database based on the latest lifetime.
Step 1032: and storing the prefix information of the macro flow into a two-dimensional link state for broadcasting according to the two-dimensional routing information. The prefix information comprises source prefix information and target prefix information; and broadcasting the two-dimensional link state into messages of a control layer. The router stores the prefix information of the selected macro flow into a two-dimensional link state broadcast (TD-LSA), and the router stores the two-dimensional link state broadcast into a two-dimensional link state broadcast database for backup.
Step 1033: determining a propagation path of the two-dimensional link state broadcast based on the prefix information. In a specific embodiment of the present invention, the propagation path specifically includes a directional path and a reverse path; the reverse path is determined by searching an original routing table through source prefix information in the two-dimensional link state broadcast to obtain an output interface corresponding to the router, and the two-dimensional link state broadcast is transmitted through the output interface; and if the outbound interface of the updated two-dimensional routing table is different from the outbound interface of the original routing table, the two-dimensional link state is broadcasted and transmitted by the outbound interface of the updated two-dimensional routing table.
Step 1034: the router on the propagation path executes the shortest path first SP based on the prefix information2F (namely, Shortest Path First based on Source Prefix) operation is carried out to obtain an updated two-dimensional routing table.
Step 1035: and switching the macro flow to other links according to the updated two-dimensional routing table. At the same time, other links also perform network link traffic balancing. In the specific embodiment of the present invention, if the real-time bandwidth utilization rate of the target link is not too limited after the macro flow is switched from the overloaded link to another uncongested link (target link), the macro flow switching is performed; otherwise, switching back to the original link. At this time, if the real-time bandwidth utilization of the original overloaded link is still over-limited, step 1031 to step 1035 are performed again on the overloaded link.
In an embodiment of the present invention, before step 1034, step 103 further includes: and calculating the dynamic metric value of the overloaded link so that the router on the propagation path performs the shortest path first operation based on the prefix information by using the dynamic metric value.
The real-time bandwidth utilization rate is considered when the dynamic metric value is calculated, the load condition of the link can be dynamically reflected, and the link with the real-time bandwidth utilization rate exceeding the limit is determined to be an overloaded link.
The dynamic metric valueThe specific calculation formula of (A) is as follows:
wherein, is a link metric value with the type k; k is a link type; bi,jIs the bandwidth capacity of the link (i, j), i being the destination address of the link; j is the source address of the link; u. ofi,jReal-time bandwidth utilization for link (i, j); b is a reference bandwidth when the metric value is calculated first for the open shortest path.
Referring to fig. 3, part of the macro flow on the overloaded link is switched to other non-overloaded links, so that the flow balance of the network link is effectively realized, the link congestion is reduced, and the method can be suitable for large, medium and small-scale network deployment. And determining a propagation path of the two-dimensional link state broadcast according to the prefix information, and transmitting the two-dimensional link state broadcast to the designated router only, so that a broadcast storm can not be caused, the influence on the existing network load state is small, and the data calculation amount of the router can not be increased.
The specific implementation of the present invention further provides a computer storage medium containing a computer executable instruction, where when the computer executable instruction is processed by a data processing device, the data processing device executes a network link traffic balancing method, and the method specifically includes:
step 101: a macro flow on an overloaded link is acquired.
Step 102: and acquiring the two-dimensional routing information of the macro flow.
Step 103: and switching part of the macro flow on the overloaded link to other links according to the two-dimensional routing information.
The specific implementation of the present invention further provides a computer storage medium containing a computer executable instruction, where when the computer executable instruction is processed by a data processing device, the data processing device executes a network link traffic balancing method, and the method specifically includes:
step 100: and determining the overload link according to the real-time bandwidth utilization rate.
Step 101: a macro flow on an overloaded link is acquired.
Step 102: and acquiring the two-dimensional routing information of the macro flow.
Step 103: and switching part of the macro flow on the overloaded link to other links according to the two-dimensional routing information.
The specific implementation of the present invention further provides a computer storage medium containing a computer executable instruction, where when the computer executable instruction is processed by a data processing device, the data processing device executes a network link traffic balancing method, and the method specifically includes:
step 101: a macro flow on an overloaded link is acquired.
Step 102: and acquiring the two-dimensional routing information of the macro flow.
Step 1031: a macro-stream is selected from the overloaded link.
Step 1032: and storing the prefix information of the macro flow into a two-dimensional link state for broadcasting according to the two-dimensional routing information.
Step 1033: determining a propagation path of the two-dimensional link state broadcast based on the prefix information.
Step 1034: and the router on the propagation path executes shortest path first operation based on the prefix information so as to obtain an updated two-dimensional routing table.
Step 1035: and switching the macro flow to other links according to the updated two-dimensional routing table.
Fig. 4 is a schematic diagram of OSPF (open shortest path first) path selection according to an embodiment of the present invention, as shown in fig. 4, data forwarding is performed only according to a destination address, link data flows from nodes a, b, c, and f to node i all pass through a path (h, i), and link data flows from nodes a, b, and c to node i all pass through a path (d, h, i), so that bandwidth utilization of links (h, i) may be too high to cause congestion, and bandwidth utilization of links (g, i) is low and link traffic transmission is unbalanced.
Fig. 5 is a schematic diagram of Two-dimensional link state broadcast (TD-LSA) forwarding according to an embodiment of the present invention, where a source address of a link data flow (macro flow) is considered in a TOL (Two-dimensional open shortest path first for load balancing) routing scheme, and a list of relevant symbol values of the TOL routing scheme is given in table 1 below.
TABLE 1
As shown in FIG. 5, for link (h, j), assume US＝60％，hu10%, B100 Mbps, the bandwidth utilization u of the link (h, i)h,i75%, it can be seen that uh,i＞USThe bandwidth utilization of the link (h, i) is too high, link congestion (link overload) is likely to occur, and link switching is required. One macro flow is selected from the link (h, i), and since there is no macro flow that has been switched to the link (h, i) most recently, the smallest macro flow is selected according to the minimum traffic prioritization algorithm, and as can be seen from fig. 5, the smallest macro flow on the link (h, i) is the macro flow from the node b.
Fig. 6 is a schematic diagram of a propagation path of a two-dimensional link status broadcast according to an embodiment of the present invention, as shown in fig. 6, at the control layer, the propagation path includes a reverse path and a directional path, the overloaded link is (h, i), since no previous switch over to the overloaded link (h, i), a macro-flow is selected from the overloaded link according to a minimum traffic first algorithm, i.e., the macro flow from the source node b to the destination node i, store the prefix information of the macro flow from the source node b to the destination node i into a two-dimensional link state broadcast (TD-LSA), calculate the dynamic metric value of the overloaded link, searching an original routing table through prefix information to obtain a corresponding output interface of the router to determine a reverse path and a directional path of the two-dimensional link state broadcast, wherein the reverse path of the two-dimensional link state broadcast is determined to be i-h-d-b, and the directional path is d-g-i; router on reverse path and directional path performs shortest path first SP based on prefix information using dynamic metric values2F, when the data layer of the router on the propagation path transmits the macro flow, if the two-dimensional routing table is updatedThe output interface of the two-dimensional routing table is different from the output interface of the original routing table, and the macro stream is transmitted out by updating the output interface of the two-dimensional routing table.
Fig. 7 is a schematic diagram of two-dimensional link state broadcast forwarding after the TOL (two-dimensional open shortest path first for load balancing) is operated according to the embodiment of the present invention, as shown in fig. 7, the macro flow from the node b is finally switched to the path b — > d — > g — > i, and the macro flow sent by other nodes remains unchanged.
The specific embodiment of the invention provides a network link flow balancing method and a computer storage medium, wherein the purpose of load balancing is to reduce the bandwidth utilization rate of a congested network link, but the traditional route can only forward according to a destination address, and the network link flow balancing is difficult to realize. Therefore, the method and the device are based on a two-dimensional routing technology, distinguish data traffic (macro flow) transmitted on a network link by using a source address, and switch a part of the data traffic to other paths (network links) except for a shortest path, thereby effectively realizing network load balancing, reducing network link congestion, avoiding the problem of closure of an MPLS (multiprotocol label switching) technology and the problem of compatibility of an SDN (software defined network) mode and the existing IP (Internet protocol) network, flexibly designing a two-dimensional routing protocol compatible with the traditional routing according to specific network requirements, being suitable for large, medium and small-scale network deployment, and providing powerful support for multi-dimensional routing forwarding in the future.
The embodiments of the invention described above may be implemented in various hardware, software code, or combinations of both. For example, an embodiment of the present invention may also be program code for executing the above method in a Digital Signal Processor (DSP). The invention may also relate to a variety of functions performed by a computer processor, digital signal processor, microprocessor, or Field Programmable Gate Array (FPGA). The processor described above may be configured according to the present invention to perform certain tasks by executing machine-readable software code or firmware code that defines certain methods disclosed herein. Software code or firmware code may be developed in different programming languages and in different formats or forms. Software code may also be compiled for different target platforms. However, the different code styles, types, and languages of software code and other types of configuration code that perform tasks in accordance with the present invention do not depart from the spirit and scope of the present invention.
The foregoing is merely an illustrative embodiment of the present invention, and any equivalent changes and modifications made by those skilled in the art without departing from the spirit and principle of the present invention should fall within the protection scope of the present invention.
Claims (10)
1. A method for balancing network link traffic, the method comprising:
acquiring a macro flow on an overload link;
acquiring two-dimensional routing information of the macro flow; and
and switching part of the macro flow on the overloaded link to other links according to the two-dimensional routing information.
2. The method for network link traffic balancing according to claim 1, wherein the step of obtaining the macro flow on the overloaded link is preceded by the method further comprising:
and determining the overload link according to the real-time bandwidth utilization rate.
3. The method for balancing network link traffic according to claim 1, wherein the step of switching part of the macro flows on the overloaded link to other links according to the two-dimensional routing information specifically includes:
selecting a macro-stream from the overloaded link;
storing the prefix information of the macro flow into a two-dimensional link state broadcast according to the two-dimensional routing information;
determining a propagation path of the two-dimensional link state broadcast based on the prefix information;
the router on the propagation path executes shortest path first operation based on the prefix information so as to obtain an updated two-dimensional routing table; and
and switching the macro flow to other links according to the updated two-dimensional routing table.
4. The method for network link traffic balancing according to claim 3, wherein the step of selecting a macro-flow from the overloaded link specifically includes:
searching whether a macro flow switched to the overload link before exists according to a two-dimensional link state broadcast database;
selecting a macro flow that has recently switched to the overloaded link, if any; and
if not, the smallest macroflow is selected according to a minimum traffic first algorithm.
5. The method for network link traffic balancing according to claim 4, wherein the step of searching whether the macro flow switched to the overloaded link before exists according to the two-dimensional link status broadcast database specifically includes:
and searching whether the macro flow switched to the overload link before exists according to a two-dimensional link state broadcast database based on the latest lifetime.
6. The method for network link traffic balancing according to claim 3, wherein before the step of performing the shortest path first operation based on the prefix information by the routers on the propagation paths to obtain the updated two-dimensional routing table, the method further comprises:
and calculating the dynamic metric value of the overloaded link so that the router on the propagation path performs the shortest path first operation based on the prefix information by using the dynamic metric value.
7. The method of network link traffic balancing according to claim 6, characterized in that the dynamic metric valueThe specific calculation formula of (A) is as follows:
<mrow> <msubsup> <mi>m</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> <mi>t</mi> </msubsup> <mo>=</mo> <mfrac> <mi>B</mi> <mrow> <msub> <mi>b</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>u</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mo>)</mo> </mrow> <msub> <mi>&lambda;</mi> <mi>k</mi> </msub> </mrow> </mfrac> </mrow>
wherein, is a link metric value with the type k; k is a link type; bi,jIs the bandwidth capacity of the link (i, j), i being the destination address of the link; j is the source address of the link; u. ofi,jReal-time bandwidth utilization for link (i, j); b is a reference bandwidth when the metric value is calculated first for the open shortest path.
8. The method for network link traffic balancing according to claim 3, wherein the propagation path specifically comprises a directional path and a reverse path.
9. The method for network link traffic balancing according to claim 8, wherein the reverse path is determined by finding an original routing table through source prefix information in the two-dimensional link state broadcast to obtain an egress interface corresponding to a router; the directional path is determined by comparing whether the egress interface of the updated two-dimensional routing table is the same as the egress interface of the original routing table.
10. A computer storage medium containing computer executable instructions which, when processed by data processing apparatus, cause the data processing apparatus to perform a method of network link traffic balancing as claimed in any one of claims 1 to 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711429455.5A CN107864100A (en) | 2017-12-26 | 2017-12-26 | Network link flow equalization method and computer-readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711429455.5A CN107864100A (en) | 2017-12-26 | 2017-12-26 | Network link flow equalization method and computer-readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107864100A true CN107864100A (en) | 2018-03-30 |
Family
ID=61707594
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711429455.5A Pending CN107864100A (en) | 2017-12-26 | 2017-12-26 | Network link flow equalization method and computer-readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107864100A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110351196A (en) * | 2018-04-02 | 2019-10-18 | 华中科技大学 | Load-balancing method and system based on accurate congestion feedback in cloud data center |
| CN114050993A (en) * | 2021-09-26 | 2022-02-15 | 比威网络技术有限公司 | Access side-based safe and trusted path active selection method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103716242A (en) * | 2013-12-25 | 2014-04-09 | 北京邮电大学 | Routing method and system |
| CN106789658A (en) * | 2016-12-29 | 2017-05-31 | 南京邮电大学 | Satellite MPLS network flow equalization method based on SDN controllers |
-
2017
- 2017-12-26 CN CN201711429455.5A patent/CN107864100A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103716242A (en) * | 2013-12-25 | 2014-04-09 | 北京邮电大学 | Routing method and system |
| CN106789658A (en) * | 2016-12-29 | 2017-05-31 | 南京邮电大学 | Satellite MPLS network flow equalization method based on SDN controllers |
Non-Patent Citations (1)
| Title |
|---|
| 赵成安 等: "针对域内流量均衡的二维路由方案", 《西安交通大学学报》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110351196A (en) * | 2018-04-02 | 2019-10-18 | 华中科技大学 | Load-balancing method and system based on accurate congestion feedback in cloud data center |
| CN110351196B (en) * | 2018-04-02 | 2020-09-08 | 华中科技大学 | Load balancing method and system based on accurate congestion feedback in cloud data center |
| CN114050993A (en) * | 2021-09-26 | 2022-02-15 | 比威网络技术有限公司 | Access side-based safe and trusted path active selection method and device |
| CN114050993B (en) * | 2021-09-26 | 2023-06-02 | 比威网络技术有限公司 | Access side-based active selection method and device for safe trusted paths |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9001672B2 (en) | System, method and apparatus conforming path cost criteria across multiple ABRs | |
| US9794148B1 (en) | Node protection for stacked labels | |
| JP5722455B2 (en) | Reducing message and computational overhead in the network | |
| KR100693058B1 (en) | Routing Method and Apparatus for Reducing Losing of Packet | |
| WO2016141885A1 (en) | Traffic engineering feeder for packet switched networks | |
| US7558214B2 (en) | Mechanism to improve concurrency in execution of routing computation and routing information dissemination | |
| US9571381B2 (en) | System and method for inter-domain RSVP-TE LSP load balancing | |
| US20140140210A1 (en) | Network system and load balancing method | |
| US9166903B2 (en) | System, method and apparatus to resolve RPF-vector attribute conflicts | |
| US11632322B2 (en) | Preferred path route graphs in a network | |
| US10567272B2 (en) | Bit error information transfer method, network device, and communications system | |
| WO2021088801A9 (en) | Routing method, network controller, system, and storage medium | |
| US10560367B2 (en) | Bidirectional constrained path search | |
| US20180316599A1 (en) | Routing packets considering the propagation delay of routes | |
| US20180062986A1 (en) | Network routing through an overlay network | |
| US11502940B2 (en) | Explicit backups and fast re-route mechanisms for preferred path routes in a network | |
| Geng et al. | A hop-by-hop dynamic distributed multipath routing mechanism for link state network | |
| CN107864100A (en) | Network link flow equalization method and computer-readable storage medium | |
| JP6650287B2 (en) | Communication path control device, communication path control method, and communication path control program | |
| US20120063362A1 (en) | Method and apparatus for computing paths to destinations in networks having link constraints | |
| JP5060513B2 (en) | AC traffic estimation device, AC traffic estimation method and program thereof | |
| US20140269737A1 (en) | System, method and apparatus for lsp setup using inter-domain abr indication | |
| US12107755B2 (en) | Method and a device for routing traffic along an IGP shortcut path | |
| Norvor et al. | Dynamic Routing Implementation Decision between OSPFv3 and IS–IS in IPv6 Networks | |
| Amaral | Multipath inter-domain policy 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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180330 |
|
| RJ01 | Rejection of invention patent application after publication |