CN107888489A - Route advertising method and device - Google Patents

Route advertising method and device Download PDF

Info

Publication number
CN107888489A
CN107888489A CN201711461723.1A CN201711461723A CN107888489A CN 107888489 A CN107888489 A CN 107888489A CN 201711461723 A CN201711461723 A CN 201711461723A CN 107888489 A CN107888489 A CN 107888489A
Authority
CN
China
Prior art keywords
route
neighbor router
released
router
egress policy
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
Application number
CN201711461723.1A
Other languages
Chinese (zh)
Other versions
CN107888489B (en
Inventor
余清炎
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
New H3C Technologies Co Ltd
Original Assignee
New H3C Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by New H3C Technologies Co Ltd filed Critical New H3C Technologies Co Ltd
Priority to CN201711461723.1A priority Critical patent/CN107888489B/en
Publication of CN107888489A publication Critical patent/CN107888489A/en
Application granted granted Critical
Publication of CN107888489B publication Critical patent/CN107888489B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/24Multipath
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08Configuration management of networks or network elements
    • H04L41/0803Configuration setting
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/28Routing 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

This disclosure relates to a kind of route advertising method and device.Methods described is applied to router, and methods described includes:For any neighbor router, it is determined that to neighbor router route to be released;The route to be released is grouped according to destination address;For any packet, a route of route egress policy matching corresponding with the neighbor router is therefrom selected to be distributed to the neighbor router.Any one in a plurality of route that can will reach same destination address according to the route advertising method of the disclosure and device is noticed away, more flexible Path selection and network configuration are provided the user, simultaneously, the a plurality of route being communicated to for different neighbor routers up to same destination address can be realized, an if wherein route break, it can be quickly switched on other paths, avoid causing the interruption of flow as far as possible, can also realize and non-optimal route be configured to meet that actual flow forwards demand.

Description

Route advertising method and device
Technical field
This disclosure relates to network technique field, more particularly to a kind of route advertising method and device.
Background technology
BGP (Border Gateway Protocol, Border Gateway Protocol) is that one kind both can be used for different AS Between (Autonomous System, autonomous system), the dynamic routing protocol that can be used for again inside same AS.It is currently used Bgp version be BGP-4, BGP-4 is as Internet exterior routing protocol standards, by ISP (Internet Service Provider, ISP) extensive use.
Provided according to bgp protocol, when router receives a plurality of route of destination address and mask all same, Zhi Nengtong A route is accused, for example, noticing optimal route.If optimal route break, flow can not be quickly switched on other paths, made Into the interruption of flow.
In addition, in current bgp protocol is realized, bgp router is merely able to send plan for optimal matched routings route Slightly.This processing mode of bgp protocol has lacked flexibility under some network environments.For example, networking as shown in Figure 1 In, router RT2, RT3, RT5, RT6 respectively with RT4 (RT4 RR, English:Route Reflector, Chinese:Route reflection Device) IBGP neighborhoods are established, ebgp neighbor relation is established between router RT1 and RT2, RT3, RT7 establishes with RT5, RT6 Ebgp neighbor relation.
Assuming that on RT1, it is desirable to which flow goes to RT7 by following two paths, and this two paths is as follows:
Path 1:RT1—>RT2—>RT5—>RT7.
Path 2:RT1—>RT3—>RT6—>RT7.
In the case of existing, bgp protocol have no idea realize because RT7 by route be distributed to RT5 and RT6 it Afterwards, the route can be distributed to RT4 by RT5 and RT6, and on RT4, its optimal route either comes from RT5 or come from RT6 (assuming that route optimal on RT4 comes from RT5).When RT4 by route reflection to RT2 and RT3 when, acquire on RT2 and RT3 Route both from RT5.The forward-path of its flow is:
Path 1:RT1—>RT2—>RT5—>RT7.
Path 2:RT1—>RT3—>RT5—>RT7.
Therefore, existing technology can not be communicated to according to the demand of reality up to appointing in a plurality of route of same destination address One route of meaning, user can not be configured to non-optimal route to meet that actual flow forwards demand.
The content of the invention
In view of this, the present disclosure proposes a kind of route advertising method and device, same destination address will can be reached Any one in a plurality of route is noticed away, can provide the user more flexible Path selection and network configuration.
According to the one side of the disclosure, there is provided a kind of route advertising method, methods described are applied to router, the side Method includes:
For any neighbor router, it is determined that to neighbor router route to be released;
The route to be released is grouped according to destination address;
For any packet, the Yi Tiaolu for therefrom selecting route egress policy corresponding with the neighbor router to match By being distributed to the neighbor router.
According to another aspect of the present disclosure, there is provided a kind of advertising of route device, described device is applied to router, described Device includes:
Determining module, for for any neighbor router, it is determined that to neighbor router route to be released;
Grouping module, for the route to be released to be grouped according to destination address;
Matching module, for for any packet, therefrom selecting route outlet corresponding with neighbor router plan The route slightly matched is distributed to the neighbor router.
Egress policy is route by the way that setting is corresponding with neighbor router, is route for destination address identical, therefrom One route of selection route egress policy matching corresponding with neighbor router is distributed to the neighbor router.
Can be by appointing in a plurality of route for reaching same destination address according to the route advertising method of the disclosure and device Meaning one is noticed away, has provided the user more flexible Path selection and network configuration, simultaneously, it is possible to achieve for difference Neighbor router be communicated to a plurality of route up to same destination address, if a wherein route break, can be switched fast Onto other paths, avoid causing the interruption of flow as far as possible, can also realize and non-optimal route is configured to meet reality Flow forwarding demand.
According to below with reference to the accompanying drawings becoming to detailed description of illustrative embodiments, the further feature and aspect of the disclosure It is clear.
Brief description of the drawings
Comprising in the description and the accompanying drawing of a part for constitution instruction and specification together illustrate the disclosure Exemplary embodiment, feature and aspect, and for explaining the principle of the disclosure.
Fig. 1 shows the BGP networking schematic diagrams of an example.
Fig. 2 shows the flow chart of the route advertising method according to the embodiment of the disclosure one.
Fig. 3 shows the application scenarios schematic diagram of the route advertising method according to the example of the disclosure one.
Fig. 4 shows the flow chart of the route advertising method according to the embodiment of the disclosure one.
Fig. 5 shows the block diagram of the advertising of route device according to the embodiment of the disclosure one.
Fig. 6 shows the block diagram of the advertising of route device according to the embodiment of the disclosure one.
Fig. 7 shows the block diagram of the advertising of route device according to the embodiment of the disclosure one.
Embodiment
Describe various exemplary embodiments, feature and the aspect of the disclosure in detail below with reference to accompanying drawing.It is identical in accompanying drawing Reference represent the same or analogous element of function.Although the various aspects of embodiment are shown in the drawings, remove Non-specifically point out, it is not necessary to accompanying drawing drawn to scale.
Special word " exemplary " is meant " being used as example, embodiment or illustrative " herein.Here as " exemplary " Illustrated any embodiment should not necessarily be construed as preferred or advantageous over other embodiments.
In addition, in order to better illustrate the disclosure, numerous details is given in embodiment below. It will be appreciated by those skilled in the art that without some details, the disclosure can equally be implemented.In some instances, for Method, means, element and circuit well known to those skilled in the art are not described in detail, in order to highlight the purport of the disclosure.
In order to solve the above technical problems, present disclose provides a kind of route advertising method, Fig. 2 is shown according to the disclosure one The flow chart of the route advertising method of embodiment, this method can apply to router.As shown in Fig. 2 this method includes:
Step S11, for any neighbor router, it is determined that to neighbor router route to be released.
Router will issue the route after from neighbor router study to route to other neighbor routers.Fig. 3 is shown According to the application scenarios schematic diagram of the route advertising method of the example of the disclosure one, as shown in figure 3, five neighbours of router RT ' connections Router RT1 ', RT2 ', RT3 ', RT4 ', RT5 ' are occupied, RT ' learns to learn to route 1, from router RT2 ' from router RT1 ' Learn to route 2, from router RT3 ' study to route 3, from router RT4 ' to route 4, from router RT5 ' study to road By 5, wherein, route 1 is identical with the destination address of route 2, and (2) destination address 1, route 1 are better than route, route 3, route 4 and road Destination address by 5 is identical, and (destination address 2, route 3 is better than route 4 better than route 5);So, for the route 1 learnt, RT ' will issue the route to neighbor router RT2 ', RT3 ', RT4 ', RT5 ', will be to neighbours for the route 2, RT ' learnt Router RT1 ', RT3 ', RT4 ', RT5 ' issue the route ..., likewise, for the route that each learns, Ke Yixiang Neighbor router in addition to the neighbor router for sending the route issues the route.
Therefore, for neighbor router RT1 ', it may be determined that the route to be released to neighbor router RT1 ' for route 2, Route 3, route 4, route 5;For neighbor router RT3 ', it may be determined that the route to be released to neighbor router RT3 ' is road By 1, route 2, route 4, route 5, same any neighbor router for RT ' can be true according to the route learnt Orient neighbor router route to be released.
Step S12, the route to be released is grouped according to destination address.
As described above, destination address identical route is there may be in the route to be released, for example, being route to neighbours In route 2 to be released device RT1 ', route 3, route 4, route 5, route 3, route 4 are identical with the destination address of route 5, route 2 destination address and route 3, route 4 and route are 5 different, and route to be released can be divided into two groups according to destination address, the One group is route 2, and second group is route 3, route 4 and route 5;To route 1 to be released neighbor router RT3 ', route 2, road By in 4, route 5, route 1 is identical with the destination address of route 2, route 4 is identical with the destination address of route 5, according to destination Route to be released can be divided into two groups by location, and first group is route 1 and route 2, and second group is route 4 and route 5.
Step S13, for any packet, therefrom select route egress policy matching corresponding with the neighbor router A route be distributed to the neighbor router.
Wherein, route egress policy refers to the route publishing policy pre-set for neighbor router, route outlet plan The attribute information of route, such as the source-information of route, destination address, next-hop etc. can slightly be included.For a neighbours road One or more route egress policys can be pre-set by device, that is to say, that route outlet plan corresponding to a neighbor router In slightly can include one or more route attribute information, each routing property information include route source-information, Destination address, next-hop etc..
Wherein, the source-information of route is the information for the neighbor router that route is issued to this router, for example, neighbours road By the identification information of device.
In a kind of possible implementation, if the attribute information of route to be released includes with route egress policy The route attribute information it is all identical, then this it is to be released route with route egress policy match.
In one example, routeing egress policy includes the source-information and destination address of route, that is to say, that to neighbours The source-information and destination address phase for the route that router issue route egress policy corresponding with the neighbor router includes Same route.
Such as route to be released neighbor router RT1 ', first group is route 2, if the route of route 2 is come The route that source information (router RT2 ') and the route egress policy corresponding with neighbor router RT1 ' of destination address 1 include is come Source information (router RT2 ') is identical with destination address, then to neighbor router RT1 ' issues route 2, if it is different, then not to neighbour Occupy router RT1 ' issues route 2.Second group is route 3, route 4 and route 5, it is assumed that route corresponding to neighbor router RT1 ' Egress policy includes:The source-information of route is neighbor router RT4 ', destination address is purpose address 2, then from second group Middle selection route 4 is sent to neighbor router RT1 '.
Say for another example, for route to be released neighbor router RT3 ', first group is route 1 and route 2, it is assumed that adjacent Occupying route egress policy corresponding to router RT3 ' includes:The source-information of route is neighbor router RT1 ', destination address is Destination address 1, then selection route 1 is sent to neighbor router RT3 ' from first group;Second group is route 4 and route 5, vacation If route egress policy includes corresponding to neighbor router RT3 ':The source-information of route is neighbor router RT5 ', destination Location is purpose address 2, then selection route 5 is sent to neighbor router RT3 ' from second group.
Therefore, according to the route advertising method of the disclosure, setting route outlet plan corresponding with neighbor router is passed through Any one in a plurality of route that slightly can will reach same destination address is noticed away, it is possible to achieve to it is non-optimal route into Row is configured to meet that actual flow forwards demand.
For a plurality of route of destination address identical (for example, route 3, route 4 and route 5), different neighbours can be directed to Occupy router advertisement and reach a plurality of route of same destination address (for example, sending route 4, to neighbours to neighbor router RT1 ' 5) router RT3 ' sends route, if a wherein route break, can be quickly switched on other paths, avoid making as far as possible Into the interruption of flow, it can also realize and non-optimal route be configured to meet that actual flow forwards demand.
For Fig. 1 example showns, the method shown in Fig. 2 is applied to the RR in Fig. 1, RR can be received from RT5 and RT6 The route of destination address (being assumed to be destination address 3) identical two, it is assumed that pre-set on RR for neighbor router RT3 Route egress policy includes:The source-information of route is neighbor router RT6, destination address is purpose address 3, then, RR exists Learn to after two routes that from RT5 and RT6, destination address is purpose address 3, the route from RT6 can be selected to send out Cloth gives neighbor router RT3.
Assuming that include on RR for the route egress policy that neighbor router RT2 is pre-set:The source-information of route is Neighbor router RT5, destination address are purpose address 3, then, RR is mesh in study to from RT5 and RT6, destination address Two of address 3 routes after, the route from RT5 can be selected to be distributed to neighbor router RT2.
So, RT2 study learns to the route for coming from RT6 to the route for coming from RT5, RT3, you can to obtain as above Two described paths.
Path 1:RT1—>RT2—>RT5—>RT7.
Path 2:RT1—>RT3—>RT6—>RT7.
Egress policy is route by the way that setting is corresponding with neighbor router, is route for destination address identical, therefrom One route of selection route egress policy matching corresponding with neighbor router is distributed to the neighbor router.According to the disclosure Route advertising method can will reach same destination address a plurality of route in any one notice away, provide the user More flexible Path selection and network configuration;Simultaneously, it is possible to achieve be communicated to for different neighbor routers up to same The a plurality of route of destination address, if a wherein route break, can be quickly switched on other paths, avoid causing as far as possible The interruption of flow, it can also realize and non-optimal route be configured to meet that actual flow forwards demand.
Fig. 4 shows the flow chart of the route advertising method according to the embodiment of the disclosure one.As shown in figure 4, step S13, right In any packet, a route of route egress policy matching corresponding with the neighbor router is therefrom selected to be distributed to this Neighbor router, it can include:
Step S131, the route to be released in packet is subjected to priority ranking.
For a plurality of route of destination address identical, according to routing priority can to it is grouped it is to be released route into Row sequence, for example, still illustrated by taking Fig. 3 as an example, for route to be released neighbor router RT1 ', the first Zu Wei roads By 2, it is not necessary to be ranked up, second group, to route 3, routeing 4 and route 5, route 3 better than routeing 4 and be better than route 5, then can To be ranked up from high to low according to priority, can also be ranked up from low to high according to priority, the disclosure is not done to this Limit;For to route to be released neighbor router RT3 ', first group is route 1 and route 2, and route 1 is better than route 2, the Two groups are route 4 and route 5, and route 4 is better than route 5.
Step S132, the route to be released route egress policy corresponding with the neighbor router of highest priority is selected to enter Row matching.
Step S133, if the match is successful, the neighbor router is distributed to, and terminate and the neighbours road for the packet The matching of egress policy is route as corresponding to device.
Step S134, if it fails to match, highest priority is selected in remaining route to be released from the packet The route to be released egress policy that route corresponding with the neighbor router is matched.
As above, for route to be released neighbor router RT1 ', for first group of route, directly 2 can will be route Route egress policy corresponding with neighbor router RT1 ' is matched, if the match is successful, is distributed to neighbor router RT1 ', And terminate the matching of route egress policy corresponding with neighbor router RT1 ', if it fails to match, end operation;For second Group route can select the route egress policy corresponding with neighbor router RT1 ' of route 3 to be matched, due to neighbor router Route egress policy includes corresponding to RT1 ':The source-information of route is neighbor router RT4 ', destination address is purpose address 2, therefore, it fails to match;Remaining route (route 4 and route 5) selection highest priority to be released is treated from second group again Issue route (route 4) route egress policy corresponding with the neighbor router is matched, and the match is successful, then is distributed to neighbours Router RT1 ', and terminate the matching of second group of route route egress policy corresponding with RT1 '.
For to route to be released neighbor router RT3 ', first group is route 1 and route 2, and route 1 is better than route 2, Route egress policy includes corresponding to neighbor router RT3 ':The source-information of route is neighbor router RT1 ', purpose Address is purpose address 1, and therefore, the match is successful, then is distributed to neighbor router RT3 ', and first group of route of termination and RT3 ' are right The matching for the route egress policy answered;Second group is route 4 and route 5, and route 4 is better than route 5, due to neighbor router RT3 ' Corresponding route egress policy includes:The source-information of route is neighbor router RT5 ', destination address is purpose address 2, because This, it fails to match, then remaining route (route 5) to be released selects the route (road to be released of highest priority from second group Matched by 5) route egress policy corresponding with the neighbor router, the match is successful, then is distributed to neighbor router RT3 ', And terminate the matching of second group of route route egress policy corresponding with RT3 '.
According to the route advertising method of the disclosure so that when a plurality of route of identical destination address be present, router is not Optimal path therein is simply sent, but can be flexible to determine what bgp neighbor was sent according to the route egress policy of configuration Path.
Fig. 5 shows the block diagram of the advertising of route device according to the embodiment of the disclosure one, and the device can apply to router. As shown in figure 5, the device can include:
Determining module 51, for for any neighbor router, it is determined that to neighbor router route to be released;
Grouping module 52, for the route to be released to be grouped according to destination address;
Matching module 53, for for any packet, therefrom selecting route outlet corresponding with the neighbor router One route of strategy matching is distributed to the neighbor router.
By setting route processing strategy corresponding with neighbor router, it is route for destination address identical, therefrom One route of selection route egress policy matching corresponding with neighbor router is distributed to the neighbor router.According to the disclosure Advertising of route device can will reach same destination address a plurality of route in any one notice away, provide the user More flexible Path selection and network configuration, simultaneously, it is possible to achieve be communicated to for different neighbor routers up to same The a plurality of route of destination address, if a wherein route break, can be quickly switched on other paths, avoid causing as far as possible The interruption of flow, it can also realize and non-optimal route be configured to meet that actual flow forwards demand.
In a kind of possible implementation, the route egress policy includes the attribute information of route;The route Attribute information includes one or several in the source-information, destination address, next-hop of route;The source-information of the route is To the information of the neighbor router of this router issue route;
The selection route for routeing egress policy and matching corresponding with the neighbor router, including:
If the attribute information for the route that the attribute information of route to be released includes with route egress policy is complete Portion is identical, then the route to be released matches with route egress policy.
Fig. 6 shows the block diagram of the advertising of route device according to the embodiment of the disclosure one.As shown in fig. 6,
In a kind of possible implementation, the matching module includes:
Sequencing unit 531, for the route to be released in packet to be carried out into priority ranking;
Matching unit 532, for selecting the route to be released of highest priority is corresponding with the neighbor router to route out Mouth strategy is matched;
Release unit 533, if for the match is successful, be distributed to the neighbor router, and for the packet terminate with The matching of route egress policy corresponding to the neighbor router.
In a kind of possible implementation, if the matching unit 532 is additionally operable to, it fails to match, from the packet The route to be released route egress policy corresponding with the neighbor router of highest priority is selected in remaining route to be released Matched.
Fig. 7 is a kind of block diagram for advertising of route device 900 according to an exemplary embodiment.Reference picture 7, should Device 900 may include processor 901, be stored with the machinable medium 902 of machine-executable instruction.Processor 901 with Machinable medium 902 can communicate via system bus 903.Also, processor 901 passes through read machine readable storage medium Machine-executable instruction corresponding with advertising of route logic is to perform route advertising method described above in matter 902.
Machinable medium 902 referred to herein can be any electronics, magnetic, optics or other physical stores Device, can be included or storage information, such as executable instruction, data, etc..For example, machinable medium can be: RAM (Radom Access Memory, random access memory), volatile memory, nonvolatile memory, flash memory, storage are driven Dynamic device (such as hard disk drive), solid state hard disc, any kind of storage dish (such as CD, dvd), or similar storage are situated between Matter, or combinations thereof.
It is described above the presently disclosed embodiments, described above is exemplary, and non-exclusive, and It is not limited to disclosed each embodiment.In the case of without departing from the scope and spirit of illustrated each embodiment, for this skill Many modifications and changes will be apparent from for the those of ordinary skill in art field.The selection of term used herein, purport The principle of each embodiment, practical application or technological improvement to the technology in market are best being explained, or is leading this technology Other those of ordinary skill in domain are understood that each embodiment disclosed herein.

Claims (8)

1. a kind of route advertising method, it is characterised in that methods described is applied to router, and methods described includes:
For any neighbor router, it is determined that to neighbor router route to be released;
The route to be released is grouped according to destination address;
For any packet, a route of route egress policy matching corresponding with the neighbor router is therefrom selected to send out Cloth gives the neighbor router.
2. route advertising method according to claim 1, it is characterised in that
The route egress policy includes the attribute information of route;Source-information of the attribute information of the route including route, One or several in destination address, next-hop;The source-information of the route is the neighbours road that route is issued to this router By the information of device;
The route for selecting default route egress policy matching corresponding with the neighbor router, including:
If the attribute information for the route that the attribute information of route to be released includes with default route egress policy All identical, then the route to be released matches with default route egress policy.
3. route advertising method according to claim 2, it is characterised in that described for any packet, Cong Zhongxuan A route for selecting default route egress policy matching corresponding with the neighbor router is distributed to the neighbor router, wraps Include:
Route to be released in packet is subjected to priority ranking;
The route to be released route egress policy corresponding with the neighbor router of highest priority is selected to be matched;
If the match is successful, the neighbor router is distributed to, and road corresponding with the neighbor router is terminated for the packet By the matching of egress policy.
4. route advertising method according to claim 3, it is characterised in that this method also includes:
If it fails to match, the route to be released of highest priority is selected in remaining route to be released from the packet with being somebody's turn to do Route egress policy is matched corresponding to neighbor router.
5. a kind of advertising of route device, it is characterised in that described device is applied to router, and described device includes:
Determining module, for for any neighbor router, it is determined that to neighbor router route to be released;
Grouping module, for the route to be released to be grouped according to destination address;
Matching module, for for any packet, therefrom selecting route egress policy corresponding with the neighbor router The route matched somebody with somebody is distributed to the neighbor router.
6. advertising of route device according to claim 5, it is characterised in that
The route egress policy includes the attribute information of route;Source-information of the attribute information of the route including route, One or several in destination address, next-hop;The source-information of the route is the neighbours road that route is issued to this router By the information of device;
The selection route for routeing egress policy and matching corresponding with the neighbor router, including:
If the attribute information whole phase for the route that the attribute information of route to be released includes with route egress policy Together, then the route to be released matches with route egress policy.
7. advertising of route device according to claim 6, it is characterised in that the matching module includes:
Sequencing unit, for the route to be released in packet to be carried out into priority ranking;
Matching unit, for selecting the route to be released of highest priority route egress policy corresponding with the neighbor router to enter Row matching;
Release unit, if for the match is successful, the neighbor router is distributed to, and terminate and the neighbours road for the packet The matching of egress policy is route as corresponding to device.
8. advertising of route device according to claim 7, it is characterised in that
If the matching unit is additionally operable to, it fails to match, and priority is selected most in remaining route to be released from the packet High route to be released route egress policy corresponding with the neighbor router is matched.
CN201711461723.1A 2017-12-28 2017-12-28 Route notification method and device Active CN107888489B (en)

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 true CN107888489A (en) 2018-04-06
CN107888489B 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)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114124780A (en) * 2021-11-15 2022-03-01 迈普通信技术股份有限公司 Route publishing method, device, electronic equipment and storage medium
CN114143807A (en) * 2021-10-27 2022-03-04 中盈优创资讯科技有限公司 Method and device for evaluating integrity rate of route registration

Citations (6)

* Cited by examiner, † Cited by third party
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

Patent Citations (6)

* Cited by examiner, † Cited by third party
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

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114143807A (en) * 2021-10-27 2022-03-04 中盈优创资讯科技有限公司 Method and device for evaluating integrity rate of route registration
CN114143807B (en) * 2021-10-27 2023-08-08 中盈优创资讯科技有限公司 Route registration integrity rate evaluation method and device
CN114124780A (en) * 2021-11-15 2022-03-01 迈普通信技术股份有限公司 Route publishing method, device, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN107888489B (en) 2020-08-11

Similar Documents

Publication Publication Date Title
US11303470B2 (en) Bridging of non-capable subnetworks in bit indexed explicit replication
US10764146B2 (en) Segment routing over label distribution protocol
US20190312806A1 (en) Enforcing strict shortest path forwarding using strict segment identifiers
US9565160B2 (en) Advertisement of adjacency segment identifiers
US9444677B2 (en) Scalable edge node protection using IPv6 segment routing extension header
JP5081576B2 (en) MAC (Media Access Control) tunneling, its control and method
CN101120552B (en) Loop prevention method for MPLS using service labels and network node
CN111385207B (en) Service data forwarding method, network device and network system
CN112087386B (en) Message processing method, device and system
CN111224874B (en) Path construction method and related equipment
CN109218197A (en) Conflict solving in Segment routing
US20070211736A1 (en) Connecting multi-hop mesh networks usinc MAC Bridge
CN113300949A (en) Method for forwarding message, method, device and system for issuing routing information
CN107864091B (en) Link failure processing method and device
CN112868214B (en) Coordinated load transfer OAM records within packets
CN101243648A (en) Method and apparatus for enabling routing of label switched data packets
CN102404198B (en) For controlling the method and apparatus of the notice to route data
CN111490937B (en) Method, device and system for establishing cross-domain forwarding path
US20180343193A1 (en) Method and apparatus for minimum label bandwidth guaranteed path for segment routing
AU2020371074A2 (en) Communication method and device
CN107634893B (en) Method and device for processing Media Access Control (MAC) address advertisement route
CN107547386B (en) Message forwarding method and device
CN107888489A (en) Route advertising method and device
WO2016150093A1 (en) Packet forward method, device, and pe apparatus
CN108494684B (en) Method and device for establishing tunnel

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