ImageVerifierCode 换一换
格式:PPT , 页数:29 ,大小:807.50KB ,
资源ID:378068      下载积分:2000 积分
快捷下载
登录下载
邮箱/手机:
温馨提示:
快捷下载时,用户名和密码都是您填写的邮箱或者手机号,方便查询和重复下载(系统自动生成)。 如填写123,账号就是123,密码也是123。
特别说明:
请自助下载,系统不会自动发送文件的哦; 如果您已付费,想二次下载,请登录后访问:我的下载记录
支付方式: 支付宝扫码支付 微信扫码支付   
验证码:   换一换

加入VIP,免费下载
 

温馨提示:由于个人手机设置不同,如果发现不能下载,请复制以下地址【http://www.mydoc123.com/d-378068.html】到电脑端继续下载(重复下载不扣费)。

已注册用户请登录:
账号:
密码:
验证码:   换一换
  忘记密码?
三方登录: 微信登录  

下载须知

1: 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。
2: 试题试卷类文档,如果标题没有明确说明有答案则都视为没有答案,请知晓。
3: 文件的所有权益归上传用户所有。
4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
5. 本站仅提供交流平台,并不能对任何下载内容负责。
6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

版权提示 | 免责声明

本文(Advanced BGP Convergence Techniques.ppt)为本站会员(sumcourage256)主动上传,麦多课文库仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。 若此文所含内容侵犯了您的版权或隐私,请立即通知麦多课文库(发送邮件至master@mydoc123.com或直接QQ联系客服),我们立即给予删除!

Advanced BGP Convergence Techniques.ppt

1、Advanced BGP Convergence Techniques,Pradosh Mohapatra ,Apricot 2006,Agenda,Terminology Convergence Scenarios Core Link Failure Edge Node Failure Edge Link Failure,Basic Terminology,Prefix A route that is learnt by routing protocols. 12.0.0.0/16 Pathlist A list of Next Hop paths learnt by routing pro

2、tocols. 12.0.0.0/16 Via POS1/0 Via GE2/0, 5.5.5.510.0.0.0/16 Via 5.5.5.5,Non-recursive,Recursive (Depends on the resolution of the next-hop),Forwarding Table Structure,Intf1/NH1,Intf2/NH2,Intf3/NH3,Intf4/NH4,Salient Features,Pathlist Sharing: All BGP prefixes that have the same set of paths point to

3、 a single pathlist. Hierarchical Structure: BGP prefixes (recursive) point to IGP prefixes (non-recursive).,Core Link Failure,6,6,6,Multipath BGP, Multipath IGP, IGP path goes down,Initial organization before failure of IGP path 1. Link to Path 1 goes down.,Multipath BGP, Multipath IGP, IGP path goe

4、s down,IGP pathlist modified after Path 1 failure. BGP Convergence = IGP Convergence.,Multipath BGP, Multipath IGP, IGP prefix is deleted,Initial organization before deletion of IGP prefix 1. IGP Prefix 1 gets deleted. Fix-up BGP PL to point to the second path.,Multipath BGP, Multipath IGP, IGP pref

5、ix is deleted,BGP pathlist modified after deletion of IGP prefix 1. BGP Convergence = IGP Convergence.,Multipath BGP, Multipath IGP, IGP path modified,Initial organization before modification of IGP Path 1. IGP Path 1 gets modified. BGP Convergence = IGP Convergence,Conclusion,In case of core link f

6、ailure: Sub-second convergence. BGP Prefix-independent & In-place modification of the forwarding table. Make-before-break solution,Edge Node Failure,13,13,13,Edge node failure,PE1 has selected PE2 as bestpath and has installed that path only in forwarding table. What PE1 needs upon PE2s failure is f

7、ast detection of Unreachability. Unreachability status requires all the IGP neighbors to have detected the failure and have sent their LSPs to PE1. PE1 now needs to point to PE3.,PE2,PE3,PE1,P1,P2,BGP Next-Hop Tracking,Event-driven reaction to BGP next-hop changesBGP communicates its next-hops to RI

8、B.If RIB gets a modify/delete/add of an entry covering these next-hops, it notifies BGP.BGP runs bestpath algorithm. Stability requirementFast reaction to isolated eventsDelayed reaction to too frequent events Classification of EventsNext-hop unreachable is critical: React faster. Metric Change is n

9、on-critical: React slower.,BGP NHT Implementation highlights,RIB implements dampening algorithmNext-hops flapping too often are dampened. RIB classifies next-hop changes as critical or non-critical.Critical events are sent immediately to BGP. Non-critical events are delayed up-to 3 seconds. BGP has

10、an initial delay before it reacts to next-hop changes.Default: 5s. Configurable.Capture as many changes as possible within the initial delay before running bestpath.,router bgp 1bgp nexthop-trigger-delay 1,BGP NHT - example,RIB sends 1st NH notification,IGP CV,Lk Dn,T2,NHScan + BestPath,T1,T3,T1: Li

11、nk failure triggering IGP convergence. T2: First next-hop notification to BGP. T3: BGP reads the next-hop updates and starts initial delay timer. T4: Initial delay period expires. BGP does Nhscan and bestpath change (a function of the table size).,T4,BGP NHT,Principle: The first SPF must declare PE2

12、 as unreachableWe want to make sure that if PE2 fails, then all its neighbors have had the time to detect the failure, originate their LSP and have flooded it to PE1We want to make sure that when PE1 starts its SPF, all PE2s neighbors LSPs are in PE1s database Dependencyfast failure detectionfast fl

13、oodingSPF Initial-wait conservative enough,BGP NHT Typical Timing,0: PE2 failure 50ms: PE1 receives the 1st LSP and schedules SPF at T=200msthe other LSPs will have all the time to arrive in the meantime 200ms: PE1 starts SPF we account a duration of 30ms but with iSPF it will be 1ms 232ms: PE1 dele

14、tes PE2s loopback and schedules BGP NHT at T=1232msthere are few prefixes to modify as this is a node failure 1232ms: PE1 runs BGP NHTtable scan: 6us per entry: if PE1 has 20k routes: 120msRIB modify: 140us per entry: if PE1 has 5k routes from PE2, it takes 700ms70ms distribution download 2122ms: PE

15、1/LC has finished modifying the BGP entries to use nh=PE3. We still need to resolve themresolution starts 0, 1000msresolution lasts: 100us per entry 3622ms: Convergence is finished in the worst case,Conclusion Edge node failure,Sub-5s is achievableanalyzed scenario leads to WC 3500ms Sub-Second is c

16、hallenging Ongoing work to improve this further: Backup path,Backup Path,Intf3/NH3,Intf4/NH4,No Multipath. Prefix always points to Path 1. Reroute triggered per IGP prefix: fix-up Path 1 to point to the backup path.,Backup Path Contd.,Problem: How to know the backup path? BGP advertises only one pat

17、h. Peering with RRs: RR sends only the bestpath it computes. Solution: Add-path draft.,ADD-PATH,Mechanism that allows the advertisement of multiple paths for the same prefix without the new paths implicitly replacing any previous ones. Add a path identifier to the encoding to distinguish between dif

18、ferent prefixes.,+-+ | Path Identifier (4 octets) | +-+ | Length (1 octet) | +-+ | Label (3 octets) | +-+ . +-+ | Prefix (variable) | +-+,+-+ | Path Identifier (4 octets) | +-+ | Length (1 octet) | +-+ | Prefix (variable) | +-+,ADD-PATH - Operation,New capability: Add-path Advertisement of the capab

19、ility indicates ability to receive multiple paths for all negotiated AFI/SAFI. Advertisement of specific AFI/SAFI information in the capability indicates the intent to send multiple paths. Only in these cases must the new encoding be used. Concerns: Cost of multiple paths advertisement outweigh the

20、benefits on convergence?,Edge Link Failure,25,25,25,Example: PE-CE Link Failure,CE2,CE3,CE1,VPN1 site,VPN1 HQ,PE1,PE2,PE3,RRA1,RRA2,RRB1,RRB2,Edge Link Failure scenarios,Edge Link Failure: Next-hop on the peering link Convergence behavior same as the last two scenarios. Edge Link Failure: Next-hop-self Default behavior for L3VPN In-place modification and/or BGP NHT do not help. Advanced BGP signaling required.,Any Questions ?,

copyright@ 2008-2019 麦多课文库(www.mydoc123.com)网站版权所有
备案/许可证编号:苏ICP备17064731号-1