CN103188165A - Intelligent router multipath output load balancing method and router - Google Patents
Intelligent router multipath output load balancing method and router Download PDFInfo
- Publication number
- CN103188165A CN103188165A CN2013100771086A CN201310077108A CN103188165A CN 103188165 A CN103188165 A CN 103188165A CN 2013100771086 A CN2013100771086 A CN 2013100771086A CN 201310077108 A CN201310077108 A CN 201310077108A CN 103188165 A CN103188165 A CN 103188165A
- Authority
- CN
- China
- Prior art keywords
- route
- interface
- router
- bar
- load balancing
- 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.)
- Granted
Links
Images
Abstract
The invention discloses an intelligent router multipath output load balancing method and a router. The method comprises the following steps of: respectively setting weight numbers for a plurality of links of the router, carrying out load balancing according to the weight numbers, appointing the next hop to determine an outlet of flow, periodically and automatically metering the mean remaining bandwidth of each line, and updating the weight number of each line to dynamically adapt to the busy-idle change of the lines, so that the router can dynamically adjust the weight numbers according to the real-time flow on each line to reasonably distribute the different flows onto the proper line; and therefore, the defect that the flow has a fixed line regardless of busyness and idleness in the conventional multiple lines can be overcome, the use ratio of the line bandwidth can be greatly improved, and the internet surfing experience can be greatly improved.
Description
Technical field
The present invention relates to communication technique field, relate in particular to a kind of method and router of router multipath output intelligent load balancing.
Background technology
Fig. 1 is a kind of networking structure that can realize load balancing, and this kind networking model is usually used in occasions such as Internet bar, hotel, school, residential quarter access.A plurality of user terminals are by multilink access web server such as link 1, links 2, because multilink connects identical broadband router, arrive the webserver from broadband router and can generate many equal-cost links, be i.e. many routes that cost is identical.In the prior art, the data that the come from same user terminal same link that flows away makes all data flow of each user terminal walk the same interface that identical link arrives the webserver.This kind implementation is by collocation strategy route on broadband router, the user terminal outgoing interface is arranged, but this kind mode strategy route is used variation complicated and can't the dynamically adapting network configuration, just needs be configured tactful route again in case network configuration changes; In addition, the access to netwoks problem that network availability risk that the single line fault brings and network bandwidth deficiency are brought appears in this kind mode easily, so the user tends to rent many circuits.In the face of multi situation, the user needs rationally to use the function of many circuits, make the data flow that comes from same user terminal carry out load balancing at broadband router, be a part of data link 1, a part of data links 2 that flow away that flow away, part data can be selected other equal-cost links, neither cause the waste of line resource, can realize the lifting of network service quality again.
Summary of the invention
The technical problem to be solved in the present invention is method and the router that proposes a kind of router multipath output intelligent load balancing, to solve the access to netwoks problem that network availability risk that the single line fault brings and network bandwidth deficiency are brought.
A kind of method of router multipath output intelligent load balancing comprises the steps:
Obtain data flow to be transmitted;
If described data flow does not match state table, and when having the identical route of N bar priority, calculate the current weight of described N bar route, and upgrade all corresponding routing metrics of each interface;
According to the current weight of described N bar route, specify next jumping, set up state table;
Transmit data from specifying outgoing interface;
Wherein, described N is the integer more than or equal to 2, and the identical route of described N bar priority comprises network segment route or default route.
Further, this method current weight of the described N bar of interval calculation route to schedule.
The initial weight of the N bar route that further, described priority is identical is directly proportional with the downlink bandwidth of respective links configuration interface.
4, the method for router multipath according to claim 2 output intelligent load balancing is characterized in that, the current weight of the described N bar of described interval calculation to schedule route comprises,
S1: the downlink bandwidth that disposes every route corresponding interface;
S2: initial time is set, picks up counting from described initial time, arrive predetermined time interval, trigger timer and interrupt, calculate the average downlink bandwidth of every route corresponding interface in described predetermined time interval;
S3: calculate every current average residual downlink bandwidth of route corresponding interface, described current average residual downlink bandwidth deducts average downlink bandwidth corresponding in the predetermined time interval by every route corresponding interface configurating downlink bandwidth and obtains;
S4: according to the average residual downlink bandwidth of every route corresponding interface, obtain the current weight of every route according to ratio, upgrade all corresponding routing metrics of each interface, execution in step S2.
Further, all corresponding routes of described each interface comprise,
The direct-connected route that is in the same network segment with interface is jumped all routes that are in the same network segment with interface with next.
Further, described current weight according to described N bar route is specified next jumping, and set up state table and comprise,
Add up the current weight of described N bar route;
At first select minimum weights from described weights, weights addition successively of each selection from the residue weights then generates a data formation, generates a formation that comprises N adjacent interval according to described data queue;
Generate a random number, search the residing interval of described random number, jump next jumping as the data flow transmission with next of described interval maximum correspondence;
According to designated size in the data flow, set up state table, the record outgoing interface;
Wherein, described random number is the arbitrary value in the data queue that generates.
Further, designated size comprises that the IP that the source IP of packet and purpose IP form is right in the described data flow; Perhaps, the five-tuple information of the protocol type of packet, destination address, destination interface, source address and source port composition.
Further, if described data flow matches state table, send out packet according to next redirect of state table appointment.
Correspondingly, the present invention also discloses a kind of router, and described router comprises,
Acquisition module is used for obtaining data flow to be transmitted;
Matching module is used for waiting transmitting data flow and the state table list item mates;
First computing module is used for not matching state table when described data flow, and when having the identical route of N bar priority, calculates the current weight of described N bar route;
Update module is used for upgrading all corresponding routing metrics of each interface according to the current weight of described N bar route;
Second computing module is used for the current weight according to described N bar route, specifies next jumping, sets up state table;
Forwarding module is used for from specifying outgoing interface to transmit data;
Wherein, described N is the integer more than or equal to 2, and described route entry comprises network segment route or default route.
Further, described update module be used for to be upgraded all routing metrics under each interface, and described all route entrys comprise and are in the direct-connected route of the same network segment with interface and next jumps all routes that are in the same network segment with interface.
Technical scheme of the present invention is by arranging weights respectively for router multiple exit circuit, be foundation with weights, decide the outlet of flow by load-balancing algorithm, and regularly calculate the remaining bandwidth of each bar circuit automatically, upgrade the weights of each bar circuit, dynamic busy not busy variation that adapts to circuit, thereby the lifting of realization network service quality.
Description of drawings
Fig. 1 is a kind of networking structure schematic diagram of realizing load balancing;
The router multipath that Fig. 2 provides for the embodiment of the invention is exported the method flow diagram of intelligent load balancing;
Fig. 3 is the method flow diagram of current weight of the calculating N bar route entry of the embodiment of the invention;
Fig. 4 is the method flow diagram of the load-balancing algorithm of the embodiment of the invention;
The structured flowchart of the router that Fig. 5 provides for the embodiment of the invention.
Embodiment
By describing technology contents of the present invention in detail, being realized purpose and effect, described in detail below in conjunction with execution mode and conjunction with figs..
The router multipath that Fig. 2 provides for the embodiment of the invention is exported the method flow diagram of intelligent load balancing.As shown in Figure 2, this method comprises the steps:
Step 101: obtain data flow to be transmitted.
Each user terminal to transmit data flows to broadband router, waits for that broadband router forwards the data to destination address.
Step 102: judge and describedly wait to transmit data flow and whether match state table, if, execution in step 107; Otherwise, execution in step 103.
Comprise the user terminal characteristics information of interrelated preservation in the state table list item and corresponding to the outgoing interface information of many equal-cost links of broadband router.Described user terminal characteristics information refers to can unique identification send the terminal use's of data flow information, is used for being different from the other-end user.Source IP address of carrying of data flow etc. for example.Outgoing interface is for being used for transmitting the outgoing interface sign of data flow, perhaps being outgoing interface sign and next jumping routing address.For some virtual interface, can't determine to transmit the physical address of data flow by interface identifier, need that in this case outgoing interface and next are jumped routing address and bind to determine the actual physical port.
Step 103: data flow described to be transmitted matches the identical route of N bar priority, and the identical route of described N bar priority comprises network segment route or default route.
The route entry that described priority is identical refers to the equal-cost route more than two or two, can get to reach destination address and the approximately uniform route of cost.If there is no many routes that priority is identical also just can't realize load balancing.If just can determine all only to send to a destination address from all messages of different terminals according to concrete network topology structure, then certainly exist the identical route of N bar priority, need not mate under this kind situation yet.
Step 104: calculate the current weight of described N bar route, and upgrade all corresponding routing metrics under each interface.
The initial weight of the N bar route entry that described priority is identical is directly proportional with the downlink bandwidth of corresponding line configuration interface.Also can be described as with the capacity of corresponding line configuration interface link and be directly proportional or be directly proportional with speed.
Calculating the current weight of described N bar route entry can carry out according to the time that the user arranges.There is not the restriction of strictness for the time interval.In order to realize conveniently, the current weight of the described N bar of interval calculation route entry to schedule in the present embodiment.Fig. 3 is the method flow diagram of current weight of the calculating N bar route entry of the embodiment of the invention, and idiographic flow comprises:
Step 1041: the downlink bandwidth that disposes every route corresponding interface;
The downlink bandwidth of every route entry corresponding interface can arrange according to user's needs, also can directly distribute according to the router initial value.The interface downlink bandwidth determines that routing metric is determined value just also under the interface.After the router initialization, the downlink bandwidth of every route entry weights and corresponding interface configuration is proportional.
Step 1042: a timer is enabled by system, initial time and timing is set at interval.
Step 1043: pick up counting from described initial time, arrive predetermined time interval, trigger timer and interrupt.
Step 1044: calculate each bar route institute corresponding interface at the average downlink bandwidth of a timer in the cycle.
Step 1045: calculate every current average residual downlink bandwidth of route entry corresponding interface.
Described current average residual downlink bandwidth deducts average downlink bandwidth corresponding in the predetermined time interval by every route entry corresponding interface configurating downlink bandwidth and obtains.
Step 1046: according to the average residual downlink bandwidth of every route entry corresponding interface, obtain the current weight of every route entry according to ratio.
Described current routing metric is the ratio of current each interface average residual downlink bandwidth, that is to say, each current average residual downlink bandwidth of each interface that calculates all will obtain each route current weight according to average residual downlink bandwidth ratio, and the span of described current routing metric is 1 to 1000.
Step 1047: upgrade all corresponding routing metrics of each interface, execution in step 1042.
Step 105: according to described N bar route entry current weight, specify next jumping, set up state table.
This step utilizes load-balancing algorithm to specify next jumping, sets up state table.Fig. 4 is the method flow diagram of the load-balancing algorithm of the embodiment of the invention.This method specifically comprises:
Step 1051: the current weight of adding up described N bar route entry.
Step 1052: at first select minimum weights from described weights, weights addition successively of each selection from the residue weights then generates a data formation, generates a formation that comprises N adjacent interval according to described data queue.For example, the weights of N bar route entry are respectively k1, k2, k3......kn; Select minimum weights k1 and represent with X1, select one arbitrarily then from remaining weights, the weights X1 addition with described minimum obtains X2; From remaining weights, select one arbitrarily then, with the X2 addition, obtain X3, by that analogy, obtain the data queue of X1, an X2, X3......Xn, generate the interval formation that comprises N adjacent interval, i.e. [0 X1], [X1 X2], [X2X3] according to described data queue ... [Xn-1 Xn].
Described step 1052 is a concrete example just.The process that comprises the formation of N adjacent interval for generation, select first weights can be in the weights of N bar route entry any one, represent with X1, from remaining weights, select one arbitrarily then, weights X1 addition with described minimum obtains X2; From remaining weights, select one arbitrarily then, with the X2 addition, obtain X3, by that analogy ..., the value of the adjacent interval of Xing Chenging may be different like this, but only need change the scope of follow-up generation random number, can realize load balancing equally.
Step 1053: generate a random number, search the residing interval of described random number, jump next jumping as the data flow transmission with next of described interval maximum correspondence.
Generate a random number P, the span of P is 1 to Xn; Search P and be in which interval, find corresponding interval to jump next jumping of appointment as stream with next of this interval maximum correspondence, set up state table, record outgoing interface.Described random number P can adopt the random number generating algorithm to obtain.
Here be noted that next jumping of P interval maximum of living in correspondence namely obtains the routing metric of this maximum correspondence, selects this route to jump as next.
Step 1054: according to designated size in the data flow, set up state table, the record outgoing interface.
Designated size comprises that the IP that the source IP of packet and purpose IP form is right in the described data flow; Perhaps, the five-tuple information of the protocol type of packet, destination address, destination interface, source address and source port composition.In the described state table list item user terminal data bag of the interrelated preservation of record source IP and the outgoing interface information of IP pair of forming of purpose IP and many equal-cost links of router; Perhaps record protocol type, destination address, destination interface, source address and the five-tuple information of source port composition and the outgoing interface information of many equal-cost links of router of the user terminal data bag of interrelated preservation.
Step 106: transmit data from specifying outgoing interface.
Find corresponding outgoing interface according to designated size in the data flow, send data.
Step 107: packet is sent out in next redirect according to the state table appointment.
Particularly, suppose in networking structure shown in Figure 1 that 3 interfaces of broadband router configuration form 3 route entrys that priority is identical to the webserver, represent with link 1, link 2 and link 3 respectively.The downlink bandwidth of pre-configured 3 interfaces is respectively 10M, 20M and 30M, and under the situation that 3 route entrys all come into force, the weights of 3 route entrys are represented with 1,2 and 3 respectively.If broadband router gets access to 6 data flow, event data stream matches state table, and meeting is transmitted data according to the routing link of the outgoing interface correspondence of state table appointment; Event data stream does not match state table, need distribute described data to flow on certain bar link according to the weights of 3 route entrys and transmit.After the router initialization, the bandwidth of 3 route entrys is identical with pre-configured corresponding interface bandwidth.Under default situations, the weights that 6 data fail to be convened for lack of a quorum according to 3 route entrys distribute, and namely weights are that 3 routing link distributes 3 data flow, and weights are that 2 routing link distributes 2 data flow, and weights are that 1 routing link distributes 1 data flow.
In a single day broadband router receives data and begins to transmit data, flow under each interface can change constantly, transfer of data is constantly to carry out, when the continuous receiving data stream of broadband router, the weighted value of 3 route entrys is engraved in variation when being, sometime, the link that has may be in idle condition, the link that has may be in busy condition, ideally, is to wait that transmitting distribution of flows transmits to the link of free time.Therefore, need the weights of current route entry be recomputated.Adopt in the present embodiment to schedule at interval, calculate 3 route entry current weight, and upgrade all corresponding routing metrics under each interface, according to the current weight of 3 route entrys, according to load-balancing algorithm, specify next jumping, set up state table, the record outgoing interface; Transmit data from specifying outgoing interface.
With instantiation load-balancing algorithm is described below:
Article 3, the initial weight of route entry is respectively 1,2,3; Select minimum weights 1 usefulness X1 and represent that select any one then from remaining weights, as select 3, the weights X1 addition with described minimum obtains X2, namely 4; From remaining weights, select remaining one then, with the X2 addition, obtain X3, namely 6, like this, obtain the data queue of X1, an X2, X3, namely 1,4,6.Generate an interval formation that comprises 3 adjacent intervals, i.e. [0 1], [1 4], [4 6] according to described data queue.Generate a random number between 1 to 6 then, be 5 as random number, search the interval that random number 5 is in [4 6], maximum 6 according to this interval correspondence, next jumping that can obtain described maximum 6 correspondences is the second routing link, record this routing interface, set up state table.According to designated size in the data flow, transmit data for described second routing link.After reaching predetermined time interval, need recomputate the average residual bandwidth of current route entry corresponding interface, according to each bar routing metric of described average residual bandwidth calculation, according to load-balancing algorithm data stream is distributed.
The structured flowchart of the router that Fig. 5 provides for the embodiment of the invention.As shown in Figure 5, described router comprises,
Acquisition module 501 is used for obtaining data flow to be transmitted.Each user terminal to transmit data flows to broadband router, waits for that broadband router forwards the data to destination address.
Matching module 502 is used for that described band is transmitted data flow and the state table list item mates.
Update module 504 is used for upgrading all corresponding routing metrics of each interface according to the current weight of described N bar route entry.All routes comprise and are in the direct-connected route of the same network segment with interface and next jumps all routes that are in the same network segment with interface under described each interface.
Forwarding module 506 is used for from specifying outgoing interface to transmit data;
Wherein, described N is the integer more than or equal to 2, and described route entry comprises network segment route or default route.
Technical scheme of the present invention, by for router multiple exit circuit weights being set respectively, be foundation with weights, decide the outlet of flow by load-balancing algorithm, and regularly calculate the remaining bandwidth of each bar circuit automatically, upgrade the weights of each bar circuit, dynamic busy not busy variation that adapts to circuit makes router dynamically to adjust weight according to real-time traffic on each bar circuit, the reasonable distribution different flow is to suitable circuit, overcome in traditional multi-line, no matter the line be busy spare time, flow is all walked the drawback of fixed line, improved the line bandwidth utilance greatly, and improved online greatly and experienced.
Above-mentioned only is preferred embodiment of the present invention and institute's application technology principle, anyly is familiar with those skilled in the art in the technical scope that the present invention discloses, and the variation that can expect easily or replacement all should be encompassed in protection scope of the present invention.
Claims (10)
1. the method for a router multipath output intelligent load balancing is characterized in that, comprises the steps:
Obtain data flow to be transmitted;
If described data flow does not match state table, and when having the identical route of N bar priority, calculate the current weight of described N bar route, and upgrade all corresponding routing metrics of each interface;
According to the current weight of described N bar route, specify next jumping, set up state table;
Transmit data from specifying outgoing interface;
Wherein, described N is the integer more than or equal to 2, and the identical route of described N bar priority comprises network segment route or default route.
2. the method for router multipath output intelligent load balancing according to claim 1 is characterized in that this method is the current weight of the described N bar of interval calculation route to schedule.
3. the method for router multipath output intelligent load balancing according to claim 1 is characterized in that the initial weight of the N bar route that described priority is identical is directly proportional with the downlink bandwidth of respective links configuration interface.
4. the method for router multipath according to claim 2 output intelligent load balancing is characterized in that, the current weight of the described N bar of described interval calculation to schedule route comprises,
S1: the downlink bandwidth that disposes every route corresponding interface;
S2: initial time is set, picks up counting from described initial time, arrive predetermined time interval, trigger timer and interrupt, calculate the average downlink bandwidth of every route corresponding interface in described predetermined time interval;
S3: calculate every current average residual downlink bandwidth of route corresponding interface, described current average residual downlink bandwidth deducts average downlink bandwidth corresponding in the predetermined time interval by every route corresponding interface configurating downlink bandwidth and obtains;
S4: according to the average residual downlink bandwidth of every route corresponding interface, obtain the current weight of every route according to ratio, upgrade all corresponding routing metrics of each interface, execution in step S2.
5. the method for router multipath according to claim 1 output intelligent load balancing is characterized in that, all corresponding routes of described each interface comprise,
The direct-connected route that is in the same network segment with interface is jumped all routes that are in the same network segment with interface with next.
6. the method for router multipath output intelligent load balancing according to claim 1 is characterized in that described current weight according to described N bar route is specified next jumping, set up state table and comprise,
Add up the current weight of described N bar route;
At first select minimum weights from described weights, weights addition successively of each selection from the residue weights then generates a data formation, generates a formation that comprises N adjacent interval according to described data queue;
Generate a random number, search the residing interval of described random number, jump next jumping as the data flow transmission with next of described interval maximum correspondence;
According to designated size in the data flow, set up state table, the record outgoing interface;
Wherein, described random number is the arbitrary value in the data queue that generates.
7. the method for router multipath according to claim 6 output intelligent load balancing is characterized in that, designated size comprises that the source IP of packet and the IP that purpose IP forms are right in the described data flow; Perhaps, the five-tuple information of the protocol type of packet, destination address, destination interface, source address and source port composition.
8. the method for router multipath output intelligent load balancing according to claim 1 and 2 is characterized in that, if described data flow matches state table, sends out packet according to next redirect of state table appointment.
9. a router is characterized in that, described router comprises,
Acquisition module is used for obtaining data flow to be transmitted;
Matching module is used for waiting transmitting data flow and the state table list item mates;
First computing module is used for not matching state table when described data flow, and when having the identical route of N bar priority, calculates the current weight of described N bar route;
Update module is used for upgrading all corresponding routing metrics of each interface according to the current weight of described N bar route;
Second computing module is used for the current weight according to described N bar route, specifies next jumping, sets up state table;
Forwarding module is used for from specifying outgoing interface to transmit data;
Wherein, described N is the integer more than or equal to 2, and described route entry comprises network segment route or default route.
10. router according to claim 9, it is characterized in that, described update module be used for to be upgraded all routing metrics under each interface, and described all route entrys comprise and are in the direct-connected route of the same network segment with interface and next jumps all routes that are in the same network segment with interface.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310077108.6A CN103188165B (en) | 2013-03-12 | 2013-03-12 | A kind of router multipath exports method and the router of intelligent load equilibrium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310077108.6A CN103188165B (en) | 2013-03-12 | 2013-03-12 | A kind of router multipath exports method and the router of intelligent load equilibrium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103188165A true CN103188165A (en) | 2013-07-03 |
| CN103188165B CN103188165B (en) | 2016-06-01 |
Family
ID=48679136
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310077108.6A Active CN103188165B (en) | 2013-03-12 | 2013-03-12 | A kind of router multipath exports method and the router of intelligent load equilibrium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103188165B (en) |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103595649A (en) * | 2013-11-21 | 2014-02-19 | 迈普通信技术股份有限公司 | Method and system for achieving load balance |
| CN104506359A (en) * | 2014-12-25 | 2015-04-08 | 迈普通信技术股份有限公司 | Router mode identification method and router |
| WO2015123985A1 (en) * | 2014-02-24 | 2015-08-27 | 中兴通讯股份有限公司 | Method and device for adjusting load balancing, and computer storage medium |
| CN105830404A (en) * | 2013-12-17 | 2016-08-03 | 思科技术公司 | Method for implicit session routing |
| CN106302168A (en) * | 2016-09-18 | 2017-01-04 | 东软集团股份有限公司 | A kind of ISP route selecting method, device and gateway |
| WO2017016360A1 (en) * | 2015-07-30 | 2017-02-02 | 华为技术有限公司 | Bandwidth adjustment method and related device |
| CN107241270A (en) * | 2017-04-20 | 2017-10-10 | 北京安博通科技股份有限公司 | Message processing method and device |
| CN107317766A (en) * | 2017-03-17 | 2017-11-03 | 深圳市磊科实业有限公司 | A kind of intelligent load strategy of many WAN mouthfuls of network equipments |
| CN107896190A (en) * | 2017-12-26 | 2018-04-10 | 新华三技术有限公司 | It route system of selection, device and the routing device of outgoing interface |
| CN108322388A (en) * | 2018-01-31 | 2018-07-24 | 新华三技术有限公司 | A kind of message forwarding method and device |
| CN108337184A (en) * | 2018-01-11 | 2018-07-27 | 山石网科通信技术有限公司 | Flow equalization dispatching method and device |
| CN108933737A (en) * | 2017-05-26 | 2018-12-04 | 中兴通讯股份有限公司 | Load-balancing method and device |
| CN111800827A (en) * | 2020-06-15 | 2020-10-20 | 深圳市信锐网科技术有限公司 | Data transmission method, device and storage medium |
| CN112910988A (en) * | 2021-01-28 | 2021-06-04 | 网宿科技股份有限公司 | Resource acquisition method and resource scheduling device |
| CN114553760A (en) * | 2020-11-25 | 2022-05-27 | 华为技术有限公司 | Path weight distribution method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2004017650A2 (en) * | 2002-08-19 | 2004-02-26 | Soma Networks, Inc. | Scheduler for a shared channel |
| CN1859276A (en) * | 2005-07-27 | 2006-11-08 | 华为技术有限公司 | Multiple port path selecting method for network equipment |
| CN101184049A (en) * | 2007-12-12 | 2008-05-21 | 中兴通讯股份有限公司 | Dynamic load sharing method and system |
| CN102761601A (en) * | 2012-05-30 | 2012-10-31 | 浪潮电子信息产业股份有限公司 | MPIO (Multiple Path Input/Output) polling method based on dynamic weighting paths |
-
2013
- 2013-03-12 CN CN201310077108.6A patent/CN103188165B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2004017650A2 (en) * | 2002-08-19 | 2004-02-26 | Soma Networks, Inc. | Scheduler for a shared channel |
| CN1859276A (en) * | 2005-07-27 | 2006-11-08 | 华为技术有限公司 | Multiple port path selecting method for network equipment |
| CN101184049A (en) * | 2007-12-12 | 2008-05-21 | 中兴通讯股份有限公司 | Dynamic load sharing method and system |
| CN102761601A (en) * | 2012-05-30 | 2012-10-31 | 浪潮电子信息产业股份有限公司 | MPIO (Multiple Path Input/Output) polling method based on dynamic weighting paths |
Cited By (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103595649A (en) * | 2013-11-21 | 2014-02-19 | 迈普通信技术股份有限公司 | Method and system for achieving load balance |
| CN105830404A (en) * | 2013-12-17 | 2016-08-03 | 思科技术公司 | Method for implicit session routing |
| CN105830404B (en) * | 2013-12-17 | 2019-10-15 | 思科技术公司 | Method for implicit session routing |
| WO2015123985A1 (en) * | 2014-02-24 | 2015-08-27 | 中兴通讯股份有限公司 | Method and device for adjusting load balancing, and computer storage medium |
| CN104506359A (en) * | 2014-12-25 | 2015-04-08 | 迈普通信技术股份有限公司 | Router mode identification method and router |
| CN104506359B (en) * | 2014-12-25 | 2018-01-30 | 迈普通信技术股份有限公司 | A kind of route pattern knows method for distinguishing and router |
| WO2017016360A1 (en) * | 2015-07-30 | 2017-02-02 | 华为技术有限公司 | Bandwidth adjustment method and related device |
| US10855618B2 (en) | 2015-07-30 | 2020-12-01 | Huawei Technologies Co., Ltd. | Bandwidth adjustment method and related device |
| CN106302168B (en) * | 2016-09-18 | 2019-09-24 | 东软集团股份有限公司 | A kind of ISP route selecting method, device and gateway |
| CN106302168A (en) * | 2016-09-18 | 2017-01-04 | 东软集团股份有限公司 | A kind of ISP route selecting method, device and gateway |
| CN107317766B (en) * | 2017-03-17 | 2020-07-28 | 深圳市网是科技有限公司 | Intelligent load method of multi-WAN-port network equipment |
| CN107317766A (en) * | 2017-03-17 | 2017-11-03 | 深圳市磊科实业有限公司 | A kind of intelligent load strategy of many WAN mouthfuls of network equipments |
| CN107241270A (en) * | 2017-04-20 | 2017-10-10 | 北京安博通科技股份有限公司 | Message processing method and device |
| CN108933737A (en) * | 2017-05-26 | 2018-12-04 | 中兴通讯股份有限公司 | Load-balancing method and device |
| CN107896190A (en) * | 2017-12-26 | 2018-04-10 | 新华三技术有限公司 | It route system of selection, device and the routing device of outgoing interface |
| CN108337184A (en) * | 2018-01-11 | 2018-07-27 | 山石网科通信技术有限公司 | Flow equalization dispatching method and device |
| CN108322388A (en) * | 2018-01-31 | 2018-07-24 | 新华三技术有限公司 | A kind of message forwarding method and device |
| CN108322388B (en) * | 2018-01-31 | 2022-03-01 | 新华三技术有限公司 | Message forwarding method and device |
| CN111800827A (en) * | 2020-06-15 | 2020-10-20 | 深圳市信锐网科技术有限公司 | Data transmission method, device and storage medium |
| CN111800827B (en) * | 2020-06-15 | 2023-07-14 | 深圳市信锐网科技术有限公司 | Data transmission method, device and storage medium |
| CN114553760A (en) * | 2020-11-25 | 2022-05-27 | 华为技术有限公司 | Path weight distribution method and device |
| CN114553760B (en) * | 2020-11-25 | 2023-05-16 | 华为技术有限公司 | Path weight distribution method and device |
| CN112910988A (en) * | 2021-01-28 | 2021-06-04 | 网宿科技股份有限公司 | Resource acquisition method and resource scheduling device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103188165B (en) | 2016-06-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103188165A (en) | Intelligent router multipath output load balancing method and router | |
| CN103152284A (en) | Method for balancing multipath output intelligent loads of router and router | |
| CN103650435B (en) | Routing traffic method of adjustment, device and controller | |
| Long et al. | LABERIO: Dynamic load-balanced routing in OpenFlow-enabled networks | |
| CN101001200B (en) | Flow engineering full network counting method and system between regions | |
| CN105323099B (en) | Business network flowmeter factor method, network resource scheduling method and network element | |
| CN106063195A (en) | Control device discovery in networks having separate control and forwarding devices | |
| CN104871490B (en) | The multipath communication device of energy ecology and its method for distributing business for improving energy ecology can be improved | |
| CN104468353A (en) | SDN based data center network flow management method | |
| WO2009078427A1 (en) | Path control method and node | |
| CN102223303A (en) | Load equilibrium method based on transparent interconnection of lots of links (TRILL) and routing bridge (RB) | |
| CN101094185A (en) | Method and device for forwarding message based on multilink | |
| CN104301417B (en) | A kind of load-balancing method and device | |
| CN109787801A (en) | A kind of network service management methods, devices and systems | |
| CN103428103A (en) | Link load control method and stacking device | |
| CN105337870A (en) | Route publishing method and device | |
| CN101001203A (en) | Route selection method and device | |
| CN101355521B (en) | Control method for equalizing load, communication apparatus and communication system | |
| CN102098740A (en) | Link aggregation routing method and device | |
| CN102932268A (en) | Data packet transmitting method and device | |
| CN102025632B (en) | Label distribution method and system for data packets in MPLS network | |
| CN106453121B (en) | A kind of link dynamic load configuration method, system and server | |
| Khoshkholghi et al. | Edge intelligence for service function chain deployment in NFV-enabled networks | |
| CN101651598A (en) | Method and device for allocating network resources | |
| CN102448120B (en) | Multipath load sharing method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C53 | Correction of patent of invention or patent application | ||
| CB03 | Change of inventor or designer information |
Inventor after: Wei Yuanshou Inventor after: Xiang Yangchao Inventor before: Wei Yuanshou |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: INVENTOR; FROM: WEI YUANSHOU TO: WEI YUANSHOU XIANG YANGCHAO |
|
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |