CN107888489B - Route notification method and device - Google Patents
Route notification method and device Download PDFInfo
- Publication number
- CN107888489B CN107888489B CN201711461723.1A CN201711461723A CN107888489B CN 107888489 B CN107888489 B CN 107888489B CN 201711461723 A CN201711461723 A CN 201711461723A CN 107888489 B CN107888489 B CN 107888489B
- Authority
- CN
- China
- Prior art keywords
- route
- issued
- router
- neighbor router
- routes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
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/24—Multipath
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The disclosure relates to a route notification method and a device. The method is applied to a router, and comprises the following steps: for any neighbor router, determining a route to be issued to the neighbor router; grouping the routes to be issued according to destination addresses; and for any packet, selecting a route matched with the route outlet strategy corresponding to the neighbor router from the packets and issuing the selected route to the neighbor router. According to the route notification method and the device, any one of a plurality of routes reaching the same destination address can be notified, more flexible route selection and network configuration are provided for a user, meanwhile, a plurality of routes reaching the same destination address can be notified to different neighbor routers, if one of the routes fails, the route can be quickly switched to other routes, the interruption of flow is avoided as much as possible, and the configuration of a non-optimal route can be realized to meet the actual flow forwarding requirement.
Description
Technical Field
The present disclosure relates to the field of network technologies, and in particular, to a method and an apparatus for route advertisement.
Background
BGP (Border Gateway Protocol) is a dynamic routing Protocol that can be used both between different ASs (Autonomous systems) and within the same AS. The currently used version of BGP is BGP-4, and BGP-4 is widely used by ISPs (Internet service providers) as a standard for Internet external routing protocols.
According to the BGP protocol, when a router receives multiple routes with the same destination address and mask, it can advertise only one route, e.g., the optimal route. If the optimal route fails, the flow cannot be quickly switched to other paths, and the flow is interrupted.
In addition, in current BGP protocol implementations, BGP routers can only match routing policies for optimal routes. This approach to the BGP protocol lacks flexibility in some networking environments. For example, in the networking shown in fig. 1, routers RT2, RT3, RT5, and RT6 respectively establish IBGP neighbor relations with RT4(RT4 is RR, english: Route Reflector, chinese: Route Reflector), router RT1, RT2, and RT3 establish EBGP neighbor relations, and RT7 establishes EBGP neighbor relations with RT5 and RT 6.
Assume at RT1 that it is desired that traffic go to RT7 via two paths as follows:
route 1: RT 1- > RT 2- > RT 5- > RT 7.
Route 2: RT 1- > RT 3- > RT 6- > RT 7.
In the existing case, the BGP protocol is of no way to implement, because after RT7 publishes a route to RT5 and RT6, RT5 and RT6 would publish the route to RT4, at RT4, whose optimal route is either from RT5 or RT6 (assuming the optimal route at RT4 is from RT 5). When RT4 reflects the route to RT2 and RT3, the routes learned at RT2 and RT3 both come from RT 5. The forwarding path of the traffic is as follows:
route 1: RT 1- > RT 2- > RT 5- > RT 7.
Route 2: RT 1- > RT 3- > RT 5- > RT 7.
Therefore, the existing technology cannot announce any one of a plurality of routes to the same destination address according to actual requirements, and a user cannot configure a non-optimal route to meet actual traffic forwarding requirements.
Disclosure of Invention
In view of this, the present disclosure provides a route advertisement method and apparatus, which can advertise any one of a plurality of routes reaching the same destination address, and provide more flexible path selection and network configuration for a user.
According to an aspect of the present disclosure, there is provided a route advertisement method, which is applied to a router, the method including:
for any neighbor router, determining a route to be issued to the neighbor router;
grouping the routes to be issued according to destination addresses;
and for any packet, selecting a route matched with the route outlet strategy corresponding to the neighbor router from the packets and issuing the selected route to the neighbor router.
According to another aspect of the present disclosure, there is provided a route advertisement apparatus, which is applied to a router, the apparatus including:
the system comprises a determining module, a sending module and a receiving module, wherein the determining module is used for determining a route to be issued to any neighbor router;
the grouping module is used for grouping the routes to be issued according to destination addresses;
and the matching module is used for selecting one route matched with the route outlet strategy corresponding to the neighbor router from any group and issuing the selected route to the neighbor router.
And selecting one route matched with the route outlet strategy corresponding to the neighbor router from the routes with the same destination address through the set route outlet strategy corresponding to the neighbor router, and issuing the selected route to the neighbor router.
According to the route notification method and the device, any one of a plurality of routes reaching the same destination address can be notified, more flexible route selection and network configuration are provided for a user, meanwhile, a plurality of routes reaching the same destination address can be notified to different neighbor routers, if one of the routes fails, the route can be quickly switched to other routes, the interruption of flow is avoided as much as possible, and the configuration of a non-optimal route can be realized to meet the actual flow forwarding requirement.
Other features and aspects of the present disclosure will become apparent from the following detailed description of exemplary embodiments, which proceeds with reference to the accompanying drawings.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate exemplary embodiments, features, and aspects of the disclosure and, together with the description, serve to explain the principles of the disclosure.
Fig. 1 illustrates an exemplary BGP networking diagram.
Fig. 2 shows a flow diagram of a route advertisement method according to an embodiment of the present disclosure.
Fig. 3 illustrates an application scenario diagram of a route advertisement method according to an example of the present disclosure.
Fig. 4 shows a flow diagram of a route advertisement method according to an embodiment of the present disclosure.
Fig. 5 shows a block diagram of a route advertisement device according to an embodiment of the present disclosure.
Fig. 6 shows a block diagram of a route advertisement device according to an embodiment of the present disclosure.
Fig. 7 shows a block diagram of a route advertisement device according to an embodiment of the present disclosure.
Detailed Description
Various exemplary embodiments, features and aspects of the present disclosure will be described in detail below with reference to the accompanying drawings. In the drawings, like reference numbers can indicate functionally identical or similar elements. While the various aspects of the embodiments are presented in drawings, the drawings are not necessarily drawn to scale unless specifically indicated.
The word "exemplary" is used exclusively herein to mean "serving as an example, embodiment, or illustration. Any embodiment described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other embodiments.
Furthermore, in the following detailed description, numerous specific details are set forth in order to provide a better understanding of the present disclosure. It will be understood by those skilled in the art that the present disclosure may be practiced without some of these specific details. In some instances, methods, means, elements and circuits that are well known to those skilled in the art have not been described in detail so as not to obscure the present disclosure.
In order to solve the above technical problem, the present disclosure provides a route advertisement method, and fig. 2 illustrates a flowchart of a route advertisement method according to an embodiment of the present disclosure, which may be applied to a router. As shown in fig. 2, the method includes:
step S11, for any neighbor router, determines a route to be issued to the neighbor router.
After learning a route from a neighbor router, the router issues the route to other neighbor routers. Fig. 3 is a schematic diagram illustrating an application scenario of a route advertisement method according to an example of the present disclosure, as shown in fig. 3, a router RT 'connects five neighbor routers RT 1', RT2 ', RT 3', RT4 ', RT 5', RT 'learns from router RT 1' to route 1, from router RT2 'to route 2, from router RT 3' to route 3, from router RT4 'to route 4, and from router RT 5' to route 5, where the destination addresses of route 1 and route 2 are the same (destination address 1, route 1 is superior to route 2), and the destination addresses of route 3, route 4 and route 5 are the same (destination address 2, route 3 is superior to route 4 is superior to route 5); then for learned route 1 RT 'is to publish the route to neighbor routers RT 2', RT3 ', RT 4', RT5 ', for learned route 2 RT' is to publish the route … … to neighbor routers RT1 ', RT 3', RT4 ', RT 5', and likewise for each learned route it may be published to neighbor routers other than the neighbor router that sent it.
Therefore, for the neighbor router RT1 ', the routes to be issued to the neighbor router RT 1' may be determined as route 2, route 3, route 4, route 5; for the neighbor router RT3 ', the route to be issued to the neighbor router RT3 ' can be determined as route 1, route 2, route 4, route 5, and similarly for any neighbor router of RT ', the route to be issued to the neighbor router can be determined according to the learned route.
And step S12, grouping the routes to be issued according to destination addresses.
As described above, there may be routes with the same destination address in the routes to be issued, for example, in the routes 2, 3, 4, and 5 to be issued to the neighbor router RT 1', the destination addresses of the route 3, 4, and 5 are the same, the destination address of the route 2 is different from the routes 3, 4, and 5, and the routes to be issued may be divided into two groups according to the destination addresses, the first group being the route 2, and the second group being the route 3, 4, and 5; in the routes 1, 2, 4 and 5 to be issued to the neighbor router RT 3', the destination addresses of the route 1 and the route 2 are the same, and the destination addresses of the route 4 and the route 5 are the same, and the routes to be issued can be divided into two groups according to the destination addresses, the first group is the route 1 and the route 2, and the second group is the route 4 and the route 5.
And step S13, for any packet, selecting a route matched with the route exit strategy corresponding to the neighbor router and issuing the selected route to the neighbor router.
The route egress policy refers to a route publishing policy preset for a neighboring router, and the route egress policy may include attribute information of the route, such as source information, destination address, next hop, and the like of the route. One or more route exit policies may be preset for one neighbor router, that is, the route exit policy corresponding to one neighbor router may include attribute information of one or more routes, and each route attribute information includes source information, destination address, next hop, and the like of the route.
The source information of the route is information of a neighbor router that issues the route to the router, for example, identification information of the neighbor router.
In a possible implementation manner, if the attribute information of the route to be issued is the same as the attribute information of the route included in the route exit policy, the route to be issued is matched with the route exit policy.
In one example, the route egress policy includes source information and a destination address of the route, that is, a route that is issued to a neighboring router and that is the same as the source information and the destination address of the route included in the route egress policy corresponding to the neighboring router.
For example, for a route to be issued to the neighbor router RT1 ', the first group is route 2, if the route source information (router RT 2') and the destination address 1 of the route 2 are the same as the route source information (router RT2 ') and the destination address included in the route exit policy corresponding to the neighbor router RT 1', the route 2 is issued to the neighbor router RT1 ', and if they are different, the route 2 is not issued to the neighbor router RT 1'. The second group is route 3, route 4 and route 5, and it is assumed that the route egress policy corresponding to the neighbor router RT 1' includes: if the source information of the route is the neighbor router RT4 'and the destination address is the destination address 2, then the route 4 is selected from the second group and sent to the neighbor router RT 1'.
For another example, for the routes to be issued to the neighbor router RT3 ', the first group is route 1 and route 2, and it is assumed that the route egress policy corresponding to the neighbor router RT 3' includes: if the source information of the route is the neighbor router RT1 'and the destination address is the destination address 1, selecting the route 1 from the first group and sending the route 1 to the neighbor router RT 3'; the second group is route 4 and route 5, and it is assumed that the route egress policy corresponding to the neighbor router RT 3' includes: if the source information of the route is the neighbor router RT5 'and the destination address is the destination address 2, then the route 5 is selected from the second group and sent to the neighbor router RT 3'.
Therefore, according to the route notification method disclosed by the invention, any one of a plurality of routes reaching the same destination address can be notified through the set route exit strategy corresponding to the neighbor router, and the configuration of the non-optimal route can be realized so as to meet the actual flow forwarding requirement.
For multiple routes with the same destination address (for example, route 3, route 4 and route 5), multiple routes reaching the same destination address can be advertised for different neighbor routers (for example, route 4 is sent to neighbor router RT1 ', route 5 is sent to neighbor router RT 3'), if one of the routes fails, the route can be quickly switched to other paths, interruption of traffic is avoided as much as possible, and configuration of a non-optimal route can be realized to meet actual traffic forwarding requirements.
For the example shown in fig. 1, applying the method shown in fig. 2 to the RR in fig. 1, the RR may receive two routes with the same destination address (assumed as destination address 3) from RT5 and RT6, and assume that the route exit policy preset on the RR for the neighbor router RT3 includes: the source information of the route is the neighbor router RT6, the destination address is the destination address 3, then, after learning two routes with the destination address of the destination address 3 from the RT5 and the RT6, the RR can select the route from the RT6 to issue to the neighbor router RT 3.
Assume that the route egress policy preset on the RR for the neighbor router RT2 includes: the source information of the route is the neighbor router RT5, the destination address is the destination address 3, then, after learning two routes with the destination address of the destination address 3 from the RT5 and the RT6, the RR can select the route from the RT5 to issue to the neighbor router RT 2.
Thus, RT2 learns the route from RT5 and RT3 learns the route from RT6, i.e., two paths as described above can be obtained.
Route 1: RT 1- > RT 2- > RT 5- > RT 7.
Route 2: RT 1- > RT 3- > RT 6- > RT 7.
And selecting one route matched with the route outlet strategy corresponding to the neighbor router from the routes with the same destination address through the set route outlet strategy corresponding to the neighbor router, and issuing the selected route to the neighbor router. According to the route notification method disclosed by the invention, any one of a plurality of routes reaching the same destination address can be notified, so that more flexible path selection and network configuration are provided for a user; meanwhile, multiple routes reaching the same destination address can be announced by aiming at different neighbor routers, if one route fails, the route can be quickly switched to other paths, the interruption of flow is avoided as much as possible, and the configuration of a non-optimal route can be realized to meet the actual flow forwarding requirement.
Fig. 4 shows a flow diagram of a route advertisement method according to an embodiment of the present disclosure. As shown in fig. 4, step S13, for any of the packets, selecting one of the routes matching the route egress policy corresponding to the neighboring router to be issued to the neighboring router, may include:
step S131, the routes to be issued in the packet are subjected to priority sequencing.
For a plurality of routes with the same destination address, the grouped routes to be issued may be sorted according to the route priority, for example, still taking fig. 3 as an example to explain, for the routes to be issued to the neighbor router RT 1', the first group is route 2, no sorting is required, the second group is route 3, route 4 and route 5, route 3 is superior to route 4 and superior to route 5, and then sorting may be performed according to the priority from high to low, or sorting may be performed according to the priority from low to high, which is not limited in the present disclosure; for the routes to be issued to the neighbor router RT 3', the first group is route 1 and route 2, route 1 is superior to route 2, the second group is route 4 and route 5, and route 4 is superior to route 5.
Step S132, the route to be issued with the highest priority is selected to be matched with the route outlet strategy corresponding to the neighbor router.
Step S133, if the matching is successful, the packet is issued to the neighboring router, and the matching of the route exit policy corresponding to the neighboring router is terminated for the packet.
Step S134, if the matching fails, selecting the route to be issued with the highest priority from the remaining routes to be issued in the group to match with the route exit strategy corresponding to the neighbor router.
As above, for the route to be issued to the neighbor router RT1 ', for the first group of routes, the route 2 may be directly matched with the route exit policy corresponding to the neighbor router RT 1', if the matching is successful, the route is issued to the neighbor router RT1 ', and the matching of the route exit policy corresponding to the neighbor router RT 1' is terminated, if the matching is failed, the operation is ended; for the second set of routes, route 3 may be selected to match the route exit policy corresponding to neighbor router RT1 ', since the route exit policy corresponding to neighbor router RT 1' includes: the source information of the route is the neighbor router RT 4' and the destination address is the destination address 2, so the matching fails; and then selecting the route to be issued (route 4) with the highest priority from the rest routes to be issued (route 4 and route 5) in the second group to be matched with the route exit strategy corresponding to the neighbor router, if the matching is successful, issuing the route to the neighbor router RT1 ', and terminating the matching of the route of the second group and the route exit strategy corresponding to the RT 1'.
For the routes to be issued to the neighbor router RT3 ', the first group is route 1 and route 2, route 1 is better than route 2, because the route exit policy corresponding to the neighbor router RT 3' includes: the source information of the route is neighbor router RT1 ' and the destination address is destination address 1, therefore, if the matching is successful, the source information is issued to neighbor router RT3 ', and the matching of the first group of routes and the route exit strategy corresponding to RT3 ' is terminated; the second group is route 4 and route 5, route 4 is better than route 5, since the route exit policy corresponding to the neighbor router RT 3' includes: the source information of the route is the neighbor router RT5 ' and the destination address is the destination address 2, therefore, the matching fails, then the route to be issued (route 5) with the highest priority is selected from the rest routes to be issued (route 5) in the second group to be matched with the route exit strategy corresponding to the neighbor router, if the matching is successful, the route is issued to the neighbor router RT3 ', and the matching of the route exit strategy corresponding to the RT3 ' of the second group is terminated.
According to the route notification method disclosed by the invention, when a plurality of routes with the same destination address exist, the router not only sends the optimal path, but also can flexibly determine the path sent by the BGP neighbor according to the configured route exit strategy.
Fig. 5 shows a block diagram of a route advertisement device, which may be applied to a router, according to an embodiment of the present disclosure. As shown in fig. 5, the apparatus may include:
a determining module 51, configured to determine, for any neighbor router, a route to be issued to the neighbor router;
the grouping module 52 is configured to group the routes to be issued according to destination addresses;
and a matching module 53, configured to select, for any of the packets, one route that matches the route egress policy corresponding to the neighboring router and issue the selected route to the neighboring router.
And selecting one route matched with the route outlet strategy corresponding to the neighbor router from the routes with the same destination address through the set route processing strategy corresponding to the neighbor router, and issuing the selected route to the neighbor router. According to the route notification device disclosed by the invention, any one of a plurality of routes reaching the same destination address can be notified, more flexible route selection and network configuration are provided for a user, meanwhile, a plurality of routes reaching the same destination address can be notified to different neighbor routers, if one of the routes fails, the route can be quickly switched to other routes, the interruption of flow is avoided as much as possible, and the configuration of a non-optimal route can be realized so as to meet the actual flow forwarding requirement.
In one possible implementation, the route egress policy includes attribute information of a route; the attribute information of the route comprises one or more items of source information, destination address and next hop of the route; the source information of the route is the information of a neighbor router which issues the route to the router;
the selecting the route matched with the route exit strategy corresponding to the neighbor router comprises the following steps:
and if the attribute information of the route to be issued is the same as the attribute information of the route included in the route exit strategy, matching the route to be issued with the route exit strategy.
Fig. 6 shows a block diagram of a route advertisement device according to an embodiment of the present disclosure. As shown in figure 6 of the drawings,
in one possible implementation, the matching module includes:
a sorting unit 531, configured to perform priority sorting on routes to be issued in a packet;
a matching unit 532, configured to select a route to be issued with the highest priority to match with a route exit policy corresponding to the neighboring router;
the issuing unit 533 is configured to issue the packet to the neighboring router if the matching is successful, and terminate the matching of the route egress policy corresponding to the neighboring router for the packet.
In a possible implementation manner, the matching unit 532 is further configured to select, if the matching fails, a route to be issued with the highest priority from the routes to be issued remaining in the packet, and match the route to be issued with the route egress policy corresponding to the neighboring router.
Fig. 7 is a block diagram illustrating an apparatus 900 for route advertisement according to an example embodiment. Referring to fig. 7, the apparatus 900 may include a processor 901, a machine-readable storage medium 902 having stored thereon machine-executable instructions. The processor 901 and the machine-readable storage medium 902 may communicate via a system bus 903. Also, the processor 901 performs the route advertisement method described above by reading machine executable instructions in the machine readable storage medium 902 corresponding to the route advertisement logic.
The machine-readable storage medium 902 referred to herein may be any electronic, magnetic, optical, or other physical storage device that can contain or store information such as executable instructions, data, and the like. For example, the machine-readable storage medium may be: a RAM (random Access Memory), a volatile Memory, a non-volatile Memory, a flash Memory, a storage drive (e.g., a hard drive), a solid state drive, any type of storage disk (e.g., an optical disk, a dvd, etc.), or similar storage medium, or a combination thereof.
Having described embodiments of the present disclosure, the foregoing description is intended to be exemplary, not exhaustive, and not limited to the disclosed embodiments. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terms used herein were chosen in order to best explain the principles of the embodiments, the practical application, or technical improvements to the techniques in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.
Claims (8)
1. A method for route advertisement, the method being applied to a router, the method comprising:
for any neighbor router, determining a route to be issued to the neighbor router;
grouping the routes to be issued according to destination addresses;
for any packet, selecting a route matched with the route outlet strategy corresponding to the neighbor router from the packets and issuing the selected route to the neighbor router;
multiple routes to the same destination address are advertised for different neighboring routers, for multiple routes with the same destination address.
2. The route advertisement method of claim 1,
the route exit policy comprises attribute information of a route; the attribute information of the route comprises one or more items of source information, destination address and next hop of the route; the source information of the route is the information of a neighbor router which issues the route to the router;
the selecting the route matched with the preset route exit strategy corresponding to the neighbor router comprises the following steps:
and if the attribute information of the route to be issued is the same as the attribute information of the route included in the preset route exit strategy, matching the route to be issued with the preset route exit strategy.
3. The route advertisement method according to claim 2, wherein for any of the packets, selecting one of the routes matching the preset route egress policy corresponding to the neighboring router to be issued to the neighboring router comprises:
carrying out priority sequencing on the routes to be issued in the packets;
selecting a route to be issued with the highest priority to be matched with a route outlet strategy corresponding to the neighbor router;
if the matching is successful, the packet is issued to the neighbor router, and the matching of the routing outlet strategy corresponding to the neighbor router is terminated aiming at the packet.
4. The route advertisement method of claim 3, further comprising:
and if the matching fails, selecting the route to be issued with the highest priority from the rest routes to be issued in the group to be matched with the route outlet strategy corresponding to the neighbor router.
5. A route advertisement device, applied to a router, the device comprising:
the system comprises a determining module, a sending module and a receiving module, wherein the determining module is used for determining a route to be issued to any neighbor router;
the grouping module is used for grouping the routes to be issued according to destination addresses;
the matching module is used for selecting one route matched with the route outlet strategy corresponding to the neighbor router from any group and issuing the selected route to the neighbor router;
the matching module is also used for advertising a plurality of routes reaching the same destination address aiming at a plurality of routes with the same destination address and aiming at different neighbor routers.
6. The route advertisement device of claim 5,
the route exit policy comprises attribute information of a route; the attribute information of the route comprises one or more items of source information, destination address and next hop of the route; the source information of the route is the information of a neighbor router which issues the route to the router;
the selecting the route matched with the route exit strategy corresponding to the neighbor router comprises the following steps:
and if the attribute information of the route to be issued is the same as the attribute information of the route included in the route exit strategy, matching the route to be issued with the route exit strategy.
7. The route advertisement device of claim 6, wherein the matching module comprises:
the sorting unit is used for carrying out priority sorting on the routes to be issued in the packets;
the matching unit is used for selecting the route to be issued with the highest priority to be matched with the route outlet strategy corresponding to the neighbor router;
and the issuing unit is used for issuing the packet to the neighbor router if the matching is successful, and terminating the matching of the routing outlet strategy corresponding to the neighbor router aiming at the packet.
8. The route advertisement device of claim 7,
and the matching unit is also used for selecting the route to be issued with the highest priority from the rest routes to be issued in the group to match with the route outlet strategy corresponding to the neighbor router if the matching fails.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711461723.1A CN107888489B (en) | 2017-12-28 | 2017-12-28 | Route notification method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711461723.1A CN107888489B (en) | 2017-12-28 | 2017-12-28 | Route notification method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107888489A CN107888489A (en) | 2018-04-06 |
| CN107888489B true CN107888489B (en) | 2020-08-11 |
Family
ID=61770622
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711461723.1A Active CN107888489B (en) | 2017-12-28 | 2017-12-28 | Route notification method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107888489B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114143807B (en) * | 2021-10-27 | 2023-08-08 | 中盈优创资讯科技有限公司 | Route registration integrity rate evaluation method and device |
| CN114124780B (en) * | 2021-11-15 | 2023-07-21 | 迈普通信技术股份有限公司 | Route issuing method, device, electronic equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101141382A (en) * | 2006-09-07 | 2008-03-12 | 华为技术有限公司 | Routing update method and router |
| CN101741705A (en) * | 2008-11-27 | 2010-06-16 | 华为技术有限公司 | Method and device for parallel processing of routing update messages |
| EP2416531A1 (en) * | 2010-08-04 | 2012-02-08 | Deutsche Telekom AG | IPv6 Prefix announcement for routing-based Gateways in shared environments |
| WO2016073818A1 (en) * | 2014-11-07 | 2016-05-12 | Cisco Technology, Inc. | Phased network formation for power restoration |
| CN106888151A (en) * | 2015-12-16 | 2017-06-23 | 阿里巴巴集团控股有限公司 | Message treatment method and system |
| CN106936714A (en) * | 2015-12-31 | 2017-07-07 | 华为技术有限公司 | The processing method and PE equipment and system of a kind of VPN |
-
2017
- 2017-12-28 CN CN201711461723.1A patent/CN107888489B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101141382A (en) * | 2006-09-07 | 2008-03-12 | 华为技术有限公司 | Routing update method and router |
| CN101741705A (en) * | 2008-11-27 | 2010-06-16 | 华为技术有限公司 | Method and device for parallel processing of routing update messages |
| EP2416531A1 (en) * | 2010-08-04 | 2012-02-08 | Deutsche Telekom AG | IPv6 Prefix announcement for routing-based Gateways in shared environments |
| WO2016073818A1 (en) * | 2014-11-07 | 2016-05-12 | Cisco Technology, Inc. | Phased network formation for power restoration |
| CN106888151A (en) * | 2015-12-16 | 2017-06-23 | 阿里巴巴集团控股有限公司 | Message treatment method and system |
| CN106936714A (en) * | 2015-12-31 | 2017-07-07 | 华为技术有限公司 | The processing method and PE equipment and system of a kind of VPN |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107888489A (en) | 2018-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11784889B2 (en) | Segment routing over label distribution protocol | |
| US9565160B2 (en) | Advertisement of adjacency segment identifiers | |
| US9559954B2 (en) | Indexed segment ID | |
| EP2997699B1 (en) | Segment routing mapping server for ldp/sr interoperability | |
| CN101120552B (en) | Loop prevention method for MPLS using service labels and network node | |
| US9094335B2 (en) | Packet switching label assignment across multiple packet switching forwarding groups | |
| CN108259341B (en) | Prefix label distribution method and SDN controller | |
| CN107968752B (en) | SID acquisition method and device | |
| AU2007225380B2 (en) | Connecting multi-hop mesh networks using MAC Bridge | |
| EP3343846B1 (en) | Method, device and system for processing packet | |
| CN109218197B (en) | Conflict resolution method in segmented routing and router | |
| EP2187581A1 (en) | Summarization and longest-prefix match within mpls networks | |
| JP2001189751A (en) | System, element and method for supporting virtual private network of label exchange communication network | |
| CN112868214B (en) | Coordinated load transfer OAM records within packets | |
| US9088498B2 (en) | Communication networks that provide a common transport domain for use by multiple service domains and methods and computer program products for using the same | |
| US20180343193A1 (en) | Method and apparatus for minimum label bandwidth guaranteed path for segment routing | |
| CN107888489B (en) | Route notification method and device | |
| JP5913741B2 (en) | Method and computer program product for routing data units | |
| US8078758B1 (en) | Automatic configuration of source address filters within a network device | |
| WO2021175309A1 (en) | Method and device for routing transmission | |
| CN108011821B (en) | Method and device for distributing neighbor labels |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |