当前位置:网站首页>BGP routing optimization rules and notification principles
BGP routing optimization rules and notification principles
2022-07-02 06:09:00 【Hot pot means red pot】
BGP Routing preference rules
When there are multiple routes to the same destination network segment ,BGP Route optimization is carried out in the following order :
Premise : Discard the next hop unreachable route
- optimization Preferred-Value( Preferred protocol preferred value ) The route with the largest attribute value , The default is 0, Unique to Huawei .
- optimization Local_Preference The route with the largest attribute value . The local priority attribute is in the whole AS Intransition , But not to AS outside , The higher the value, the higher the priority , Generally used as AS The internal router selects an optimal exit to the outside . Default local priority 100 .
- Local (local) Starting Of BGP Routing is better than the routing learned from other peers , Local origin priority : Preferred manual aggregation > Automatic aggregation >network>import> What we learned from the equivalent
- optimization AS_Path Property value The shortest The routing
- optimization Origin Attribute optimal routing .Origin The attribute values are ranked from high to low in priority :IGP、EGP And Incomplete
- optimization MED The route with the smallest attribute value
- Preferably from EBGP Peer to peer routing (EBGP Routing priority is higher than IBG)
- Choose to Next_Hop Of IGP The route with the smallest metric
- optimization Cluster_List The shortest route
- optimization Router ID(Orginator_ID) Minimal device advertised routing
- It is preferred to have a minimum IP Route of peer advertisement of address
- The above rules are arranged in order ,BGP When routing optimization , Start with the first rule , If you cannot make a judgment according to the first rule , For example, routed Preferred-Value Same property value , Then continue to execute the next rule , If according to the current rules ,BGP Can decide the best route , No further execution .
Memory formula :PL-lao-man, front 2 The larger the value, the better , The smaller the value of the last few items, the better , At present 8 When all the attributes of the bar are the same , Routing load sharing can be formed
notes It means :
When a route to the same destination in the public network forms load sharing , The system will first determine the type of optimal route . If the optimal route is IBGP Routing is just IBGP Routing participates in load sharing , If the optimal route is EBGP Routing is just EBGP Routing participates in load sharing , That is, those who arrive at the same destination in the public network IBGP and EBGP Routing cannot form load sharing .
BGP Notification principle
1、 from EBGP Routes obtained by peers
a Will be posted to EBGP peers
b Will be posted to IBGP peers
2、 from IBGP Routes obtained by peers
a Will not be published to IBGP peers
b Whether to publish to EBGP peers , It depends on whether it is turned on BGP Sync
IBGP And IGP The concept of synchronization :BGP Spaker Will not be from IBGP The routing information obtained by the peer is announced to it EBGP peers , Unless the routing information can also pass IGP get .( stay IBGP Routes are added to the routing table and published to EBGP Before the peer , Will check IGP Routing table , Only in IGP Also know this route , It will be added to the routing table , And publish to EBGP peers )( This is to prevent routing black holes , But on Huawei equipment , The default is off , And it cannot be opened , Mainly worried about IGP Can't pass BGP A huge amount of routing information , At this time, you can consider IBGP Full connection ,RR And the alliance )
3、 Only will BGP The optimal route of is published to the peer
a It works + The optimal , namely *+>
b If the route is invalid , Then it's not optimal
c Whether the route is valid , There are two conditions : Whether the next jump can reach ,BGP And IGP Whether synchronization is on
4、 Send only updated routes
边栏推荐
- Redis key value database [advanced]
- 如何使用MITMPROXy
- Step by step | help you easily submit Google play data security form
- LeetCode 77. 组合
- Let every developer use machine learning technology
- The real definition of open source software
- ES6的详细注解
- 谷歌出海创业加速器报名倒计时 3 天,创业人闯关指南提前收藏!
- Compte à rebours de 3 jours pour l'inscription à l'accélérateur de démarrage Google Sea, Guide de démarrage collecté à l'avance!
- Google Go to sea entrepreneurship accelerator registration countdown 3 days, entrepreneurs pass through the guide in advance collection!
猜你喜欢
神机百炼3.54-染色法判定二分图
复杂 json数据 js前台解析 详细步骤《案例:一》
Linkage between esp8266 and stc8h8k single chip microcomputer - Weather Clock
500. 键盘行
网络相关知识(硬件工程师)
Step by step | help you easily submit Google play data security form
memcached安装
Deep learning classification network -- Network in network
How vite is compatible with lower version browsers
ESP8266与STC8H8K单片机联动——天气时钟
随机推荐
Several keywords in C language
神机百炼3.53-Kruskal
Detailed notes of ES6
51 single chip microcomputer - ADC explanation (a/d conversion, d/a conversion)
PHP gets CPU usage, hard disk usage, and memory usage
【C语言】筛选法求素数
Servlet web XML configuration details (3.0)
复杂 json数据 js前台解析 详细步骤《案例:一》
ZABBIX server trap command injection vulnerability (cve-2017-2824)
Mock simulate the background return data with mockjs
图片裁剪插件cropper.js
Leverage Google cloud infrastructure and landing area to build enterprise level cloud native excellent operation capability
I/o multiplexing & event driven yyds dry inventory
Zhuanzhuanben - LAN construction - Notes
Linkage between esp8266 and stc8h8k single chip microcomputer - Weather Clock
Lucene Basics
ES6的详细注解
How vite is compatible with lower version browsers
Contest3147 - game 38 of 2021 Freshmen's personal training match_ E: Listen to songs and know music
使用sha256文件验证下载的文件