CN103973558A - Route advertisement method and device - Google Patents
Route advertisement method and device Download PDFInfo
- Publication number
- CN103973558A CN103973558A CN201410216809.8A CN201410216809A CN103973558A CN 103973558 A CN103973558 A CN 103973558A CN 201410216809 A CN201410216809 A CN 201410216809A CN 103973558 A CN103973558 A CN 103973558A
- Authority
- CN
- China
- Prior art keywords
- route
- backup
- neighbours
- arrival
- same object
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a route advertisement method and device. The method comprises the steps that a backup neighborhood relation between adjacent nodes is built; when one or more routes exist in the same destination arrival, backup neighborhoods are informed of non-optimal routes, and when only one route exists in the same destination arrival, the backup neighborhoods are informed the only route. According to the technical scheme, when one or more routes exist in the same destination arrival, every two adjacent nodes can contain two different routes for the same destination arrival, and then equivalent routing or backup routing is formed so as to avoid flow interruption caused when the optimal route cannot arrive at the destination.
Description
Technical field
The present invention relates to communication technical field, relate in particular to a kind of route advertising method and device.
Background technology
BGP (Border Gateway Protocol, Border Gateway Protocol) is a kind of for the dynamic routing protocol between AS (Autonomous System, autonomous system).The router that sends BGP message also can receive or produce new routing iinformation, and is distributed to other bgp neighbor.In the time sending the router of BGP message and receive the new route from other AS, if this route than current known route more excellent or current also this route not, this router will be distributed to the every other bgp neighbor in this AS this route.
Traditional bgp protocol regulation, neighbours, for same object, can only notice a route.Also just mean, have many routes even if transmitting terminal arrives same object, in noticing to receiving terminal, also only can notice an optimum route.Once this routing failure, waiting for that neighbours re-issue in the process of route, just may cause the interruption of flow.
Summary of the invention
In view of this, the invention provides a kind of route advertising method and device
Particularly, the present invention is achieved through the following technical solutions:
A kind of route advertising method, described method comprises:
Set up backup neighborhood with adjacent node;
In the time that the same object of arrival has more than a route, notice non-optimum route to described backup neighbours, in the time that the same object of arrival only has a route, notice the described route only existing to described backup neighbours.
Further, described in the time that the same object of arrival has more than a route, notice non-optimum route to described backup neighbours, in the time that the same object of arrival only has a route, notice the described route only existing and comprise to described backup neighbours:
In the time that the same object of arrival has more than a route, notice described non-optimum route to the backup neighbours that do not report described non-optimum route;
In the time that the same object of arrival only has a route, notice the described route only existing to the backup neighbours that do not report described route only.
Further, described non-optimum route is hypo-optimal route.
Further, set up common neighborhood with adjacent node;
In the time that the same object of arrival has more than a route, notice optimum route to described common neighbours.
Further, described route is BGP route.
A kind of advertising of route device, described device comprises:
Neighbours set up unit, for setting up backup neighborhood with adjacent node;
Advertising of route unit, in the time that the same object of arrival has more than a route, notices non-optimum route to described backup neighbours, in the time that the same object of arrival only has a route, notices the described route only existing to described backup neighbours.
Further, described advertising of route unit, specifically in the time that the same object of arrival has more than a route, notices described non-optimum route to the backup neighbours that do not report described non-optimum route; In the time that the same object of arrival only has a route, notice the described route only existing to the backup neighbours that do not report described route only.
Further, described non-optimum route is hypo-optimal route.
Further, described neighbours set up unit, are further used for setting up common neighborhood with adjacent node;
Described advertising of route unit, is further used for, in the time that the same object of arrival has more than a route, noticing optimum route to described common neighbours.
Further, described route is BGP route.
Can be found out by above description, in the present embodiment, RR is on the basis of setting up common neighborhood, client computer adjacent with each set up backup neighborhood, in the time that the same object of arrival has more than a route, notice non-optimum route to backup neighbours, to make can both there be two different routes that arrive same object on each adjacent node, and then form equal-cost route or route stand-by, to avoid causing flow interrupt in the time that optimum route cannot reach.
Brief description of the drawings
Fig. 1 is a kind of typical IBGP networking schematic diagram;
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 diagram 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
Please refer to Fig. 1, a kind of typical IBGP (Internal BGP operates in the BGP in same AS) networking schematic diagram.For ensureing the connectedness between IBGP peer-to-peer (BGP speaker of switching and routing mutually), need between IBGP peer-to-peer, set up neighborhood.Suppose that there is N platform router an AS inside, the quantity of setting up so neighborhood is exactly N (N-1)/2.In the time that IBGP peer-to-peer quantity is a lot, all very large to the consumption of Internet resources and cpu resource.So, in IBGP networking, introduce RR (Route Reflector, Router Reflector).Other router is set up neighborhood as client computer (Client) with RR, gathers the routing iinformation that each client computer reports, and notices this routing iinformation to other client computer, and between client computer, do not need to set up neighborhood by RR.
But RR is subject to the constraint of bgp protocol, can only notice a route to client computer.Suppose, client computer 1 and client computer 2 have all reported and have arrived same object, the route that IP address is 1.1.1.1/32, and the route optimum that RR reports through relatively finding client computer 1, the advertising of route that so only client computer 1 can be reported is to client computer 3,4 and 5.Even if there are multiple RR, the optimum route of its selection is also often consistent.That is to say and in client computer 3,4 and 5, arrive above-mentioned same object, the path that arrives IP address 1.1.1.1/32 only has one, once this paths fault, need to first be perceived by RR, and then notice other routes to client computer 3,4 and 5, this process just may cause there is 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 described method is applied on the network equipment, such as, RR equipment.Please refer to Fig. 2, described method comprises the steps:
Step 201, sets up backup neighborhood with adjacent node.
Step 202, in the time that the same object of arrival has more than a route, notices non-optimum route to described backup neighbours, in the time that the same object of arrival only has a route, notices the described route only existing to described backup neighbours.
Here, described optimum route typically refers in many routes of the same object of arrival, the route of overhead value minimum, and described non-optimum route typically refers in many routes of the same object of arrival, other route beyond the route of overhead value minimum.In the present embodiment, described route can be BGP route.
Particularly, still taking the network environment shown in Fig. 1 as example.In current a kind of implementation method, RR equipment with set up neighborhood as client computer 1 to the client computer 5 of adjacent node.RR equipment, in the time that the same object of arrival has more than a route, is chosen optimum route and notices to described neighbours.Neighborhood herein, is called common neighborhood in the application.
In the present embodiment, design is set up backup neighborhood by RR equipment and adjacent node, RR equipment gathers the routing iinformation that each adjacent node reports, and in the time that the same object of arrival has more than a route, the non-optimum route of RR devices advertise is given described backup neighbours.Meanwhile, RR equipment also can be set up common neighborhood with adjacent node, and RR equipment gathers the routing iinformation that each adjacent node reports, and in the time that the same object of arrival has more than a route, the optimum route of RR devices advertise is given described common neighbours.This shows, for each adjacent node of RR equipment, in fact can set up two neighborhoods with RR equipment, i.e. a common neighborhood and a seniority in the family neighborhood.And then each adjacent node of RR equipment can receive two different routes that RR notices.Described adjacent node is according to two the different routes of the same object of arrival that receive, can form equal-cost route or active and standby route, so that in the time that optimum route cannot arrive, flow can be switched in time in described non-optimum route, avoid flow interrupt.
In fact, for RR, it does not need to perceive is to have set up two different neighborhoods with each adjacent node, only needs to distinguish common neighborhood and backup neighborhood.Then enable to back up the characteristic of neighborhood: in the time that the same object of arrival has more than a route, notice non-optimum route to described backup neighbours, in the time that the same object of arrival only has a route, notice the described route only existing to described backup neighbours.In the application's embodiment, described non-optimum route can be hypo-optimal route.
Further, in the time that the same object of arrival has more than a route, notice described non-optimum route to the backup neighbours that do not report described non-optimum route; In the time that the same object of arrival only has a route, notice the described route only existing to the backup neighbours that do not report described route only.Particularly, on RR equipment, can record the adjacent node that reports route, in the time that needs are noticed route to adjacent node, first judge whether described adjacent node is the equipment that reports route to be noticed, if so, no longer repeat to notice.
For instance, please refer to Fig. 3, RR and adjacent node client computer 1 to client computer 5 has been set up respectively common neighborhood and backup neighborhood.Suppose, client computer 1 and client computer 2 all reported arrive same object (such as: IP address is 1.1.1.1/32) route, be respectively route 1 and route 2, wherein route 1 is optimum route.So, RR can notice described route 1 to common neighbours, gives client computer 1 to client computer 5 by the common neighborhood link advertisement route 1 shown in solid line in Fig. 3.Meanwhile, RR can notice described route 2 to backup neighbours, gives client computer 1 to client computer 5 by backup neighborhood link advertisement route 2 shown in dotted lines in Figure 3.Like this, to client computer 5, will there be two different routes that arrive above-mentioned same object (IP address is 1.1.1.1/32): route 1 and route 2 in client computer 1.According to described route 1 and route 2, client computer 1 just can form the active and standby route that arrives above-mentioned purpose (IP address is 1.1.1.1/32) to client computer 5.Further, because client computer 1 has reported described optimum route 1, client computer 2 has reported described hypo-optimal route 2, therefore RR equipment gives client computer 2 to client computer 5 by route described in common neighborhood link advertisement 1, give client computer 1, client computer 3, client computer 4 and client computer 5 by route 2 described in backup neighborhood link advertisement.
Can be found out by above description, in the present embodiment, RR is on the basis of setting up common neighborhood, client computer adjacent with each set up backup neighborhood, in the time that the same object of arrival has more than a route, notice non-optimum route to backup neighbours, to make can both there be two different routes that arrive same object on each adjacent node, and then form equal-cost route or route stand-by, to avoid causing flow interrupt in the time that optimum route cannot reach.
Another embodiment of the present invention provides a kind of advertising of route device, and described application of installation is on the network equipment, such as, RR equipment.As the operation carrier of apparatus of the present invention, the hardware environment of the described network equipment at least includes CPU, internal memory and nonvolatile memory conventionally, certainly also may comprise the hardware such as various forwarding chips, I/O interface.Please refer to Fig. 4, be embodied as example with software, the CPU of the present embodiment by this equipment by non-volatile memories wherein corresponding computer program instructions read in internal memory and move, described advertising of route device is included: neighbours set up unit and advertising of route unit.In one embodiment of the invention:
Described neighbours set up unit, for setting up backup neighborhood with adjacent node;
Described advertising of route unit, in the time that the same object of arrival has more than a route, notices non-optimum route to described backup neighbours, in the time that the same object of arrival only has a route, notices the described route only existing to described backup neighbours.
Further, described advertising of route unit, specifically in the time that the same object of arrival has more than a route, notices described non-optimum route to the backup neighbours that do not report described non-optimum route; In the time that the same object of arrival only has a route, notice the described route only existing to the backup neighbours that do not report described route only.
Further, described non-optimum route is hypo-optimal route.
Further, described neighbours set up unit, for setting up common neighborhood with adjacent node; Described advertising of route unit, in the time that the same object of arrival has more than a route, notices optimum route to described common neighbours.
Further, described route is BGP route.
The foregoing is only preferred embodiment of the present invention, in order to limit the present invention, within the spirit and principles in the present invention not all, any amendment of making, be equal to replacement, improvement etc., within all should being included in the scope of protection of the invention.
Claims (10)
1. a route advertising method, is characterized in that, described method comprises:
Set up backup neighborhood with adjacent node;
In the time that the same object of arrival has more than a route, notice non-optimum route to described backup neighbours, in the time that the same object of arrival only has a route, notice the described route only existing to described backup neighbours.
2. method according to claim 1, it is characterized in that, it is described in the time that the same object of arrival has more than a route, notice non-optimum route to described backup neighbours, in the time that the same object of arrival only has a route, notice the described route only existing and comprise to described backup neighbours:
In the time that the same object of arrival has more than a route, notice described non-optimum route to the backup neighbours that do not report described non-optimum route;
In the time that the same object of arrival only has a route, notice the described route only existing to the backup neighbours that do not report described route only.
3. method according to claim 1 and 2, is characterized in that,
Described non-optimum route is hypo-optimal route.
4. method according to claim 1, is characterized in that, described method also comprises:
Set up common neighborhood with adjacent node;
In the time that the same object of arrival has more than a route, notice optimum route to described common neighbours.
5. method according to claim 1, is characterized in that,
Described route is Border Gateway Protocol (BGP) route.
6. an advertising of route device, is characterized in that, described device comprises:
Neighbours set up unit, for setting up backup neighborhood with adjacent node;
Advertising of route unit, in the time that the same object of arrival has more than a route, notices non-optimum route to described backup neighbours, in the time that the same object of arrival only has a route, notices the described route only existing to described backup neighbours.
7. device according to claim 6, is characterized in that,
Described advertising of route unit, specifically in the time that the same object of arrival has more than a route, notices described non-optimum route to the backup neighbours that do not report described non-optimum route; In the time that the same object of arrival only has a route, notice the described route only existing to the backup neighbours that do not report described route only.
8. device according to claim 6, is characterized in that,
Described non-optimum route is hypo-optimal route.
9. device according to claim 6, is characterized in that,
Described neighbours set up unit, are further used for setting up common neighborhood with adjacent node;
Described advertising of route unit, is further used for, in the time that the same object of arrival has more than a route, noticing optimum route to described common neighbours.
10. device according to claim 6, is characterized in that,
Described route is BGP route.
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 true CN103973558A (en) | 2014-08-06 |
| CN103973558B 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) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104301245A (en) * | 2014-10-22 | 2015-01-21 | 杭州华三通信技术有限公司 | Method and device for forwarding traffic in hybrid protocol network |
| CN106878175A (en) * | 2017-03-27 | 2017-06-20 | 新华三技术有限公司 | BGP route processing methods, device and BGP equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070214280A1 (en) * | 2006-03-09 | 2007-09-13 | Patel Keyur P | Backup BGP paths for non-multipath BGP fast convergence |
| 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 |
-
2014
- 2014-05-21 CN CN201410216809.8A patent/CN103973558B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070214280A1 (en) * | 2006-03-09 | 2007-09-13 | Patel Keyur P | Backup BGP paths for non-multipath BGP fast convergence |
| 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 |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104301245A (en) * | 2014-10-22 | 2015-01-21 | 杭州华三通信技术有限公司 | Method and device for forwarding traffic in hybrid protocol network |
| CN104301245B (en) * | 2014-10-22 | 2017-11-10 | 新华三技术有限公司 | Flow forwarding method and device in a kind of hybrid protocol networking |
| CN106878175A (en) * | 2017-03-27 | 2017-06-20 | 新华三技术有限公司 | BGP route processing methods, device and BGP equipment |
| CN106878175B (en) * | 2017-03-27 | 2020-03-06 | 新华三技术有限公司 | BGP route processing method and device and BGP equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103973558B (en) | 2017-09-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110166356B (en) | Method and network equipment for sending message | |
| EP3065342B1 (en) | Update of mac routes in evpn single-active topology | |
| EP3151485A1 (en) | Egress node protection in evpn all-active topology | |
| US10097372B2 (en) | Method for resource optimized network virtualization overlay transport in virtualized data center environments | |
| EP3148127A1 (en) | Egress protection for bum traffic with link failures in evpn | |
| US10461998B2 (en) | PE device and method for advertising information about PE device | |
| EP3122004A1 (en) | Traffic switching method, device, and system | |
| US10439880B2 (en) | Loop-free convergence in communication networks | |
| US8619785B2 (en) | Pre-computing alternate forwarding state in a routed ethernet mesh network | |
| WO2020135395A1 (en) | Notification method and device for prefix identifier of cross-interior gateway protocol | |
| CN110798403B (en) | Communication method, communication device and communication system | |
| CN105162704A (en) | Multicast replication method and device in Overlay network | |
| CN102780615B (en) | Link backup method and routing forwarding device | |
| CN103607317A (en) | Two-layer loop detection method, two-layer loop detection device and communication system | |
| CN114978978A (en) | Computing resource scheduling method and device, electronic equipment and medium | |
| WO2016095322A1 (en) | Vrrp-based data transmission method and apparatus | |
| WO2018219103A1 (en) | Method and device for determining link state | |
| WO2016123904A1 (en) | Routing convergence method, device and virtual private network system | |
| CN103595641A (en) | Device and method for synchronizing label distribution protocol and inner gateway protocol | |
| CN103973558A (en) | Route advertisement method and device | |
| CN103873339A (en) | Method and device for distributing virtual gateway router | |
| CN106878173B (en) | Route sending method and device | |
| CN113872843B (en) | Route generation method, route processing method and device | |
| CN105337863A (en) | Label assigning method and device | |
| WO2021098806A1 (en) | Message transmission path switching method, device and system |
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 |
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. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |