CN100417138C - Load sharing method - Google Patents
Load sharing method Download PDFInfo
- Publication number
- CN100417138C CN100417138C CNB2005101016826A CN200510101682A CN100417138C CN 100417138 C CN100417138 C CN 100417138C CN B2005101016826 A CNB2005101016826 A CN B2005101016826A CN 200510101682 A CN200510101682 A CN 200510101682A CN 100417138 C CN100417138 C CN 100417138C
- Authority
- CN
- China
- Prior art keywords
- path
- traffic identifier
- load balancing
- stream
- routes
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The present invention discloses a load sharing method. When a next hop route of a message received by a communication device is more than one, the number of needed streams is obtained according to a number value shared by maximum loads supported by the communication device and stream identities are allocated to each stream. Each stream identity value is only corresponding to one definite next hop route, and therefore, routes can directly select the route identities without reading threshold values to determine the corresponding route identities, and therefore, the present invention avoids a performance bottleneck of accessing the same memory due to reading the threshold values. Therefore, the load sharing method of the present invention is suitable to be used by high-speed devices, and simultaneously, when the routes change to cause the number of the next hop routes to increase or decrease, the corresponding relation of the stream identities and the routes can be changed according to a principle that the stream identities can minimally change the number of the routes to solve the problem in the prior art that a large number of streams are disorderly brought when load sharing routes are added or deleted. In addition, the present invention can also solve the problem of unequal load sharing.
Description
Technical field
The present invention relates to the communications field, especially relate to a kind of method of load balancing.
Background technology
In real network, owing to the topological relation more complicated between the node, the situation on many roads appears having to a destination through regular meeting.Many the road may be able to arrive, and is reciprocity each other, promptly all can form route.Just have many equal-cost routes like this occurs to a destination.
As shown in Figure 1, to R8, San Tiaolu can be arranged from node R 1, if route is calculated these three roads be treated as equal-cost route, so at the R1 node, a message just faces three selections.
Article one, road: R1-" R2-" R3-" R4-" R8
Second road: R1-" R5-" R8
Article three, road: R1-" R6-" R7-" R8
For online flow, in order to realize link backup or to enlarge flow, also can adopt the mode of sharing sometimes, promptly go to same place and mulitpath can occur, all there is flow to exist on many roads, be traffic sharing, i.e. load balancing each other.First target of load balancing is the equilibrium that as far as possible flow is divided, and a plurality of links can play one's part to the full.
Load balancing all can occur in a lot of places.On our modal ip router, perhaps on the switching equipment of label switched path (LSP).
In next generation network, the scheme that the many nets that adopt merge, promptly throw the net and transmit multiple business on the network one, may have one or more path for same next hop router occurs, if be fitted on the different paths for same flow point, the notion of same stream is from same source and goes to same destination, and the set of the packet of some common traits is arranged, because the number of nodes difference of different path processes, the transport link distance difference of process, the Congestion Level SPCC of different nodes is greatly little different with buffer memory, can cause the time delay in different paths also different, this moment is same to flow to the time that reaches the destination and just difference may occur, may occur out of order.
For the flow that uses transmission control protocol (TCP) to transmit, out of orderly can be considered to message dropping in destination node, can occur retransmitting, cause the network flow quantitative change big, serious meeting the TCP disconnection occurs and connects.Simultaneously if the real time business that transmits, such as internet voice communication (Voice Over IP; VOIP), for the terminal use, speech quality can not be stood, and intermittent or unclear phenomenon can occur.
Therefore, in next generation network, when router was transmitted, using same path to transmit same stream was a very important characteristic.Therefore second requirement of load balancing is that same stream can not occur out of order.
At present, prior art is to realize the method for load balancing according to stream, the Hash threshold algorithm that it has utilized D.Thaler to propose.The Hash threshold algorithm is by Hash is carried out in the territory in the heading, and the hash value that obtains generally uses source IP address and purpose IP address to carry out Hash as the sign of stream for the IP message.When load balancing, hash algorithm can adopt the algorithm of CRC16 to carry out.
When load balancing, hash value is provided with a plurality of thresholdings, such as 8 equal-cost routes are arranged, hash value is 0～65535, and so just with 0～65535 eight equal parts, hash value drops in first interval, just walk article one road, hash value drops in n the interval and just walks n bar road.
When needing to increase the path owing to the route variation, revise threshold value simultaneously, such as becoming 4 paths, use 65535 so, and then multiply by the interval that n has just obtained the n paths divided by 4 from 3 paths.Be described as follows:
Supposing has 3 equal-cost routes (3 next jumpings) originally, and its threshold setting is as follows:
Increase next jumping now, become 4 next jumpings, this moment, the variation of the relations of distribution was as follows:
So just realized load balancing according to stream.
In the prior art, jump more for a long time,, in high-speed equipment, can occur visit competition so, cause occurring bottleneck, so that the performance of high-speed equipment is difficult to accomplish is very high a certain fast memory block because all will read the Hash thresholding at every turn in next of load balancing.Simultaneously, because the variation of route, jump when needing to increase the deletion path, a large amount of streams can occur and change paths, cause potential unnecessary out of order in a large number at next.Describe this problem below in detail.
Traffic identifier (ID) scope that wherein changes next jumping is as follows, wherein the grey color part part in path for a change among the figure.
The ratio that changes the stream in path altogether is:
((65535-49151)+(43690-32767)+21845-16383))/65536＝50％
But when we have increased a paths (next jumping), only need at most 25% flow and change the path and to this road, get final product, that is to say that the flow of 50%-25%=25% does not need to change the path.
Change the path, just mean that these streams may occur out of order in the time period of switching.We can see by above-mentioned example, make in this way, except the flow that needs switch, also have the flow of significant proportion to be switched the path by mistake, have occurred unnecessary out of order.Out of orderly will bring re-transmission,, just mean that quality occurring descends for voice etc. for the TCP flow.This problem is reducing path (when next is jumped) existence too.
Summary of the invention
In view of this, main purpose of the present invention is that a kind of method of load balancing is being provided, and makes when realizing load balancing, can optimize the handling property of high-speed equipment, the out of order problem of vast scale mistake that is caused when solving owing to path change simultaneously.
The invention provides a kind of method of load balancing, specifically comprise the steps,
A. when next of communication equipment received packet jumped path more than one, next jumps the quantitative value that maximum support path number obtains required stream according to communication equipment is supported, and be each flow distribution traffic identifier, the quantitative value of described stream more than or equal to described next jump maximum support path number.
B. communication equipment makes each flow unique corresponding next definite jumping path according to the destination address and the described traffic identifier of described message;
C. communication equipment carries out the load balancing forwarding of described message according to described next jumping path.The quantitative value that flows in the described steps A be 1 to next jump the common multiple of maximum support path number.
The quantitative value of the stream in the described steps A, according to the error requirements of assignment of traffic ratio, get near 1 to next jump the value of 2 whole power of the common multiple of maximum support path number.
Described traffic identifier is that the content according to the territory of described heading draws by hash algorithm.
The territory of described heading comprises one of source address, destination address, message life span, source port number, destination slogan, protocol type or combination in any.
Described step B specifically comprises,
B1, the load balancing table is set in the routing table of route, described load balancing table comprises that traffic identifier and next jump sign;
B2, communication equipment are searched next jumping path according to the destination address and the described traffic identifier of described message in described load balancing table.
Traffic identifier described in the step B and next are jumped in the corresponding relation in path, and corresponding one or more traffic identifier are come according to the required flow proportional of sharing in different paths in described next jumping path.
When the path need delete or increase, revise the corresponding relation in traffic identifier and path according to described ratio.
Also comprise according to described traffic identifier and change the minimum corresponding relation that changes traffic identifier and path of number of path.
Described next jump maximum support path number when changing, recomputate the quantity of stream and draw traffic identifier, and want the pairing load balancing table of initialization load balancing traffic identifier and path.
As seen from the above technical solution provided by the invention, by being carried out Hash, the data message obtains limited traffic identifier, and unique corresponding definite next of each traffic identifier value is jumped the path, like this route its can directly choose ID of trace route path, determine corresponding ID of trace route path thereby need not read threshold value.Threshold value causes for reading of like this, just avoiding to visiting the performance bottleneck of the high-speed equipment that same internal memory bring.So being fit to high-speed equipment, uses load sharing method of the present invention.Simultaneously, when next that bring when changing owing to route jumped path increase or minimizing, change the path of traffic identifier and can solve in the prior art when the additions and deletions load balancing path by change the minimum principle of number of path according to traffic identifier, the a large amount of outflows that bring now miss out of order problem, simultaneously, the present invention also can separate the load balancing problem of five equilibrium by no means.
Description of drawings
Fig. 1 is the topological schematic diagram of router in the existing network;
Fig. 2 is a method flow diagram of the present invention;
Fig. 3 is the method schematic diagram of one embodiment of the invention.
Embodiment
The invention provides a kind of method of load balancing, its core concept is the design by data structure, eliminates the process that reads threshold value, improves the handling property of high-speed equipment.And when changing, to changing the control of the accurate ratio of path route, fully or in the acceptable scope, eliminate the out of order problem of mistake by number of paths.
For making the purpose, technical solutions and advantages of the present invention express clearlyer, the present invention is further described in more detail below in conjunction with drawings and the specific embodiments:
Referring to Fig. 2,
Step 201, when next of communication equipment received packet jumped path more than one, next jumps the quantity that maximum support path number obtains required stream according to communication equipment is supported, and is each flow distribution traffic identifier.
Among the present invention, the input value that described Hash calculates is the content in the territory of data message head, and the territory in the described heading can be the content in territory in the heading, and output valve is a traffic identifier.The territory of described heading includes but not limited to one of source address, destination address, message life span, source port number, destination slogan, protocol type or combination in any.
Suppose data flow is divided into N altogether, the HASH algorithm directly obtains is 0 to N-1 value, the directly corresponding path of each value.
The value of N can be chosen like this: next jumps the maximum L of support paths in the supposition routing table, described next to jump maximum support path number be a value that has configured in advance, can set by order line, also can set by webmaster; If next is jumped maximum support path number and changes, calculate max-flow sign quantity by HASH again, and want initialization load balancing traffic identifier and the pairing load balancing table in path (LBT);
If for the proof load equilibrium, N should be able to be divided exactly by 1～L in theory, and for example next is jumped and supports the effective route of X bar, and then data flow 0～N is fitted in the effective route of X bar by integral multiple ground average mark.Below we jump maximum support path L=3 with next choosing of N value are described, when L=3, the minimum in theory value of N should be 6, is 3 paths because work as next jumping in the example, the quantity of data flow is if will realize load balancing, and then the quantity of data flow should be able to be divided exactly by 3; Since L be 3 o'clock next jump maximum support path, then when next jumping is 2 paths, the quantity of data flow should be able to be divided exactly by 2, could realize load balancing.So in example, the transmission of whole packet be if will realize load balancing, then the value of data flow N should be simultaneously can be divided exactly by 2 and 3, and promptly when L=3, the minimum in theory value of N should be 6.In like manner, when L=16, general next jump maximum support path number and can not surpass this value, be under the normal condition in 8, the minimum in theory value of the value of N is 9 * 5 * 7 * 11 * 13 * 16, and wherein 16 * 9 * 5 * 7 have comprised when N=1,2,3,4,6,8,10,12 or 14 situation.
When the minimum value of load balancing path that maximum is supported data flow N 2 to 8 time as follows.
| L | Minimum theoretical N |
| 2 | 2 |
| 3 | 6 |
| 4 | 12 |
| 5 | 60 |
| 6 | 60 |
| 7 | 420 |
| 8 | 840 |
Therefrom we are as can be seen, when the value of L is big more, the minimum value growth rate of data flow N is very fast, the N value of calculating like this can be very big, if calculator memory is enough big, then can design according to this, but in practice, we can suitably be reduced to, and the value of choosing the several times of a L gets final product as N.Because in high-speed equipment, draw to such an extent that value is generally 2 whole power by hash algorithm, be used as N so can choose a whole power of 2 greater than L, for example can according to as get off to be similar to and choose:
| L | N |
| 2 | 2 |
| 3 | 8 |
| 4 | 16 |
| 5 | 64 |
| 6 | 64 |
| 7 | 64 |
| 8 | 64 |
Step 202, communication equipment make each flow unique corresponding next definite jumping path according to the destination address and the described traffic identifier of described message;
Next jumping path of traffic identifier correspondence had been well-determined before searching in the communication equipment.We can initialization be provided with a load balancing table in routing table, described load balancing table comprises traffic identifier and two fields of next jumping sign at least; Communication equipment is determined next jumping path according to the destination address of described message and the value of described traffic identifier in the load balancing table.Need to prove that unique corresponding definite next of traffic identifier is jumped the path, but next definite jumping path can corresponding one or more traffic identifier.
If when requiring the mean allocation flow, then each next to jump the traffic identifier of sharing in path be five equilibrium.If require flow on different paths, to distribute by different proportion, then each next jump the traffic identifier that path branch shares and distribute according to desired ratio.
When because route changes, manually carry out the additions and deletions of forward-path or find wherein to have situations such as the path is unreachable to cause next to jump path need delete or increase the time from the fast automatic discovery mechanism of forwarding plane by order line, only need to revise the corresponding relation in traffic identifier and path, and need not to change the corresponding relation in traffic identifier and path according to the order of traffic identifier according to described ratio.Especially, we can change the minimum corresponding relation that changes traffic identifier and path of number of path according to described traffic identifier, can reduce a large amount of rheologyizatioies effectively like this and the out of order problem of stream that causes.
The load balancing that step 203, communication equipment carry out described message according to described next jumping path is transmitted
Load balancing in transmitting with IPV4 below is the realization that example illustrates load sharing method of the present invention.
It is to obtain through searching FIB that IPV4 transmits routing, and FIB is by being that an IP address that has a mask-length is index next is jumped path and forms.
Look into fib table, be purpose IP address with bag as the Key value, search a table, perhaps one tree obtains the list item of long coupling (the most accurate coupling, optimum list item).For example destination address is 1.1.1.1, has two in the routing table, and one is that 1.1.1.*/24, one are 1.1.*.*/16, slash back sign mask, and this destination-address will mate this route of 1.1.1.*/24 so, because it is more accurate than 1.1.*.*/16.
Match after the list item, can obtain a paths, this path is represented by next-hop ip address+outgoing interface, (for example the using the forwarding model of adjacency list) that an also useful index is represented, hereinafter, no matter above-mentioned two kinds of situations identify with NH next jumping path unification.
Fib table item logical construction among the present invention is as follows,
| NH | Load balancing flag bit LF | Other flag bit and contents in table | Load balancing list index LP |
Wherein, NH and other flag bit and contents in table are 0 o'clock with general fib table at LF, and showing does not have mulitpath, and list item is the same with general FIB, get NH and transmit; When load balancing flag bit LF was 1, showing had mulitpath, need search load balancing table (LBT) by load balancing list index LP thus carry out load balancing.
When load balancing flag bit LF was 1, showing had mulitpath, need carry out load balancing by load balancing list index LP.Load balancing list index LP obtains to determine to such an extent that next jumps the path by searching the load balancing table.Described load balancing table comprises destination address, traffic identifier and three fields of next jumping sign; For example, the load balancing table is as shown in the table,
We jump maximum support path L=4 with next is the example explanation, and the value of pairing data flow N is 16, so the corresponding definite path of each traffic identifier.When next jumping has 4 paths, replace respectively with NH1, NH2, NH3 and NH4, in order to realize load balancing, then to this 4 paths, and whether data flow is assigned in order, and it doesn't matter with load balancing on this 4 paths by mean allocation for data flow.For example, when next jumping had 4 paths, the corresponding relation of each traffic identifier and next paths can be as shown in the table,
| Traffic identifier | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| The path | NH 1 | NH1 | NH4 | NH2 | NH2 | NH4 | NH2 | NH4 | NH2 | NH3 | NH1 | NH3 | NH3 | NH1 | NH4 | NH3 |
Simultaneously, we change the minimum principle of number of path according to traffic identifier and change the path and can solve when the additions and deletions load balancing path, and a large amount of outflows that bring now miss out of order problem.Below we specify in conjunction with last example,
When the path of next jumping in the last example becomes 3 by 4, broken such as NH4, then also have 3 paths now, be respectively NH1, NH2 and NH3, this moment is if realize load balancing, stream identification 0 to 15 need be by mean allocation to NH1, on NH2 and the NH3, change the minimum principle in path according to traffic identifier, the path that then needs to change should be with 4 traffic identifier of NH4 as far as possible mean allocation to NH1, NH2 and NH3 go up and get final product, then we need will increase a traffic identifier on each path of NH1 to NH3, also will have a path to increase a traffic identifier more simultaneously, we can choose one wantonly, increase by two such as NH1.By may be allocated as follows after changing:
| Traffic identifier | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| The path | NH1 | NH1 | NH1 | NH2 | NH2 | NH1 | NH2 | NH2 | NH2 | NH3 | NH1 | NH3 | NH3 | NH1 | NH3 | NH3 |
Promptly walked the stream of NH4 originally, and walked NH1 to NH3 respectively at present, and even relatively, and reached the effect of load balancing, the ratio that is changed stream is: 4/16=25%, and do not miss out of order appearance.
When the path of next jumping in the last example became 5 by 4, such as having increased NH5, this moment, stream identification 0 to 15 should be assigned on NH1, NH2, NH3, NH4 and the NH5 as much as possible if realize load balancing.Change the minimum principle in path according to traffic identifier, the path that then needs to change should be respectively takes out a traffic identifier with any 3 paths among NH1, NH2, NH3 and the NH4 and is assigned to NH5 and goes up and get final product.By may be allocated as follows after changing:
| Traffic identifier | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| The path | NH5 | NH1 | NH5 | NH5 | NH2 | NH4 | NH2 | NH4 | NH2 | NH3 | NH1 | NH3 | NH3 | NH1 | NH4 | NH3 |
Promptly respectively take out a traffic identifier and distribute to NH5 in NH1, NH2 and NH4, then the ratio of reformed stream is 3/16=18.75%, and does not miss out of order appearance.
Need to prove, the corresponding relation of each traffic identifier and next paths, the corresponding relation that just satisfies on the ratio gets final product, and does not need sequence arrangement, and described ratio is meant the ratio of the required flow of sharing in different paths.Because in Actual path, such as TE lsp tunnel etc., the flow proportional size that different paths requires to share is not a five equilibrium, such as 3 paths NH1～NH3 are arranged, share 20%, 20%, 60% flow respectively, then NH1, NH2 respectively can be distributed 3 traffic identifier, NH3 distributes 10 traffic identifier, just can reach the purpose of sharing.So we can distribute traffic identifier ratio according to actual needs, thereby reach the effect that load is rationally shared.Simultaneously, when since route change, when needing to increase the deletion path, carry out according to described ratio equally, and change the minimum principle in path according to traffic identifier and realize load balancing, rather than order traffic identifier is carried out dispense path, can solve at next and jump that the path increases or a large amount of outflows of bringing in order to realize load balancing during deletion now miss out of order problem.
Simultaneously, in described example, when next jumping path becomes 1 by 2, need to revise the corresponding described unique path of all traffic identifier and the LF flag bit in the fib table is become 0.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with the people of this technology in the disclosed technical scope of the present invention; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.
Claims (10)
1. the method for a load balancing is characterized in that,
A, when next of communication equipment received packet jumped path more than one, jump the quantitative value that maximum support path number obtains required stream according to next of communication equipment, and be each flow distribution traffic identifier, the quantitative value of described stream more than or equal to described next jump maximum support path number;
B, communication equipment make each flow unique corresponding next definite jumping path according to the destination address and the described traffic identifier of described message;
The load balancing that C, communication equipment carry out described message according to described next jumping path is transmitted.
2. the method for a kind of load balancing according to claim 1 is characterized in that, the quantitative value that flows in the described steps A be 1 to next jump the common multiple of maximum support path number.
3. the method for a kind of load balancing according to claim 1, it is characterized in that, the quantitative value of the stream in the described steps A, according to the error requirements of assignment of traffic ratio, get near 1 to next jump the value of 2 whole power of the common multiple of maximum support path number.
4. method according to claim 1 is characterized in that, described traffic identifier is that the content according to the territory of described heading draws by hash algorithm.
5. method according to claim 4 is characterized in that, the territory of described heading comprises one of source address, destination address, message life span, source port number, destination slogan, protocol type or combination in any.
6. method according to claim 1 is characterized in that, described step B specifically comprises,
B1, the load balancing table is set in the routing table of route, described load balancing table comprises that traffic identifier and next jump sign;
B2, communication equipment are searched next jumping path according to the destination address and the described traffic identifier of described message in described load balancing table.
7. method according to claim 1 is characterized in that, traffic identifier described in the step B and next are jumped in the corresponding relation in path, and corresponding one or more traffic identifier are come according to the required flow proportional of sharing in different paths in described next jumping path.
8. method according to claim 7 is characterized in that, when the path need delete or increase, revises the corresponding relation in traffic identifier and path according to described ratio.
9. method according to claim 8 is characterized in that, also comprises according to described traffic identifier changing the corresponding relation that the minimum principle of number of path changes traffic identifier and path.
10. according to the method described in the claim 1, it is characterized in that, described next jump maximum support path number when changing, recomputate the quantitative value of stream and draw traffic identifier, and want the pairing load balancing table of initialization load balancing traffic identifier and path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005101016826A CN100417138C (en) | 2005-11-19 | 2005-11-19 | Load sharing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005101016826A CN100417138C (en) | 2005-11-19 | 2005-11-19 | Load sharing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1859286A CN1859286A (en) | 2006-11-08 |
| CN100417138C true CN100417138C (en) | 2008-09-03 |
Family
ID=37298150
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005101016826A Expired - Fee Related CN100417138C (en) | 2005-11-19 | 2005-11-19 | Load sharing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100417138C (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101247348B (en) * | 2008-03-12 | 2010-08-04 | 华为技术有限公司 | Load sharing method and device |
| CN101335709B (en) * | 2008-08-07 | 2010-09-22 | 杭州华三通信技术有限公司 | Method for implementing load sharing among flow analysis servers and shunting equipment |
| CN102136989B (en) * | 2010-01-26 | 2014-03-12 | 华为技术有限公司 | Message transmission method, system and equipment |
| CN102143041B (en) * | 2010-07-02 | 2014-03-26 | 华为技术有限公司 | Network traffic sharing method, device and system |
| CN101895472B (en) * | 2010-07-16 | 2013-11-06 | 华为技术有限公司 | Traffic flow load sharing method and processing method and corresponding device and system |
| CN103281252B (en) * | 2013-05-14 | 2017-04-26 | 华为技术有限公司 | Message flow control method and device based on multi-path transmission |
| US20150124623A1 (en) * | 2013-11-07 | 2015-05-07 | Futurewei Technologies, Inc. | System and Method for Traffic Splitting |
| CN104009932B (en) * | 2014-04-30 | 2017-06-23 | 易云捷讯科技（北京）股份有限公司 | A kind of flow based on Openflow rules arbitrarily compares carrying method |
| CN106487703A (en) * | 2015-08-27 | 2017-03-08 | 中兴通讯股份有限公司 | A kind of load share method and device |
| CN107770061B (en) * | 2016-08-16 | 2020-12-01 | 华为技术有限公司 | Method and equipment for forwarding message |
| CN108337160A (en) * | 2017-01-20 | 2018-07-27 | 华为技术有限公司 | Data transmission method, destination node and source node |
| CN112511449B (en) * | 2019-09-16 | 2022-12-30 | 华为技术有限公司 | Message flow out-of-order detection method, message processing method and device |
| CN110995609A (en) * | 2019-12-20 | 2020-04-10 | 新华三半导体技术有限公司 | Message sending method and device, electronic equipment and storage medium |
| CN112463360A (en) * | 2020-10-29 | 2021-03-09 | 空气动力学国家重点实验室 | Parallel read-in method for billion-hundred-GB-level grid data file |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6111877A (en) * | 1997-12-31 | 2000-08-29 | Cisco Technology, Inc. | Load sharing across flows |
| CN1414737A (en) * | 2002-05-23 | 2003-04-30 | 华为技术有限公司 | Method of flow load sharing |
| CN1431807A (en) * | 2003-01-28 | 2003-07-23 | 威盛电子股份有限公司 | Method of allocating data package stream |
| CN1567891A (en) * | 2003-06-20 | 2005-01-19 | 华为技术有限公司 | A method for implementing data service transmission routing |
| WO2005071900A1 (en) * | 2004-01-23 | 2005-08-04 | Siemens Aktiengesellschaft | Optimisation of traffic distribution in multipath routing |
-
2005
- 2005-11-19 CN CNB2005101016826A patent/CN100417138C/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6111877A (en) * | 1997-12-31 | 2000-08-29 | Cisco Technology, Inc. | Load sharing across flows |
| CN1414737A (en) * | 2002-05-23 | 2003-04-30 | 华为技术有限公司 | Method of flow load sharing |
| CN1431807A (en) * | 2003-01-28 | 2003-07-23 | 威盛电子股份有限公司 | Method of allocating data package stream |
| CN1567891A (en) * | 2003-06-20 | 2005-01-19 | 华为技术有限公司 | A method for implementing data service transmission routing |
| WO2005071900A1 (en) * | 2004-01-23 | 2005-08-04 | Siemens Aktiengesellschaft | Optimisation of traffic distribution in multipath routing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1859286A (en) | 2006-11-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100417138C (en) | Load sharing method | |
| US11509583B2 (en) | Effective bandwidth path metric and path computation method for wireless mesh networks with wired links | |
| EP0711483B1 (en) | Method for efficient aggregation of link metrics | |
| CN101965715B (en) | Tie-Breaking in Shortest Path Determination | |
| CN100574242C (en) | The method and apparatus of relaying in switch | |
| CN101267450B (en) | Multicast routing method for distributed network application layer based on network coding | |
| US7826450B2 (en) | Multicast/broadcast extension to a point-to-point unicast-only packet switch system | |
| CN106063195A (en) | Control device discovery in networks having separate control and forwarding devices | |
| CN103609080A (en) | Method and node for supporting routing via inter AS path | |
| CN107294852B (en) | Network routing method using topology dispersed short path set | |
| CN102217238A (en) | Service instance applied to mpls networks | |
| US20130064244A1 (en) | Method and apparatus for shortest path bridging of multicast traffic | |
| CN101425973B (en) | Method for route selection by IP multicast on equivalent multiple paths | |
| CN1984495B (en) | Method and equipment for quality-of-service based routing | |
| CN106161237A (en) | Centralized method for routing, device and system | |
| US20030012206A1 (en) | Methods and arrangements for building a subsource address multicast distribution tree using point to point routing records | |
| CN104580165A (en) | Cooperative caching method in intelligence cooperative network | |
| CN101171802B (en) | Node, network, creating method of corresponding relation for transmitting information in network | |
| CN108234320A (en) | Message transmitting method and interchanger | |
| CN102136986B (en) | Load sharing method and exchange equipment | |
| CN101022417A (en) | Method for selecting load sharing link and router | |
| Gao et al. | Global hybrid routing for scale-free networks | |
| CN102143041A (en) | Network traffic sharing method, device and system | |
| CN108092914A (en) | Network traffic load equalization scheduling method and device | |
| CN101465788A (en) | Method and device for intercommunication of routes between various domain, and route calculation unit |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080903 Termination date: 20191119 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |