CN101022417B - Method for selecting load sharing link and router - Google Patents
Method for selecting load sharing link and router Download PDFInfo
- Publication number
- CN101022417B CN101022417B CN2007100851600A CN200710085160A CN101022417B CN 101022417 B CN101022417 B CN 101022417B CN 2007100851600 A CN2007100851600 A CN 2007100851600A CN 200710085160 A CN200710085160 A CN 200710085160A CN 101022417 B CN101022417 B CN 101022417B
- Authority
- CN
- China
- Prior art keywords
- confidence level
- load sharing
- sharing link
- risk
- degree
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A method for selecting load sharing link includes receiving message and confirming credibility factor of each load sharing link in equivalent route between message destination addresses, confirming credibility of each load sharing link according to said credibility factor and selecting load sharing link without the lowest credibility preferentially.
Description
Technical field
The present invention relates to the communications field, relate in particular to a kind of method and router of selecting load sharing link.
Background technology
At present, preserve a FIB (Forwarding Information Base, forwarding information base) in the router, wherein comprised all IP prefixes that come from routing table.Clean culture FIB supports that a plurality of load balancing items are basic functions of router, next jumping and outgoing interface that each load balancing item is corresponding different.Equal-cost route points to the path that there are several identical expenses a destination, and IP wraps on these several links and sends in turn.The equal-cost route load balancing is divided into two kinds of basic modes again, promptly packet-by-packet shares and pursues flow point load.Packet-by-packet share is that message according to different carries out load balancing; And is to select link to share according to different data flow by flow point load, for a given source-destination data stream, even there is mulitpath to use, router can guarantee that also the packet that belongs to this stream selects identical link for use.The equal-cost route load balancing can improve the utilance of link.
Many different data flow to be shared on several the equal-cost links, traditional way is after Forwarding plane has been received the equal-cost route that the route plane issues, can in fib table, create a plurality of next that are used for load balancing and jump different forwarding-table items, in the process of pursuing the flow point load, it is forwarding-table item of each bar distribution of flows that Forwarding plane can use certain selection algorithm (as hash algorithm).Hash algorithm with source and destination address, available path (load balancing list item of equal value) quantity and router id etc. as input parameter, with distribution of flows to these equal-cost links.The status of living in of these load balancing list items is identical, is all indistinguishably included in the selection set of selection algorithm.
In present communication network, the variation of link and route is all very complicated, and the ruuning situation of router also has nothing in common with each other, when the big control plane CPU of router load continues to hurry, even route restrains, the fib table item in the network between the different routers issues can not be synchronous.When Forwarding plane is data flow selection load sharing link, may select still unstabilized forward-path, thereby form forwarding loop, cause traffic loss.The time difference that the fib table item issues between the router is big more, and the time that loop exists is also lasting more.
As shown in Figure 1, R1 to R4 is respectively router, and the Cost value of establishing all links equates that all two equal-cost route load sharing links are arranged from router R3 to R2 as can be known, and path that flow is walked is respectively R3-＞R4-＞R2 and R3-＞R1-＞R2.When with R2 be the flow of destination when R1 transmits, its path is R1-＞R2.If the link between R1 and the R2 breaks down, then behind the routing convergence, new flow forward-path is R1-＞R3-＞R4-＞R2, and this moment, R3 had only one to the route of R2, i.e. R3-＞R4-＞R2.After faulty link between R1 and R2 recovered normally, after routing convergence was finished, R3 was above-mentioned two equal-cost route load sharing links to the route recovery of R2.If this moment, the control plane CPU of each router continued to hurry, the fib table deadline of R3 after the fib table item of flow before the R1 upper edge issues is forwarded to R3, finds two list items that can be used for load balancing early than R1.Because concerning the Forwarding plane of R3, the residing status of the link of these two list item representatives is identical, all indistinguishably included in the selection set of selection algorithm, therefore when the selection algorithm be data flow when having selected the list item in representative R3-＞R1-＞R2 path, will between R1 and R3, form forwarding loop.
The essential reason that adopts said method to carry out link selection and form forwarding loop is: be example with the ring topology of being made up of four routers shown in Figure 1 still, the fib table item of going up same prefix as R3 becomes with its equal-cost route load sharing link R3-＞R1-＞R2 by individual paths R3-＞R4-＞R2 and when depositing, thereby selection algorithm has been abandoned the longer more believable list item of the original life period (R3-＞R4-when being link failure＞R2), selected one just to issue, being likely does not have completely stable path.
The selection technology of existing load sharing link is not considered the influence of network change situation parity price fib table item, has the possibility that forms forwarding loop under the communication network complex environment at present.
Summary of the invention
The embodiment of the invention provides a kind of method and router of selecting load sharing link, in order to optimize the selection of load sharing link.
In order to solve the problems of the technologies described above, the embodiment of the invention provides a kind of method of selecting load sharing link, may further comprise the steps:
Receive message;
Determine the confidence level factor of each load sharing link in the equal-cost route between the destination address of described message, described confidence level factor comprises degree of risk, perhaps comprise life span and degree of risk, wherein, described degree of risk is the parameter of determining according to the concussion number of times of load sharing link in the setting-up time scope;
Determine the confidence level of described each load sharing link according to described confidence level factor;
The preferential non-minimum load sharing link of described confidence level of selecting.
The embodiment of the invention also provides a kind of router, and described router comprises:
Receiver module is used to receive message;
First processing module, be used to receive the message of described receiver module output, and determine the confidence level factor of each load sharing link in the equal-cost route between the destination address of described message, described confidence level factor comprises life span and degree of risk, perhaps comprise degree of risk, wherein, described degree of risk is the parameter of determining according to the concussion number of times of load sharing link in the setting-up time scope;
Second processing module is used for determining according to the confidence level factor that described first processing module is determined the confidence level of described each load sharing link;
Select module, be used for preferentially selecting the non-minimum load sharing link of described confidence level.
The technical scheme that adopts the embodiment of the invention to provide, because the preferential non-minimum load sharing link of confidence level of selecting, therefore, can optimize the selection of load sharing link, make that selected load sharing link is an optimum or more excellent load sharing link in alternative load sharing link, thereby making to transmit to operate to stablize carries out, and eliminates the forwarding problems that brings because of the link instability.
Description of drawings
Fig. 1 is the ring topology schematic diagram that four routers are formed;
Fig. 2 is a flow chart of selecting load sharing link in the embodiment of the invention one;
Fig. 3 is the router block diagram in the embodiment of the invention.
Embodiment
In the embodiment of the invention, receive message; Determine the confidence level factor of each load sharing link in the equal-cost route between the destination address of this message; Determine the confidence level of each load sharing link according to this confidence level factor; The preferential non-minimum load sharing link of this confidence level of selecting.
Above-mentioned confidence level factor can be any factor that influences confidence level, for example life span and/or degree of risk, and wherein, life span is long more, should make the confidence level of respective load sharing link high more; Degree of risk is big more, should make the confidence level of respective load sharing link low more.
Below in conjunction with accompanying drawing the embodiment of the invention is done description further.
Embodiment one
Embodiment one determines that with life span the confidence level of load sharing link is that example describes.
Because in existing router, there has been FIB, and Age (lifetime) field of this list item rise time of record has all been arranged in each fib table item, therefore, in embodiment one, the meaning of Age field representative is expanded the life span that writes down each load sharing link in the equal-cost route.Do not limit the concrete preservation position of this life span in the specific implementation, as long as can write down this life span and when carrying out follow-up selection, can provide this life span.For example, set up a table separately and come record＜next jumping, prefix two tuples and confidence level factor thereof (among the embodiment one time) for survival.
In embodiment one, specifically be with the Age field extension one＜next jumps prefix the life span of two tuples.For example, in the example of embodiment one, generate two in the FIB simultaneously and arrive the equal-cost route load sharing link that prefixes are the destination address represented of 1.1.1.1, these two equal-cost routes＜next jumping, prefix〉binary composition not Wei＜2.2.2.2,1.1.1.1〉and＜3.3.3.3,1.1.1.1 〉, then when these two equal-cost route load sharing links generated, these two two tuples and its corresponding Age field were as shown in table 1 in the FIB:
Table 1
| ＜next jumping, prefix〉two tuples | The Age field |
| <2.2.2.2，1.1.1.1> | 0 |
| <3.3.3.3，1.1.1.1> | 0 |
If variation has taken place in network environment, suppose when these two equal-cost route load sharing links generate back elapsed time t, route is finished convergence again, the equal-cost route load sharing link that arrives this prefix 1.1.1.1 becomes three, increased one＜next jumping in the fib table newly, prefix〉two tuples are＜4.4.4.4 1.1.1.1 the load balancing list item.Two tuples＜2.2.2.2 then, 1.1.1.1 and＜3.3.3.3,1.1.1.1 the not zero clearing of Age field, on the numerical value of t, continue the accumulative total life span, and＜4.4.4.4,1.1.1.1 be to finish again the moment that convergence, list item generate from route to pick up counting, then at this moment, these three two tuples and its corresponding Age field are as shown in table 2 in the FIB:
Table 2
| ＜next jumping, prefix〉two tuples | The Age field |
| <2.2.2.2，1.1.1.1> | t |
| <3.3.3.3，1.1.1.1> | t |
| <4.4.4.4，1.1.1.1> | 0 |
And＜4.4.4.4,1.1.1.1〉corresponding list item generation back elapsed time t
0The time, these three two tuples and its corresponding Age field are as shown in table 3 in the FIB:
Table 3
| ＜next jumping, prefix〉two tuples | The Age field |
| <2.2.2.2，1.1.1.1> | t+t 0 |
| <3.3.3.3，1.1.1.1> | t+t 0 |
| <4.4.4.4，1.1.1.1> | t 0 |
As seen because in embodiment one, the Age field record life span of a list item, and life span is of a specified duration more, illustrates that its pairing forward-path is more stable, therefore, can take out the confidence level of a list item according to the Age field.And life span list item of a specified duration more, its confidence level should be high more, (finished by the selection algorithm of setting usually) to be in position more preferably when selecting load sharing link.
In embodiment one, the flow process of selection load sharing link may further comprise the steps as shown in Figure 2:
Step S101 receives message;
Step S102 determines the confidence level factor of each load sharing link in the equal-cost route between the destination address of this message;
That is, defining which load sharing link earlier according to the destination address of this message is the equal-cost route that can arrive this destination address, determines the confidence level factor of these load sharing links again.
In embodiment one, this confidence level factor is the time for survival.
Step S103 determines the confidence level of each load sharing link according to this confidence level factor;
In embodiment one, this confidence level can be by the value direct representation of life span.
Step S104 preferentially selects the non-minimum load sharing link of this confidence level.
When specific implementation, can preferentially select the highest load sharing link of confidence level.But, just can optimize the selection of load sharing link to a certain extent as long as select the non-minimum load sharing link of confidence level.
For example,＜4.4.4.4,1.1.1.1〉corresponding list item generation back elapsed time t
0The time,＜5.5.5.5,1.1.1.1〉route finishes again convergence, and list item generates, at elapsed time t more after this
1, these four two tuples and its corresponding Age field are as shown in table 4 in the FIB:
Table 4
| ＜next jumping, prefix〉two tuples | The Age field |
| <2.2.2.2，1.1.1.1> | ?t+t 0+t 1 |
| <3.3.3.3，1.1.1.1> | ?t+t 0+t 1 |
| <4.4.4.4，1.1.1.1> | ?t 0+t 1 |
| <5.5.5.5，1.1.1.1> | ?t 1 |
At this moment,, then can select confidence level time high＜4.4.4.4 as required, 1.1.1.1 if router receives the message that destination address is expressed as 1.1.1.1〉load sharing link, rather than the highest load sharing link of confidence level.
Embodiment two
Among the embodiment two, determine the confidence level of load sharing link, for example, in the example of embodiment two, determine its degree of risk according to the concussion number of times in the load sharing link setting-up time scope according to degree of risk.In this setting-up time scope, after the load sharing link concussion once, apply a penalty value-a (a is a positive count) can for the confidence level of this link, reduce the confidence level of this list item, then, still with mention in the above-mentioned example＜2.2.2.2,1.1.1.1 and＜3.3.3.3,1.1.1.1 load sharing link is example, then under initial situation, the field of the record confidence level of these two two tuples and its correspondence is as shown in table 5 in the FIB:
Table 5
| ＜next jumping, prefix〉two tuples | The field of record confidence level |
| <2.2.2.2，1.1.1.1> | 0 |
| <3.3.3.3，1.1.1.1> | 0 |
Suppose after a period of time＜2.2.2.2,1.1.1.1〉corresponding load sharing link shaken 2 times,＜3.3.3.3,1.1.1.1 corresponding load sharing link shaken 3 times, then this moment, the field of the record confidence level of these two two tuples and its correspondence is as shown in table 6 in the FIB:
Table 6
| ＜next jumping, prefix〉two tuples | The field of record confidence level |
| <2.2.2.2，1.1.1.1> | -2a |
| <3.3.3.3，1.1.1.1> | -3a |
As seen, when specific implementation, can only determine the confidence level of load sharing link according to degree of risk, think confidence level be-load sharing link of 2a lacks than the concussion number of times of confidence level for the load sharing link of-3a, confidence level is higher, should be in position more preferably when selecting load sharing link.
Embodiment three
In order to make this confidence level more reliable, embodiment three determines the confidence level of load sharing link simultaneously according to life span and degree of risk, when specific implementation, multiple implementation can be arranged, for example:
Mode one
Determine its confidence level weighted factor according to the degree of risk of load sharing link, the life span of respective load sharing link correspondence is weighted.This confidence level weighted factor can be used for representing the risk that may exist that takes out by user oneself definition from the actual conditions of user experience or network, low-risk forward-path is answered the fib table item of equal value of corresponding high confidence level.That is, specifically can take out the degree of risk of respective load sharing link from the network actual conditions, the value of this confidence level weighted factor of determining that this degree of risk is high more is low more.
For example, in the example of embodiment one, in these three load sharing links,＜2.2.2.2,1.1.1.1〉corresponding confidence level weighted factor is 0.5,＜3.3.3.3,1.1.1.1 corresponding confidence level weighted factor is 0.8,＜4.4.4.4,1.1.1.1〉corresponding confidence level weighted factor is 0.9, suppose above-mentioned t=20s, t
0=50s, then, after the weighting operation,＜2.2.2.2,1.1.1.1 the value of corresponding confidence level can be (20+50) * 0.5=35,＜3.3.3.3,1.1.1.1〉value of corresponding confidence level can be (20+50) * 0.6=42,＜4.4.4.4,1.1.1.1 the value of corresponding confidence level can be 50 * 0.9=45, as seen, after being weighted operation, preferential load sharing link meeting of selecting and to be weighted operation before different.Before being weighted operation, should preferentially select＜2.2.2.2 1.1.1.1〉and＜3.3.3.3,1.1.1.1 corresponding load sharing link, and after being weighted operation, should preferentially select＜4.4.4.4 1.1.1.1〉corresponding load sharing link.This confidence level weighted factor should be provided with according to actual needs, makes the value of the confidence level after the weighting can embody respective load sharing link degree trusty better.
Mode two
Determine the confidence level award value of load sharing link with life span, determine its penalty value with degree of risk, for example, make the award value equal its life span, the every concussion of load sharing link penalty value once is-t
1, suppose in the example of embodiment one,＜4.4.4.4,1.1.1.1〉corresponding list item generation back elapsed time t
0The time,＜2.2.2.2,1.1.1.1 corresponding load sharing link shaken 4 times,＜3.3.3.3,1.1.1.1〉corresponding load sharing link shaken＜4.4.4.4 2 times, 1.1.1.1 corresponding load sharing link shaken 1 time, then at this moment,＜2.2.2.2,1.1.1.1〉corresponding confidence level is t+t
0-4t
1,＜3.3.3.3,1.1.1.1〉and corresponding confidence level is t+t
0-42t
1,＜4.4.4.4,1.1.1.1〉and corresponding confidence level is t
0-t
1As seen, employing mode two also can make the value of confidence level embody respective load sharing link degree trusty well.
Aforesaid way one and mode two is not limited in this for determine the example of the confidence level of load sharing link simultaneously according to life span and degree of risk when specific implementation.
Embodiment four
In embodiment four, the confidence level threshold value is set, by the confidence level of load sharing link in the comparing embodiment one to three and the relation of this threshold value, determine whether the respective load sharing link is included into to wait to select to gather.As seen, under the mode of this selection load sharing link, not necessarily preferentially select the highest load sharing link of confidence level, but can be in this waits to select to gather according to certain rule or at random select load sharing link to transmit.
Under the situation of this confidence level by the abstract acquisition of Age field, along with the continuous growth of the fib table item life span that newly issues, its confidence level also improves constantly.After the confidence level of fib table item of equal value reaches this threshold value, just can be included in the selection set of selection algorithm, as an option sharing flow.And unsettled link is because of its route sustained oscillation, and corresponding fib table item confidence level is very low all the time, does not reach the confidence level threshold value, thereby also is not included into the selection set of selection algorithm, eliminated the forwarding problems that brings because of the link instability.
Under the situation of the abstract acquisition of life span after this confidence level is by weighting, similarly, the fib table item of equal value that confidence level weighted factor and/or life span are little will not reach this confidence level threshold value, therefore, have only the good load sharing link of confidence level just can become load sharing link to be selected, transmit operation better.
When specific implementation, the user can set rational confidence level threshold value according to using concrete condition, both can improve the reliability of forwarding, and minimum is eliminated in the influence of the load balancing inequality that may cause again.
Router in the embodiment of the invention can comprise memory module and processing module as shown in Figure 3, wherein:
Receiver module is used to receive message;
First processing module is used to receive the message of receiver module output, and determines the confidence level factor of each load sharing link in the equal-cost route between the destination address of this message;
Second processing module is used for determining according to the confidence level factor that first processing module is determined the confidence level of each load sharing link;
Select module, be used for preferentially selecting the non-minimum load sharing link of this confidence level.
This router can also comprise judge module, is used to be provided with the confidence level threshold value, the relation of the confidence level of load sharing link and this threshold value relatively, and determine according to result relatively whether the respective load sharing link is included into and wait to select set.
When specific implementation, in by stream or packet-by-packet equal-cost route load balancing, can adopt the technical scheme of the selection load sharing link that the embodiment of the invention provides.
In sum, adopt the technical scheme of the embodiment of the invention, can optimize the selection of load sharing link, make that selected load sharing link is an optimum or more excellent load sharing link in alternative load sharing link, thereby making to transmit to operate to stablize carries out, and eliminates the forwarding problems that brings because of the link instability.
Obviously, those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, if of the present invention these are revised and modification belongs within the scope of claim of the present invention and equivalent technologies thereof, then the present invention also is intended to comprise these changes and modification interior.
Claims (9)
1. a method of selecting load sharing link is characterized in that, may further comprise the steps:
Receive message;
Determine the confidence level factor of each load sharing link in the equal-cost route between the destination address of described message, described confidence level factor comprises degree of risk, perhaps comprise life span and degree of risk, wherein, described degree of risk is the parameter of determining according to the concussion number of times of load sharing link in the setting-up time scope;
Determine the confidence level of described each load sharing link according to described confidence level factor;
The preferential non-minimum load sharing link of described confidence level of selecting.
2. the method for claim 1 is characterized in that, when carrying out described selection, preferentially selects the highest load sharing link of described confidence level.
3. the method for claim 1 is characterized in that, described confidence level factor is recorded in the forwarding information base fib table item of router.
4. the method for claim 1 is characterized in that, when described confidence level factor comprised life span and degree of risk, described life span was long more, makes the confidence level of respective load sharing link high more; Described degree of risk is big more, makes the confidence level of respective load sharing link low more.
5. method as claimed in claim 4, it is characterized in that, when determining described confidence level according to described life span and degree of risk, its concrete grammar is: the confidence level weighted factor of determining the respective load sharing link according to described degree of risk, life span to respective load sharing link correspondence is weighted, and determines the confidence level of respective load sharing link according to the life span after the weighting.
6. method as claimed in claim 5, it is characterized in that, the concrete grammar of determining described confidence level weighted factor is: take out the degree of risk of respective load sharing link from the network actual conditions, the value of the described confidence level weighted factor of determining that described degree of risk is high more is low more.
7. as the described method of arbitrary claim in the claim 1 to 6, it is characterized in that, the confidence level threshold value is set, the relatively confidence level of load sharing link and the relation of described threshold value, and determine according to the result of described comparison whether the respective load sharing link is included into and wait to select set.
8. a router is characterized in that, described router comprises:
Receiver module is used to receive message;
First processing module, be used to receive the message of described receiver module output, and determine the confidence level factor of each load sharing link in the equal-cost route between the destination address of described message, described confidence level factor comprises life span and degree of risk, perhaps comprise degree of risk, wherein, described degree of risk is the parameter of determining according to the concussion number of times of load sharing link in the setting-up time scope;
Second processing module is used for determining according to the confidence level factor that described first processing module is determined the confidence level of described each load sharing link;
Select module, be used for preferentially selecting the non-minimum load sharing link of described confidence level.
9. router as claimed in claim 8, it is characterized in that, described router also comprises judge module, be used to be provided with the confidence level threshold value, the relatively confidence level of load sharing link and the relation of described threshold value, and determine according to the result of described comparison whether the respective load sharing link is included into and wait to select set.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100851600A CN101022417B (en) | 2007-03-16 | 2007-03-16 | Method for selecting load sharing link and router |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100851600A CN101022417B (en) | 2007-03-16 | 2007-03-16 | Method for selecting load sharing link and router |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101022417A CN101022417A (en) | 2007-08-22 |
| CN101022417B true CN101022417B (en) | 2011-01-12 |
Family
ID=38710072
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007100851600A Expired - Fee Related CN101022417B (en) | 2007-03-16 | 2007-03-16 | Method for selecting load sharing link and router |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101022417B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101652841B1 (en) | 2009-02-02 | 2016-08-31 | 삼성전자 주식회사 | Method and apparatus for controllling radio link in cellular communication systems supporting carrier aggregation |
| CN102710507B (en) * | 2012-05-17 | 2015-05-13 | 杭州华三通信技术有限公司 | Method and network equipment for achieving consistency of message forwarding paths |
| CN102821049A (en) * | 2012-08-15 | 2012-12-12 | 华为技术有限公司 | Method and device for forwarding message |
| CN104734984B (en) * | 2013-12-24 | 2017-11-21 | 中国移动通信集团公司 | A kind of message forwarding method and device |
| US10050980B2 (en) * | 2015-06-27 | 2018-08-14 | Mcafee, Llc | Enterprise reputations for uniform resource locators |
| CN106209671A (en) * | 2016-06-30 | 2016-12-07 | 杭州华三通信技术有限公司 | A kind of method and device determining that routing overhead is shared |
| CN108011661B (en) * | 2017-11-29 | 2020-01-14 | 清华大学 | Satellite network routing oscillation suppression method and system |
| CN113806083B (en) * | 2021-09-06 | 2023-07-25 | 杭州迪普科技股份有限公司 | Method and device for processing aggregate flow data |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1682502A (en) * | 2002-07-15 | 2005-10-12 | 索马网络公司 | Apparatus, system and method for the transmission of data with different QoS attributes |
| CN1849597A (en) * | 2003-06-06 | 2006-10-18 | 网状网络公司 | Method to provide a measure of link reliability to a routing protocol in an ad hoc wireless network |
| US7180864B2 (en) * | 2002-02-27 | 2007-02-20 | Lucent Technologies Inc. | Method and apparatus for exchanging routing information within an autonomous system in a packet-based data network |
-
2007
- 2007-03-16 CN CN2007100851600A patent/CN101022417B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7180864B2 (en) * | 2002-02-27 | 2007-02-20 | Lucent Technologies Inc. | Method and apparatus for exchanging routing information within an autonomous system in a packet-based data network |
| CN1682502A (en) * | 2002-07-15 | 2005-10-12 | 索马网络公司 | Apparatus, system and method for the transmission of data with different QoS attributes |
| CN1849597A (en) * | 2003-06-06 | 2006-10-18 | 网状网络公司 | Method to provide a measure of link reliability to a routing protocol in an ad hoc wireless network |
Non-Patent Citations (4)
| Title |
|---|
| 李欣,薛小平.考虑链路生存时间的Ad Hoc网络QoS路由优化算法.计算机应用25 10.2005,25(10),2261-2263. |
| 李欣,薛小平.考虑链路生存时间的Ad Hoc网络QoS路由优化算法.计算机应用25 10.2005,25(10),2261-2263. * |
| 王志雄,李腊元.一种基于移动预测和多路径机制的Ad Hoc网络路由协议.武汉理工大学学报(交通科学与工程版)30 2.2006,30(2),216-219. |
| 王志雄,李腊元.一种基于移动预测和多路径机制的Ad Hoc网络路由协议.武汉理工大学学报(交通科学与工程版)30 2.2006,30(2),216-219. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101022417A (en) | 2007-08-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101022417B (en) | Method for selecting load sharing link and router | |
| EP2614618B1 (en) | Automated traffic engineering for multi-protocol label switching (mpls) with link utilization as feedback into the tie-breaking mechanism | |
| CN113261245B (en) | Recovery system and method for network link or node failure | |
| EP2614615B1 (en) | Automated traffic engineering for 802.1aq based upon the use of link utilization as feedback into the tie-breaking mechanism | |
| US20150026507A1 (en) | Transport control server, network system and transport control method | |
| US9065757B2 (en) | Network device and method of routing traffic | |
| CN104378296A (en) | Message forwarding method and device | |
| JP2014534776A (en) | IP fast reroute scheme providing full range of protection | |
| CN102761493B (en) | Multicast routing item updating method and device of multilink transparent internet | |
| GB2502775A (en) | Selecting routes between nodes in a network based on node processing gain and lifetime | |
| KR20100112144A (en) | Tie-breaking in shortest path determination | |
| CN102150148A (en) | Differentiated services for unicast multicast frames in layer 2 topologies | |
| KR101457317B1 (en) | Prioritization of routing information updates | |
| CN108833283B (en) | Software-defined cross-domain multi-path routing planning method | |
| CN101483610A (en) | Route updating method for link state routing protocol | |
| CN103260211A (en) | Improved AOMDV routing method | |
| CN104486224A (en) | Routing learning method and equipment | |
| CN103078796A (en) | Routing calculation method and equipment | |
| CN101547188B (en) | System and method for achieving generalized routing protocol of wireless sensor network | |
| Sahhaf et al. | Routing at large scale: Advances and challenges for complex networks | |
| CN102821433A (en) | Method for updating satellite network routing information | |
| CN102710499B (en) | Many issue sources external routes is for down hop system of selection and equipment thereof | |
| CN103248568B (en) | Router and realization thereof support that redundancy is without the data forwarding method of numbering link | |
| Li et al. | An qos algorithm based on aco for wireless sensor network | |
| Wu et al. | A group-based mobile agent routing protocol for multitype wireless sensor networks |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110112 Termination date: 20170316 |