CN106411728B - Route processing method and device - Google Patents
Route processing method and device Download PDFInfo
- Publication number
- CN106411728B CN106411728B CN201610866065.3A CN201610866065A CN106411728B CN 106411728 B CN106411728 B CN 106411728B CN 201610866065 A CN201610866065 A CN 201610866065A CN 106411728 B CN106411728 B CN 106411728B
- Authority
- CN
- China
- Prior art keywords
- path
- routing
- bgp
- route
- mapping table
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/04—Interdomain routing, e.g. hierarchical routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
This application provides route processing methods and device.In the application, one Route Distinguisher mapping table of network equipment maintenance is simultaneously synchronized to back-up device, after the network equipment executes GR, if routing is arrived in study, it is then the path-id of the route assignment when there are present networks equipment in Route Distinguisher mapping table before GR, then still using be before present networks equipment the route assignment path-id as the path-id of the routing currently learn, the path-id for realizing the network equipment same routing in the front and back execution GR is constant.
Description
Technical field
This application involves network communication technologies, in particular to route processing method and device.
Background technique
Border Gateway Protocol (BGP:Border Gateway Protocol) introduce path it is additional (Add-path:
Additional-path) characteristic.Add-path characteristic allows to notice a plurality of routing for reaching same destination address to bgp neighbor.
RT2 and RT1 establishes bgp neighbor in networking as shown in Figure 1, and RT2 enables Add-path characteristic, RT2 difference
Establish bgp neighbor with RT3, RT4, then when RT2 receives the routing of bgp neighbor i.e. RT3 and RT4 publication, RT3 and RT4 publication
Routing be to reach the different routings of same destination address, the routing from RT3 and RT4 publication is all sent to RT1 by RT2, from
And RT1 is enabled to be quickly switched into RT1 to the link between RT3 when RT1 is to link failure between RT4.
BGP regulation issues when being routed to bgp neighbor of a plurality of same destination address of arrival for the network equipment, and network is set
It is standby to be the route assignment Route Distinguisher (path-id) of the same destination address of a plurality of arrival of the publication and be sent to bgp neighbor,
To facilitate bgp neighbor to distinguish routing.
Again as shown in Figure 1, being routing 1 and road for routing 2 with the routing that the routing that RT3 is issued is routing 1, RT4 publication
It is the different routings for reaching same destination address by 2, then RT2 is 1 distribution path-id1 of routing, sets path- for 2 distribution of routing
Id2, path-id1 and path-id2 are different, are respectively used to indicate routing 1, routing 2.RT2 will route 1 and path-id1, routing 2
It is sent to RT1 with path-id2, distinguishes following two after routing 2 and path-id2 when RT1 receives 1 and path-id1 of routing
It routes and carries out flow forwarding using this two routings:
Path-id1: routing 1,
Path-id2: routing 2.
Since the path-id of routing is determined by the network equipment for issuing the routing, in this way, when the network of publication routing
Equipment is switched move (GR:Graceful Restart) into Graceful Restart after, before for the path-id of route assignment because
It switches and is deleted, in this way, it is different for the path-id of same route assignment before and after GR just to will appear the network equipment.For example,
RT2 in Fig. 1 is that route the path-id of 1 distribution be path-id1 before GR, and be to route the path-id that 1 distributes to be after GR
path-id2.And same is routed, path-id changes the determination that finally will affect network path repeatedly, also results in
BGP whole network is unstable.
Summary of the invention
This application provides route processing methods and device, to prevent the path-id of routing before the network equipment executes GR
After change.
The technical scheme provided by the application includes:
A kind of route processing method, this method are applied to enable the additional Add-path spy in Border Gateway Protocol (BGP) path
The network equipment of property, comprising:
After Graceful Restart moves GR, Route Distinguisher mapping table is obtained from specified back-up device；
Learn the routing of bgp neighbor publication and determines that the bgp neighbor is the first identifier of the route assignment
path-id；
The bgp neighbor and the first matched mapping item of path-id are searched in the Route Distinguisher mapping table of acquisition, if
It finds, using the 2nd path-id in the mapping item as the path-id of the routing and publication, if not finding,
The 2nd path-id is distributed, the mapping table comprising the bgp neighbor, the first path-id and the 2nd path-id is generated
Item is simultaneously recorded to the Route Distinguisher mapping table obtained, and the 2nd path-id of distribution is concurrent as the path-id of the routing
The mapping item of generation is recorded the Route Distinguisher mapping table into the back-up device by cloth.
A kind of route processing device, the device are applied to enable the additional Add-path spy in Border Gateway Protocol (BGP) path
The network equipment of property, comprising:
Acquiring unit, for obtaining Route Distinguisher mapping table from specified back-up device after Graceful Restart moves GR；
Determination unit, for learning the routing of bgp neighbor publication and determining that the bgp neighbor is the route assignment
First identifier path-id；
Searching unit, for searching the bgp neighbor and in the Route Distinguisher mapping table that the acquiring unit obtains
The matched mapping item of one path-id,
Processing unit, for when the searching unit finds the mapping item, by the mapping item
Path-id and publication of two path-id as the routing, when the searching unit does not find the mapping item, point
With the 2nd path-id, generate comprising the bgp neighbor, the mapping item of the first path-id and the 2nd path-id and record extremely
The Route Distinguisher mapping table that the acquiring unit obtains, the 2nd path-id of distribution is concurrent as the path-id of the routing
The mapping item of generation is recorded the Route Distinguisher mapping table into the back-up device by cloth.
As can be seen from the above technical solutions, in the present invention, one Route Distinguisher mapping table of network equipment maintenance and synchronization
To back-up device, after the network equipment executes GR, if routing is arrived in study, when there are present networks equipment in Route Distinguisher mapping table
It is the path-id of the route assignment before GR, then still will is the path-id of the route assignment before present networks equipment as working as
The path-id of the preceding routing learnt, the path-id for realizing the network equipment same routing in the front and back execution GR are constant.
Detailed description of the invention
The drawings herein are incorporated into the specification and forms part of this specification, and shows the implementation for meeting the disclosure
Example, and together with specification for explaining the principles of this disclosure.
Fig. 1 is BGP application networking schematic diagram；
Fig. 2 is method flow diagram provided by the invention；
Fig. 3 is apparatus structure schematic diagram provided by the invention.
Specific embodiment
To make the objectives, technical solutions, and advantages of the present invention clearer, right in the following with reference to the drawings and specific embodiments
The present invention is described in detail.
The present invention can prevent the path-id of routing from changing before and after the network equipment executes GR.Below first to this hair
The method of bright offer is described:
Referring to fig. 2, Fig. 2 is method flow diagram provided by the invention.Method flow application shown in Fig. 2 enables BGP
The network equipment of Add-path characteristic.
As shown in Fig. 2, the process can comprise the following steps that
Step 201, the network equipment obtains Route Distinguisher mapping table after GR from specified back-up device.
As one embodiment, back-up device here can be memory module such as Flash specified in present networks equipment
Card etc..Wherein, memory module has non-volatile characteristic, and the Route Distinguisher mapping table of storage is not lost because of present networks equipment GR
It loses.
As another embodiment, back-up device here can be the device independently of present networks equipment, for backing up this
Route Distinguisher mapping table on the network equipment, such as the slave control board independently of present networks equipment.
As can be seen that it is also independently of the device of the network equipment regardless of back-up device is the memory module on the network equipment,
All have the characteristics that one: the Route Distinguisher mapping table of storage is unrelated with the GR of the network equipment, does not lose because of network equipment GR.
Step 202, the routing (be denoted as the first via by) of network equipment study bgp neighbor publication and determine that bgp neighbor is
First path-id of the first route assignment.
In step 202, the first via is not intended to limit by being the name for routing progress for ease of description.Equally,
One path-id also only for ease of description the first via by path-id carry out name, be not intended to limit.
It is provided according to BGP, is update (UPDATE) the message publication routing by BGP between bgp neighbor.Therefore, this step
The first via in rapid 202 is by being also to pass through the publication routing of BGP UPDATE message by bgp neighbor.Only bgp neighbor is being sent out
The cloth first via by when, if also for the first via by being assigned with the first i.e. above-mentioned path-id of path-id, also need to BGP
UPDATE message improves, so that BGP UPDATE message carries the first path-id, certainly, if not being the first route assignment
Path-id, then just It is not necessary to carry the first path-id in BGP UPDATE message.
Based on this, in this step 202 network equipment study bgp neighbor publication the first via by and determine bgp neighbor be
First path-id of the first route assignment includes:
Receive the BGP UPDATE message that bgp neighbor is sent；
Obtain the routing that BGP UPDATE message carries be the above-mentioned first via by；
If BGP UPDATE message carries path-id, the path-id that BGP UPDATE message carries is determined as above-mentioned
First path-id；
If BGP UPDATE message does not carry path-id, setting id is determined as above-mentioned first path-id.
Wherein, it can be arranged according to the actual situation when setting id specific implementation, be typically provided to an illegal path-id i.e.
Can, for example it is set as 0 or 0xFFFFFFFF.
Step 203, the network equipment searches bgp neighbor and the first path-id matching in the Route Distinguisher mapping table of acquisition
Mapping item (being denoted as the first mapping item), if finding, execute step 204, if not finding, execute step 205.
Step 204, the network equipment using the 2nd path-id in the first mapping item as the first via by path-id simultaneously
Publication.
As one embodiment, step 204 specifically: the network equipment is heavy by the 2nd path-id in the first mapping item
New work be the first via by path-id, and with the first via by carry together be distributed in BGP UPDATE message other BGP neighbour
It occupies.
This step 204 is that the network equipment executes under the premise of finding the first mapping item in Route Distinguisher mapping table
's.When, there are the first mapping item, also implying that the network equipment has been the first route assignment before GR in Route Distinguisher mapping table
The 2nd path-id of path-id, that is, above-mentioned, is based on this, is to guarantee the first via by before and after present networks equipment executes GR
Path-id is constant, even if then newly study arrives the first via by this step 204 is also no longer again should to the network equipment in step 202
First route assignment path-id, but directly adopt be before GR the first route assignment path-id it is i.e. above-mentioned second
Path-id as the first via by path-id and be distributed to other bgp neighbors.By step 201 to step 204, can be realized
The network equipment execute GR before and after the network equipment publication the first via by path-id it is constant.
Step 205, the network equipment distributes the 2nd path-id, and generating includes bgp neighbor, the first path-id and second
The mapping item of path-id is simultaneously recorded to the Route Distinguisher mapping table obtained, using the 2nd path-id of distribution as the routing
Path-id and be distributed to other bgp neighbors, by the mapping item of generation record the Route Distinguisher into back-up device mapping
Table.
This step 205 is that the network equipment executes under the premise of not finding the first mapping item in Route Distinguisher mapping table
's.When in Route Distinguisher mapping table be not present the first mapping item, also imply that the network equipment before GR also for the first via by
Path-id is distributed, this is based on, this step 204 just needs for the first route assignment path-id, to facilitate other bgp neighbors to identify
With distinguish the first via by.
As one embodiment, in step 205, the mapping item of generation is recorded to the Route Distinguisher into back-up device
Mapping table can include:
Whether judgement currently reaches the synchronization time of setting, if so, recording the mapping item of generation to back-up device
In Route Distinguisher mapping table, if not, wait until reach setting synchronization time when, by the mapping item of generation record to
Route Distinguisher mapping table in back-up device.Wherein, the synchronization time of setting can be arranged according to actual needs.
The mapping item of generation is synchronized to back-up device in this step 205, it is same before and after the network equipment executes GR to realize
The constant offer of path-id of one routing is supported (to be specifically shown in step 201 to step 204), realize few by synchronizing in back-up device
The path-id that the mapping item of amount can prevent the network equipment from executing the same routing in the front and back GR changes.
So far, process shown in Fig. 2 is completed.
It can be seen that in the present invention by process shown in Fig. 2, one Route Distinguisher mapping table of network equipment maintenance is simultaneously same
It walks to back-up device, after the network equipment executes GR, if routing is arrived in study, when there are present networks to set in Route Distinguisher mapping table
Standby is the path-id of the route assignment before GR, then still using be before present networks equipment the route assignment path-id as
The path-id of the routing currently learnt, the path-id for realizing the network equipment same routing in the front and back execution GR are constant.
Illustrate that process shown in Fig. 2 realized below by process shown in the prior art and Fig. 2 is compared in the network equipment
The path-id of same routing is constant before and after GR:
The prior art:
As shown in Figure 1, RT2 is established with RT1, RT3, RT4 bgp neighbor (such as IBGP neighbours) respectively, RT5 respectively with RT3,
RT4 establishes bgp neighbor (such as ebgp neighbor).
By taking RT5 issues a prefix as the routing of 1.1.1.1/32 as an example:
The routing that one prefix is 1.1.1.1/32 is carried and is sent to RT3 and RT4 in BGP UPDATE message by RT5.
For ease of description, the routing that a prefix of RT5 publication is 1.1.1.1/32 is denoted as routing 1_1 here.
RT3 and RT4 is by receiving the BGP UPDATE message study routing 1_1 that RT5 is sent.For ease of description, here will
The routing 1_1 that the routing 1_1 of RT3 study is denoted as routing 1_3, RT4 study is denoted as routing 1_4.
RT3 will route 1_3 carrying and be sent to RT2 in BGP UPDATE message, and RT4 will route 1_4 and carry in BGP
UPDATE message is sent to RT2.
RT2 distributes a Path- by receiving the BGP UPDATE message study routing 1_3 that RT3 is sent for routing 1_3
Id (being denoted as Path-id1_3) simultaneously carries the hair in BGP UPDATE message (being denoted as BGP UPDATE message 1_3) with routing 1_3
Give RT1.
RT2 distributes one by receiving the BGP UPDATE message study routing 1_4 that RT4 is sent for the routing 1_4 of study
Path-id (being denoted as Path-id1_4) is simultaneously carried with routing 1_4 BGP UPDATE message (being denoted as BGP UPDATE message 1_4)
In be sent to RT1.
RT1 receives the BGP UPDATE message 1_3 that RT2 is sent, study routing 1_3 and the Path-id for determining routing 1_3
For Path-id1_3；
RT1 receives the BGP UPDATE message 1_4 that RT2 is sent, study routing 1_4 and the Path-id for determining routing 1_4
For Path-id1_4.
Table 1 shows the routing of RT1 to RT4:
Table 1
Based on table 1, if the optimal routing from RT1 to 1.1.1.1/32 is determined according to optimal routing principle are as follows: RT1- >
RT2->RT4->RT5。
After RT2 enters GR, the neighbours between RT2 and RT1, RT3, RT4 are disconnected, such as table 2 of the routing of RT1 to RT4 at this time
It is shown:
Table 2
After RT2 has executed GR, if first establishing IBGP neighborhood with RT3, RT2 study is from the prefix that RT3 is issued
1.1.1.1/32 the i.e. above-mentioned routing 1_3 of routing redistributes Path-id (if being Path-id1_4) for routing 1_3,
RT2 will route 1_3, (be denoted as BGP UPDATE in BGP UPDATE message for the Path-id1_4 carrying that routing 1_3 is redistributed
Message 2_3) in be sent to RT1.RT1 equipment receives BGP UPDATE message 2_3, and study routing 1_3 simultaneously determines routing 1_3
Path-id be Path-id1_4, then by original path-id be Path-id1_4 routing, that is, above-mentioned routing 1_4 (Path-
Id1_4 it) is replaced.At this point, the routing of RT1 to RT4 is as shown in table 3:
Table 3
It can be seen from Table 3 that at this point, existing two routings to 1.1.1.1/32 of RT1 come from RT3.Cause
This can only determine optimal routing are as follows: RT1- > RT2- when according to the optimal optimal routing for routing determining RT1 to 1.1.1.1/32
The optimal routing of > RT3- > RT5, i.e. RT1 to 1.1.1.1/32 from original RT1- > RT2- > RT4- > RT5 be switched to RT1- >
RT2->RT3->RT5。
When RT2 is subsequent and RT4 establish IBGP neighborhood and learn to routing 1.1.1.1/32 i.e. above-mentioned routing 1_4 it
Afterwards, RT2 is that routing 1_4 redistributes Path-id (if being Path-id1_3).RT2 will route 1_4, be to route 1_4 again
The Path-id1_3 carrying of distribution is sent to RT1 in BGP UPDATE message (being denoted as BGP UPDATE message 2_4).RT1 is set
The standby Path-id for receiving BGP UPDATE message 2_4 study routing 1_4 and determining routing 1_4 is Path-id1_3, will be original
Path-id be routing, that is, above-mentioned routing 1_3 (Path-id1_3) of Path-id1_3 to being replaced.At this point, RT1 is to RT4's
Routing is as shown in table 4:
Table 4
In this way, based on table 4 as can be seen that two routings existing for RT1 to 1.1.1.1/32 are respectively from this time again
RT3 and RT4 determines that the optimal routing of RT1 to 1.1.1.1/32 is RT1- > RT2- > RT4- > RT5 according to optimal routing principle,
That is the optimal routing of RT1 to 1.1.1.1/32 from original RT1- > RT2- > RT3- > RT5 be switched to again RT1- > RT2- > RT4- >
RT5。
As can be seen that in the prior art, RT2 executes the front and back GR since the Path-id of same routing changes, cause
The optimal path of bgp neighbor RT1 to 1.1.1.1/32 switches repeatedly, influences the flow forwarding of RT1, will also result in whole network not
Stablize.
Based on this, the invention discloses process as shown in Figure 2, it is fully able to solve the defect of the above-mentioned prior art:
Still by taking above-mentioned RT5 issues a prefix as the routing of 1.1.1.1/32 as an example, then,
RT5 issues the routing that a prefix is 1.1.1.1/32 to RT3 and RT4 respectively；
After RT3 learns routing 1_3, RT3 will route 1_3 carrying and be sent to RT2 in BGP UPDATE message；
After RT4 learns routing 1_4, RT4 will route 1_4 carrying and be sent to RT2 in BGP UPDATE message.
RT2 is by receiving BGP UPDATE message the study routing 1_3, the BGP UPDATE of discovery RT3 publication that RT3 is sent
Message does not carry Path-id, then defaulting the Path-id that RT3 is routing 1_3 distribution is setting id such as 0.
RT2 is that routing 1_3 distributes a Path-id (being denoted as Path-id1_3), generates comprising RT3, Path-id1_3, sets
Determine the mapping item (being denoted as mapping item 1) of id and record to the local Route Distinguisher mapping table obtained, RT2 reflects this later
Firing table item 1 records the Route Distinguisher mapping table into back-up device.
RT2 will route 1_3, Path-id1_3 and carry in BGP UPDATE message (being denoted as BGP UPDATE message 1_3)
It is sent to RT1；
RT2 is by receiving the study of BGP UPDATE message the routing 1_4, the BGP UPDATE that discovery RT4 is sent that RT4 is sent
Message does not carry Path-id, then defaulting the Path-id that RT4 is routing 1_4 distribution is setting id such as 0.
RT2 is that routing 1_4 distributes a Path-id (being denoted as Path-id1_4), generates comprising RT4, Path-id1_4, sets
Determine the mapping item (being denoted as mapping item 2) of id and record to the Route Distinguisher mapping table locally obtained, RT2 is by the mapping later
List item 2 records the Route Distinguisher mapping table into back-up device.
RT2 will route 1_4, Path-id1_4 and carry in BGP UPDATE message (being denoted as BGP UPDATE message 1_4)
It is sent to RT1.
RT1 receives the BGP UPDATE message 1_3 that RT2 is sent, study routing 1_3 and the Path-id for determining routing 1_3
For Path-id1_3；
RT1 receives the BGP UPDATE message 1_4 that RT2 is sent, study routing 1_4 and the Path-id for determining routing 1_4
For Path-id1_4.
Table 5 shows the routing of RT1 to RT4:
Table 5
If according to optimal routing principle determine the optimal routing of RT1 to 1.1.1.1/32 for RT1- > RT2- > RT4- >
RT5。
When RT2 enters GR, the neighbours between RT2 and RT1, RT3, RT4 are disconnected, for example above-mentioned table of the routing of RT1 to RT4 at this time
Shown in 2.
After RT2 has executed GR, Route Distinguisher mapping table is obtained from back-up device.
If RT2 is first and RT3 establishes bgp neighbor, then RT2 study is from the road that the prefix that RT3 is issued is 1.1.1.1/32
By being above-mentioned routing 1_3, discovery RT3 is not routing 1_3 distribution Path-id, then defaulting RT3 is that routing 1_3 is distributed
Path-id is setting id such as 0.
RT2 using RT3, set id and search as keyword the mapping item comprising the keyword in Route Distinguisher mapping table i.e.
Above-mentioned mapping item 1；
Path-id1_3 in mapping item 1 is determined as routing the Path-id of 1_3 by RT2, carries together with routing 1_3
RT1 is sent in BGP UPDATE message, that is, above-mentioned BGP UPDATE message 1_3.
RT1 equipment receives BGP UPDATE message 1_3, and study routing 1_3 simultaneously determines that the Path-id of routing 1_3 is
Path-id1_3, discovery have currently had recorded the routing 1_3 that the Path-id from RT3 publication is Path-id1_3, then can be direct
The aging mark for the routing 1_3 that the Path-id for refreshing RT3 publication is Path-id1_3.Here aging mark can be
One ageing timer can start an ageing timer when RT1 records a routing for the routing.
At this point, the routing of RT1 to RT4 is as shown in table 6:
Table 6
As can be seen that RT2, before and after executing GR, the Path-id of the routing 1_3 of publication does not change, and is always
Path-id1_3, be thus not in the prior art RT2 again be routing 1_3 distribution Path-id such as Path-id1_4
The case where.In this way, for RT1, RT1 no longer as the prior art because the Path-id of routing 1_3 change such as from
Path-id1_3 variation replaces the corresponding routing 1_4 of the Path-id1_4 originally for Path-id1_4, so that RT1 is deposited always
Constant in two routings to 1.1.1.1/32, the optimal routing of RT1 to 1.1.1.1/32 is constant, is still RT1- > RT2- > RT4-
>RT5。
Equally, when RT2 is subsequent and RT4 establish bgp neighbor and learn to routing 1.1.1.1/32 i.e. above-mentioned routing 1_4 it
Afterwards, discovery RT4 is not routing 1_4 distribution Path-id, then defaulting the Path-id that RT4 is routing 1_4 distribution is setting id ratio
Such as 0.
RT2 using RT4, set id and search as keyword the mapping item comprising the keyword in Route Distinguisher mapping table i.e.
Above-mentioned mapping item 2；
Path-id1_4 in mapping item 2 is determined as routing the Path-id of 1_4 by RT2, carries together with routing 1_4
RT1 is sent in BGP UPDATE message, that is, above-mentioned BGP UPDATE message 1_4.
RT1 equipment receives BGP UPDATE message 1_4 study routing 1_4 and determines that the Path-id of routing 1_4 is Path-
Id1_4, discovery have currently had recorded the routing 1_4 that the Path-id from RT4 publication is Path-id1_4, then can directly refresh
The aging mark for the routing 1_4 that the Path-id of RT4 publication is Path-id1_4.At this point, the routing of RT1 to RT4 such as table
Shown in 7:
Table 7
It can be seen from Table 7 that RT2, before and after executing GR, the same routing of publication routes the Path-id of 1_4 not
Change, be always Path-id1_4, be not in the prior art RT2 again be routing 1_4 distribution Path-id such as
The case where Path-id1_3.In this way, RT1 is no longer as the prior art because the Path-id of routing 1_4 becomes for RT1
Change and such as replaces the corresponding routing 1_4 of the Path-id1_3 originally for Path-id1_3 from Path-id1_4 variation, so that
RT1 has that two routings to 1.1.1.1/32 are constant, and the optimal routing of RT1 to 1.1.1.1/32 is still constant, still always
For RT1- > RT2- > RT4- > RT5.
As can be seen that the Path-id that RT2 executes the same routing in the front and back GR is constant, bgp neighbor by process as shown in Figure 2
That is RT1 determine to 1.1.1.1/32 optimal path it is constant always, compared with prior art, ensure that RT1 flow forwarding and it is whole
A unstable networks.
Method provided by the invention is described above.The apparatus provided by the present invention will be described below:
Referring to Fig. 3, Fig. 3 is structure drawing of device provided by the invention.The device is applied to enable BGP Add-path spy
The network equipment of property, comprising:
Acquiring unit, for obtaining Route Distinguisher mapping table from specified back-up device after Graceful Restart moves GR；
Determination unit, for learning the routing of bgp neighbor publication and determining that the bgp neighbor is the route assignment
First identifier path-id；
Searching unit, for searching the bgp neighbor and in the Route Distinguisher mapping table that the acquiring unit obtains
The matched mapping item of one path-id,
Processing unit, for when the searching unit finds the mapping item, by the mapping item
Path-id and publication of two path-id as the routing, when the searching unit does not find the mapping item, point
With the 2nd path-id, generate comprising the bgp neighbor, the mapping item of the first path-id and the 2nd path-id and record extremely
The Route Distinguisher mapping table that the acquiring unit obtains, the 2nd path-id of distribution is concurrent as the path-id of the routing
The mapping item of generation is recorded the Route Distinguisher mapping table into the back-up device by cloth.
Preferably, the specified back-up device is the memory module specified in this equipment, and the memory module has non-
The Route Distinguisher mapping table of volatile characteristic, storage is not lost because of this equipment GR；Alternatively,
The specified back-up device is the device independently of this equipment, for backing up the mapping of the Route Distinguisher in this equipment
Table.
Preferably, the determination unit learns the routing of bgp neighbor publication by following steps and determines bgp neighbor
Include: for the first identifier path-id of the route assignment
Receive the bgp update UPDATE message that bgp neighbor is sent；
Obtain the routing that BGP UPDATE message carries；
If BGP UPDATE message carries path-id, the path-id that BGP UPDATE message carries is determined as described
First path-id；
If BGP UPDATE message does not carry path-id, setting id is determined as the first path-id.
Preferably, the mapping item of generation is recorded the mapping of the Route Distinguisher into the back-up device by the processing unit
Table includes:
Whether judgement currently reaches the synchronization time of setting, if so, recording the mapping item of generation to the backup
Route Distinguisher mapping table in device, if not, waiting until remembering the mapping item of generation when reaching the synchronization time of setting
Record the Route Distinguisher mapping table into the back-up device.
So far, device description provided by the invention is completed.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all in essence of the invention
Within mind and principle, any modification, equivalent substitution, improvement and etc. done be should be included within the scope of the present invention.
Claims (8)
1. a kind of route processing method, which is characterized in that this method is additional applied to Border Gateway Protocol (BGP) path is enabled
The network equipment of Add-path characteristic, comprising:
After Graceful Restart moves GR, Route Distinguisher mapping table is obtained from specified back-up device；
Learn the routing of bgp neighbor publication and determines that the bgp neighbor is the first identifier path-id of the route assignment；
The bgp neighbor and the first matched mapping item of path-id are searched in the Route Distinguisher mapping table of acquisition, if searching
It arrives, using the 2nd path-id in the mapping item as the path-id of the routing and publication, if not finding,
The 2nd path-id is distributed, generates the mapping item comprising the bgp neighbor, the first path-id and the 2nd path-id simultaneously
Record to the Route Distinguisher mapping table obtained will using the 2nd path-id of distribution as the path-id of the routing and publication
The mapping item of generation records the Route Distinguisher mapping table into the back-up device.
2. the method according to claim 1, wherein the specified back-up device is specified in this equipment deposits
Module is stored up, the memory module has non-volatile characteristic；Alternatively,
The specified back-up device is the device independently of this equipment, for backing up the Route Distinguisher mapping table in this equipment.
3. the method according to claim 1, wherein described learn the routing and determine that bgp neighbor is issued
Bgp neighbor is that the first identifier path-id of route assignment includes:
Receive the bgp update UPDATE message that bgp neighbor is sent；
Obtain the routing that BGP UPDATE message carries；
If BGP UPDATE message carries path-id, the path-id that BGP UPDATE message carries is determined as described first
path-id；
If BGP UPDATE message does not carry path-id, setting id is determined as the first path-id.
4. the method according to claim 1, wherein described record the mapping item of generation to the backup fills
Route Distinguisher mapping table in setting includes:
Whether judgement currently reaches the synchronization time of setting, if so, recording the mapping item of generation to the back-up device
In Route Distinguisher mapping table, if not, wait until reach setting synchronization time when, by the mapping item of generation record to
Route Distinguisher mapping table in the back-up device.
5. a kind of route processing device, which is characterized in that the device is additional applied to Border Gateway Protocol (BGP) path is enabled
The network equipment of Add-path characteristic, comprising:
Acquiring unit, for obtaining Route Distinguisher mapping table from specified back-up device after Graceful Restart moves GR；
Determination unit, for learning the routing of bgp neighbor publication and determining that the bgp neighbor is the of the route assignment
One mark path-id；
Searching unit, for searching the bgp neighbor and first in the Route Distinguisher mapping table that the acquiring unit obtains
The matched mapping item of path-id,
Processing unit, for when the searching unit finds the mapping item, by second in the mapping item
Path-id and publication of the path-id as the routing, when the searching unit does not find the mapping item, distribution
2nd path-id is generated comprising the bgp neighbor, the mapping item of the first path-id and the 2nd path-id and record to institute
The Route Distinguisher mapping table of acquiring unit acquisition is stated, the 2nd path-id of distribution is concurrent as the path-id of the routing
The mapping item of generation is recorded the Route Distinguisher mapping table into the back-up device by cloth.
6. device according to claim 5, which is characterized in that the specified back-up device is specified in this equipment deposits
Module is stored up, the memory module has non-volatile characteristic；Alternatively,
The specified back-up device is the device independently of this equipment, for backing up the Route Distinguisher mapping table in this equipment.
7. device according to claim 5, which is characterized in that the determination unit learns bgp neighbor by following steps
The routing of publication and determining bgp neighbor are that the first identifier path-id of the route assignment includes:
Receive the bgp update UPDATE message that bgp neighbor is sent；
Obtain the routing that BGP UPDATE message carries；
If BGP UPDATE message carries path-id, the path-id that BGP UPDATE message carries is determined as described first
path-id；
If BGP UPDATE message does not carry path-id, setting id is determined as the first path-id.
8. device according to claim 5, which is characterized in that the processing unit records the mapping item of generation to institute
The Route Distinguisher mapping table stated in back-up device includes:
Whether judgement currently reaches the synchronization time of setting, if so, recording the mapping item of generation to the back-up device
In Route Distinguisher mapping table, if not, wait until reach setting synchronization time when, by the mapping item of generation record to
Route Distinguisher mapping table in the back-up device.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610866065.3A CN106411728B (en) | 2016-09-29 | 2016-09-29 | Route processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610866065.3A CN106411728B (en) | 2016-09-29 | 2016-09-29 | Route processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106411728A CN106411728A (en) | 2017-02-15 |
| CN106411728B true CN106411728B (en) | 2019-10-11 |
Family
ID=59229481
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610866065.3A Active CN106411728B (en) | 2016-09-29 | 2016-09-29 | Route processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106411728B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114978988A (en) * | 2019-06-28 | 2022-08-30 | 华为技术有限公司 | Method and device for realizing table entry backup |
| CN114374643B (en) * | 2021-12-22 | 2024-02-09 | 新华三技术有限公司合肥分公司 | Communication method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101420327A (en) * | 2008-12-02 | 2009-04-29 | 杭州华三通信技术有限公司 | Method for avoiding routing oscillation in smooth restarting process and smooth restarting equipment |
| CN101471940A (en) * | 2007-12-28 | 2009-07-01 | 华为技术有限公司 | Method, system and device for synchronizing BGP route |
| CN102404189A (en) * | 2010-09-15 | 2012-04-04 | 杭州华三通信技术有限公司 | Main and standby switching method of device supporting multi-topology routing as well as master control board |
| CN102571425A (en) * | 2011-12-28 | 2012-07-11 | 杭州华三通信技术有限公司 | Method and device for smoothly restarting border gateway protocol |
| US8780692B2 (en) * | 2011-04-25 | 2014-07-15 | Cisco Technology, Inc. | Accelerated routing convergence |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101997757B (en) * | 2009-08-19 | 2012-10-17 | 华为技术有限公司 | Method, equipment and system for transferring routing information |
| CN102624635B (en) * | 2012-04-23 | 2014-12-24 | 杭州华三通信技术有限公司 | Method and device for realizing graceful restart |
-
2016
- 2016-09-29 CN CN201610866065.3A patent/CN106411728B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101471940A (en) * | 2007-12-28 | 2009-07-01 | 华为技术有限公司 | Method, system and device for synchronizing BGP route |
| CN101420327A (en) * | 2008-12-02 | 2009-04-29 | 杭州华三通信技术有限公司 | Method for avoiding routing oscillation in smooth restarting process and smooth restarting equipment |
| CN102404189A (en) * | 2010-09-15 | 2012-04-04 | 杭州华三通信技术有限公司 | Main and standby switching method of device supporting multi-topology routing as well as master control board |
| US8780692B2 (en) * | 2011-04-25 | 2014-07-15 | Cisco Technology, Inc. | Accelerated routing convergence |
| CN102571425A (en) * | 2011-12-28 | 2012-07-11 | 杭州华三通信技术有限公司 | Method and device for smoothly restarting border gateway protocol |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106411728A (en) | 2017-02-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107733793B (en) | Forwarding table item maintenance method and device | |
| US10887192B2 (en) | Targeted network discovery and visualizations | |
| US7756027B1 (en) | Automatic configuration of virtual network switches | |
| US8589588B2 (en) | Method of identifying domain-to-domain link based on automatically switched optical network | |
| CN106470158B (en) | Message forwarding method and device | |
| US8934490B2 (en) | Accelerated MAC address resolution for IPv6 traffic with IS-IS protocol | |
| US10574570B2 (en) | Communication processing method and apparatus | |
| CN108432191A (en) | Communication between network controller | |
| CN106411728B (en) | Route processing method and device | |
| CN114024886B (en) | Cross-resource-pool network intercommunication method, electronic equipment and readable storage medium | |
| CN108494684B (en) | Method and device for establishing tunnel | |
| US8432909B2 (en) | Methods and systems for using a link management interface to distribute information in a communications network | |
| US20190109781A1 (en) | Route Establishment and Message Sending | |
| CN102752205A (en) | Route iteration method and device | |
| CN102484611A (en) | Link state identifier collision handling | |
| CN110572273A (en) | method for automatically deploying physical network | |
| WO2021254173A1 (en) | Routing processing method and related device | |
| CN105591911B (en) | A kind of generation method and device of LSP | |
| US10419282B1 (en) | Self-configuring network devices | |
| CN107911495B (en) | MAC address synchronization method and VTEP | |
| CN109194575A (en) | Route selection method and device | |
| CN108259205B (en) | Route publishing method and network equipment | |
| CN106230717B (en) | Route obtaining method and device in cluster system | |
| CN104967562B (en) | A kind of method for routing between internet of things equipment node | |
| CN101626341B (en) | Method and device for synchronizing information under link-state protocol |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No. Applicant after: Xinhua three Technology Co., Ltd. Address before: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No. Applicant before: Huasan Communication Technology Co., Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |