CN103973558B - A kind of route advertising method and device - Google Patents
A kind of route advertising method and device Download PDFInfo
- Publication number
- CN103973558B CN103973558B CN201410216809.8A CN201410216809A CN103973558B CN 103973558 B CN103973558 B CN 103973558B CN 201410216809 A CN201410216809 A CN 201410216809A CN 103973558 B CN103973558 B CN 103973558B
- Authority
- CN
- China
- Prior art keywords
- route
- neighbours
- same purpose
- backup
- optimal
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides a kind of route advertising method and device.Methods described includes：Backup neighborhood is set up with adjacent node；When reaching same purpose and there are more than one route, notice it is non-optimal is routed to the backup neighbours, when reaching same purpose and having only existed a route, notice only exist described and be routed to the backup neighbours.Realized by technical scheme when the same purpose of arrival there may be more than one and route, can there be two different routes for reaching the same purpose on each adjacent node, and then equal-cost route or route stand-by are formed, to avoid causing flow interrupt when optimal route is unable to reach.
Description
Technical field
The present invention relates to communication technical field, more particularly to a kind of route advertising method and device.
Background technology
BGP (Border Gateway Protocol, Border Gateway Protocol) is a kind of for AS (Autonomous
System, autonomous system) between dynamic routing protocol.The router of transmission BGP message can also receive or produce new
Routing iinformation, and it is distributed to other bgp neighbors.When the router for sending BGP message receives the new route from other AS,
If the route is more excellent than currently known route or current also not no route, the router will issue this route
To the every other bgp neighbor in this AS.
Traditional bgp protocol regulation a, neighbours can only notice a route for same purpose.Also imply that,
Even if transmitting terminal reaches same purpose and there are a plurality of route, when receiving terminal is advertised to, one only also can be noticed most
Excellent route.Once this routing failure, during waiting neighbours to re-issue route, it is possible to can cause in flow
It is disconnected.
The content of the invention
In view of this, the present invention provides a kind of route advertising method and device
Specifically, the present invention is achieved through the following technical solutions：
A kind of route advertising method, methods described includes：
Backup neighborhood is set up with adjacent node；
When the same purpose of arrival there are more than one route, notice is non-optimal to be routed to the backup neighbours,
When reaching same purpose and having only existed a route, notice only exist described and be routed to the backup neighbours.
Further, described when the same purpose of arrival there are more than one route, notice is non-optimal to be routed to institute
Backup neighbours are stated, when reaching same purpose and having only existed a route, only exist described is noticed and is routed to the backup
Neighbours include：
When reaching same purpose and there are more than one route, notice it is described it is non-optimal be routed to do not report it is described
The backup neighbours of non-optimal route；
When reaching same purpose and having only existed a route, notice only exist described and be routed to not report and only deposit
The route backup neighbours.
Further, the non-optimal route is hypo-optimal route.
Further, common neighborhood is set up with adjacent node；
When the same purpose of arrival there are more than one route, notice is optimal to be routed to the common neighbours.
Further, the route is BGP routes.
A kind of advertising of route device, described device includes：
Neighbours set up unit, for setting up backup neighborhood with adjacent node；
Advertising of route unit, for when the same purpose of arrival there are more than one route, noticing non-optimal route
To the backup neighbours, when reaching same purpose and having only existed a route, notice only exist described be routed to it is described
Back up neighbours.
Further, the advertising of route unit, specifically for there are more than one route in the same purpose of arrival
When, notice and described non-optimal be routed to the backup neighbours for not reporting the non-optimal route；Only deposited reaching same purpose
When there is a route, notice only exist described and be routed to the backup neighbours for not reporting the route only existed.
Further, the non-optimal route is hypo-optimal route.
Further, the neighbours set up unit, are further used for setting up common neighborhood with adjacent node；
The advertising of route unit, is further used for when the same purpose of arrival there are more than one route, notice
It is optimal to be routed to the common neighbours.
Further, the route is BGP routes.
In the present embodiment it can be seen from above description, RR is adjacent with each on the basis of common neighborhood is set up
Client computer sets up backup neighborhood, when the same purpose of arrival there are more than one route, notices non-optimal is routed to
Neighbours are backed up, to have two different routes for reaching same purpose on each adjacent node, and then are formed
Equal-cost route or route stand-by, to avoid causing flow interrupt when optimal route is unable to reach.
Brief description of the drawings
Fig. 1 is a kind of typical IBGP networking schematic diagrams；
Fig. 2 is the schematic flow sheet of bgp route advertisement method in one embodiment of the present invention；
Fig. 3 is IBGP networking schematic diagrams in one embodiment of the present invention；
Fig. 4 is the building-block of logic of bgp route advertisement device in one embodiment of the present invention.
Embodiment
It refer to Fig. 1, a kind of typical IBGP (Internal BGP, the BGP operated in same AS) networking signal
Figure.To ensure the connectedness between IBGP peer-to-peers (being exchanged with each other the BGP speaker of route), it is necessary between IBGP peer-to-peers
Set up neighborhood.Assuming that there is N platform routers inside an AS, then the quantity for setting up neighborhood is exactly N (N-1)/2.When
When IBGP peer quantities are a lot, the consumption to Internet resources and cpu resource is all very big.Then, RR is introduced in IBGP networkings
(Route Reflector, Router Reflector).Other routers set up neighborhood as client computer (Client) and RR, by
RR collects the routing iinformation that each client computer is reported, and notices the routing iinformation to other client computer, and is not required between client computer
Set up neighborhood.
But RR is constrained by bgp protocol, one can only be noticed and be routed to client computer.It is assumed that client computer 1 and client computer 2
All reported the same purpose of arrival, IP address be 1.1.1.1/32 route, RR warps it was found that the route that reports of client computer 1 most
It is excellent, then the advertising of route that can only report client computer 1 is to client computer 3,4 and 5.Even if there is multiple RR, its optimal road selected
By being also often consistent.That is above-mentioned same purpose is reached in client computer 3,4 and 5, that is, reaches IP address 1.1.1.1/
32 path only has one, once this paths failure, it is necessary to first perceived by RR, then notices other and is routed to client again
Machine 3,4 and 5, this process may can cause have flow interrupt in client computer 3,4 and 5.
In view of this, one embodiment of the invention provides a kind of route advertising method, and methods described is applied on network devices,
Such as, RR equipment.Fig. 2 is refer to, methods described comprises the following steps：
Step 201, backup neighborhood is set up with adjacent node.
Step 202, when the same purpose of arrival there are more than one route, notice is non-optimal to be routed to the backup
Neighbours, when reaching same purpose and having only existed a route, notice only exist described and are routed to the backup neighbours.
Here, the optimal route is typically referred in a plurality of route for reaching same purpose, the minimum route of overhead value,
It is other beyond the minimum route of overhead value and the non-optimal route is typically referred in a plurality of route for reaching same purpose
Route.In the present embodiment, the route can be BGP routes.
Specifically, still by taking the network environment shown in Fig. 1 as an example.In a kind of current implementation method, RR equipment and conduct
The client computer 1 of adjacent node to client computer 5 sets up neighborhood.RR equipment there are more than one road in the same purpose of arrival
By when, choose optimal route and be simultaneously advertised to the neighbours.It is referred to as common neighborhood in neighborhood herein, the application.
In the present embodiment, design sets up backup neighborhood by RR equipment and adjacent node, and RR equipment collects each phase
The routing iinformation that neighbors is reported, when the same purpose of arrival there are more than one route, RR equipment notices non-optimal road
By to the backup neighbours.Meanwhile, RR equipment can also set up common neighborhood with adjacent node, and RR equipment collects each phase
The routing iinformation that neighbors is reported, when the same purpose of arrival there are more than one route, RR equipment notices optimal route
To the common neighbours.It can thus be seen that for each adjacent node of RR equipment, can essentially be with RR equipment
Establish the common neighborhood of two neighborhoods, i.e., one and a seniority in the family neighborhood.And then each phase of RR equipment
Neighbors can all receive two different routes of RR notices.The adjacent node is according to the same purpose of the arrival received
Two different routes, can form equal-cost route either main standby route, so as to when optimal route can not be reached, can be by
Flow is switched in the non-optimal route in time, it is to avoid flow interrupt.
In fact, for RR, itself and need not perceive be with each adjacent node establish two it is different
Neighborhood, it is only necessary to common neighborhood and backup neighborhood can be distinguished.Then backup neighborhood is enabled
Characteristic：When the same purpose of arrival there are more than one route, notice is non-optimal to be routed to the backup neighbours, reaches
When same purpose has only existed a route, notice only exist described and be routed to the backup neighbours.The implementation of the application
In example, the non-optimal route can be hypo-optimal route.
Further, when reaching same purpose and there are more than one route, described non-optimal be routed to not is noticed
There are the backup neighbours for reporting the non-optimal route；When the same purpose of arrival has only existed a route, notice is only existed
Described be routed to the backup neighbours for not reporting the route only existed.Specifically, road report can be recorded in RR equipment
By adjacent node, whether when needing notice to be routed to adjacent node, it is to report road to be noticed first to judge the adjacent node
By equipment, if it is, be not repeated notice.
For example, Fig. 3 is refer to, RR and adjacent node client computer 1 to client computer 5 establish common neighborhood respectively
With backup neighborhood.It is assumed that client computer 1 and client computer 2 have all reported the same purpose of arrival (such as：IP address is
1.1.1.1/32 route), respectively route 1 and route 2, wherein route 1 is optimal route.So, RR can notice the road
Common neighbours are given by 1, i.e., by common neighborhood link advertisement route 1 shown in solid in Fig. 3 to client computer 1 to client computer
5.Meanwhile, RR can notice the route 2 to backup neighbours, that is, pass through backup neighborhood link advertisement shown in dotted lines in Figure 3
Route 2 is to client computer 1 to client computer 5.So, in client computer 1 to client computer 5, will there be the above-mentioned same purpose of arrival
Two different routes of (IP address is 1.1.1.1/32)：Route 1 and route 2.According to the route 1 and route 2, client computer
1 reaches the main standby route of above-mentioned purpose (IP address is 1.1.1.1/32) to can just be formed in client computer 5.Further, by
The optimal route 1 is reported in client computer 1, client computer 2 has reported the hypo-optimal route 2, therefore RR equipment passes through common neighbours
The relational link notice route 1 is to client computer 2 to client computer 5, by backing up route 2 described in neighborhood link advertisement to visitor
Family machine 1, client computer 3, client computer 4 and client computer 5.
In the present embodiment it can be seen from above description, RR is adjacent with each on the basis of common neighborhood is set up
Client computer sets up backup neighborhood, when the same purpose of arrival there are more than one route, notices non-optimal is routed to
Neighbours are backed up, to have two different routes for reaching same purpose on each adjacent node, and then are formed
Equal-cost route or route stand-by, to avoid causing flow interrupt when optimal route is unable to reach.
Another embodiment of the present invention provides a kind of advertising of route device, and described device is applied on network devices, such as,
RR equipment.As the operation carrier of apparatus of the present invention, the hardware environment of the network equipment typically at least includes CPU, internal memory
And nonvolatile memory, the hardware such as various forwarding chips, I/O interfaces are also possible that certainly.Fig. 4 is refer to, with software
Exemplified by realization, the present embodiment is read the wherein corresponding computer program instructions of non-volatile memories by the CPU of the equipment
Run in internal memory, include the advertising of route device：Neighbours set up unit and advertising of route unit.The one of the present invention
Plant in embodiment：
The neighbours set up unit, for setting up backup neighborhood with adjacent node；
The advertising of route unit, for when the same purpose of arrival there are more than one route, noticing non-optimal
The backup neighbours are routed to, when reaching same purpose and having only existed a route, only exist described is noticed and is routed to
The backup neighbours.
Further, the advertising of route unit, specifically for there are more than one route in the same purpose of arrival
When, notice and described non-optimal be routed to the backup neighbours for not reporting the non-optimal route；Only deposited reaching same purpose
When there is a route, notice only exist described and be routed to the backup neighbours for not reporting the route only existed.
Further, the non-optimal route is hypo-optimal route.
Further, the neighbours set up unit, for setting up common neighborhood with adjacent node；The advertising of route
Unit, for when the same purpose of arrival there are more than one route, notice is optimal to be routed to the common neighbours.
Further, the route is BGP routes.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all essences in the present invention
God is with principle, and any modification, equivalent substitution and improvements done etc. should be included within the scope of protection of the invention.
Claims (8)
1. a kind of route advertising method, it is characterised in that methods described includes：
Common neighborhood is set up with adjacent node；
When the same purpose of arrival there are more than one route, notice is optimal to be routed to the common neighbours；
Backup neighborhood is set up with adjacent node；
When the same purpose of arrival there are more than one route, notice is non-optimal to be routed to the backup neighbours, reaches
When same purpose has only existed a route, notice only exist described and be routed to the backup neighbours.
2. according to the method described in claim 1, it is characterised in that described to there are more than one road in the same purpose of arrival
By when, notice it is non-optimal is routed to the backup neighbours, when reaching same purpose and having only existed a route, notice is only deposited
The backup neighbours are routed to described in be included：
When reaching same purpose and there are more than one route, notice it is described it is non-optimal be routed to do not report it is described it is non-most
The backup neighbours of excellent route；
When the same purpose of arrival has only existed a route, notice described be routed to only existed and do not report what is only existed
The backup neighbours of the route.
3. method according to claim 1 or 2, it is characterised in that
The non-optimal route is hypo-optimal route.
4. according to the method described in claim 1, it is characterised in that
The route is Border Gateway Protocol (BGP) route.
5. a kind of advertising of route device, it is characterised in that described device includes：
Neighbours set up unit, for setting up backup neighborhood with adjacent node；
Advertising of route unit, for when the same purpose of arrival there are more than one route, notice is non-optimal to be routed to institute
Backup neighbours are stated, when reaching same purpose and having only existed a route, only exist described is noticed and is routed to the backup
Neighbours；
The neighbours set up unit, are further used for setting up common neighborhood with adjacent node；
The advertising of route unit, is further used for, when the same purpose of arrival there are more than one route, noticing optimal
It is routed to the common neighbours.
6. device according to claim 5, it is characterised in that
The advertising of route unit, specifically for when the same purpose of arrival there are more than one route, noticing described non-
It is optimal to be routed to the backup neighbours for not reporting the non-optimal route；A route has been only existed reaching same purpose
When, notice only exist described and be routed to the backup neighbours for not reporting the route only existed.
7. device according to claim 5, it is characterised in that
The non-optimal route is hypo-optimal route.
8. device according to claim 5, it is characterised in that
The route is BGP routes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410216809.8A CN103973558B (en) | 2014-05-21 | 2014-05-21 | A kind of route advertising method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410216809.8A CN103973558B (en) | 2014-05-21 | 2014-05-21 | A kind of route advertising method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103973558A CN103973558A (en) | 2014-08-06 |
| CN103973558B true CN103973558B (en) | 2017-09-15 |
Family
ID=51242620
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410216809.8A Active CN103973558B (en) | 2014-05-21 | 2014-05-21 | A kind of route advertising method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103973558B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104301245B (en) * | 2014-10-22 | 2017-11-10 | 新华三技术有限公司 | Flow forwarding method and device in a kind of hybrid protocol networking |
| CN106878175B (en) * | 2017-03-27 | 2020-03-06 | 新华三技术有限公司 | BGP route processing method and device and BGP equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101924684A (en) * | 2009-06-12 | 2010-12-22 | 华为技术有限公司 | Routing processing method and system as well as router |
| CN102026330A (en) * | 2009-09-10 | 2011-04-20 | 深圳市航天无线通信技术有限公司 | Method for improving availability of ad hoc network |
| CN103516601A (en) * | 2012-06-29 | 2014-01-15 | 华为技术有限公司 | Method, device and system for route transmission |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7813265B2 (en) * | 2006-03-09 | 2010-10-12 | Cisco Technology, Inc. | Backup BGP paths for non-multipath BGP fast convergence |
-
2014
- 2014-05-21 CN CN201410216809.8A patent/CN103973558B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101924684A (en) * | 2009-06-12 | 2010-12-22 | 华为技术有限公司 | Routing processing method and system as well as router |
| CN102026330A (en) * | 2009-09-10 | 2011-04-20 | 深圳市航天无线通信技术有限公司 | Method for improving availability of ad hoc network |
| CN103516601A (en) * | 2012-06-29 | 2014-01-15 | 华为技术有限公司 | Method, device and system for route transmission |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103973558A (en) | 2014-08-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3065342B1 (en) | Update of mac routes in evpn single-active topology | |
| US10069708B2 (en) | Monitoring through S-BFD (seamless bidirectional forwarding detection) | |
| US9197583B2 (en) | Signaling of attachment circuit status and automatic discovery of inter-chassis communication peers | |
| EP3151485A1 (en) | Egress node protection in evpn all-active topology | |
| US8537720B2 (en) | Aggregating data traffic from access domains | |
| US9306838B2 (en) | Method for avoiding a loop in a network | |
| EP3422632B1 (en) | Pim join entropy | |
| CN108696440A (en) | Multicast load balancing in multiple home to return to EVPN networks | |
| US20220272032A1 (en) | Malleable routing for data packets | |
| US9288067B2 (en) | Adjacency server for virtual private networks | |
| WO2020135395A1 (en) | Notification method and device for prefix identifier of cross-interior gateway protocol | |
| CN104253736A (en) | PE (provider edge) equipment and method for notifying same of information | |
| CN104410570B (en) | A kind of data transmission method and device based on VRRP | |
| CN105162704A (en) | Multicast replication method and device in Overlay network | |
| CN105337870A (en) | Route publishing method and device | |
| CN103825760A (en) | Method and device for setting up neighborhood on basis of OSPF protocol | |
| CN104702480A (en) | Method and device for establishing tunnel protection group in next generation multicast virtual private network | |
| CN102780615A (en) | Link backup method and routing forwarding device | |
| CN102546409B (en) | Method and RB (route bridge) for processing message based on TRILL (Transparent Interconnection of Lots of Links) network | |
| CN103973558B (en) | A kind of route advertising method and device | |
| CN110120906B (en) | Method and device for realizing dual active access TRILL park edge | |
| CN113872843B (en) | Route generation method, route processing method and device | |
| WO2018036453A1 (en) | Method for synchronizing topology information in sfc network and routing network element | |
| US20230029882A1 (en) | Exit interface selection based on intermediate paths | |
| CN111865803B (en) | Route processing method and device based on EVPN |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into 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 |