Posts Tagged ‘routing loops’
For a limited time we are publishing the Route Redistribution videos from our CCIE Routing & Switching Advanced Technologies Class for public viewing. These videos cover all aspects of Route Redistribution needed for the CCIE R&S Lab Exam outside of the scope of MPLS, and will also be useful for any engineers looking for more information on how the Route Redistribution process works.
Specifically these videos cover basic and advanced route redistribution configuration, verification, and troubleshooting, including how and why route redistribution loops occur, how to identify and fix loops related to both Administrative Distance and Metric, TCL scripting for reachability testing, route tagging, the IP Route Profile feature, how to use and interpret the debug ip routing output, and other related topics. Links the videos are as follows:
- Route Redistribution Overview – Runtime 0h 36m
- Route Redistribution Configuration & Verification, Connected Redistribution- Runtime 0h 22m
- OSPF External Path Selection, TCL PING Scripting – Runtime 0h 33m
- Routing Loops Overview, EIGRP Route Loop Prevention – Runtime 0h 55m
- Metric Based Routing Loops, Route Tagging – Runtime 0h 46m
- Administrative Distance Based Routing Loops, Debug IP Routing, IP Route Profile – Runtime 0h 58m
For technical questions about the topics covered in these videos please visit INE’s Online Community.
All of these videos and others totalling over 80 hours for the CCIE R&S ATC series are included in all of our All Access Pass subscriptions at just $159 per month, along with access to over 900 hours of other training videos that include, but are not limited to:
- CCNA Routing & Switching
- CCNA Security
- CCNA Voice
- CCNA Wireless
- CCNP Routing & Switching
- CCNP Security
- CCNP Voice
- CCIE Routing & Switching
- CCIE Security
- CCIE Voice
- CCIE Service Provider
In this series of posts, we are going to review some interesting topics illustrating unexpected behavior of the BGP routing protocol. It may seem that BGP is a robust and stable protocol, however the way it was designed inherently presents some anomalies in optimal route selection. The main reason for this is the fact that BGP is a path-vector protocol, much like a distance-vector protocol with optimal route selection based on policies, rather than simple additive metrics.
The fact that BGP is mainly used for Inter-AS routing results in different routing policies used inside every AS. When those different policies come to interact, the resulting behavior might not be the same as expected by individual policy developers. For example, prepending the AS_PATH attribute may not result in proper global path manipulation if an upstream AS performs additional prepending.
In addition to that, BGP was designed for inter-AS loop detection based on the AS_PATH attribute and therefore cannot detect intra-AS routing loops. Optimally, intra-AS routing loops could be prevented by ensuring a full mesh of BGP peering between all routers in the AS. However, implementing full-mesh is not possible for a large number of BGP routers. Known solutions to this problem – Route Reflectors and BGP Confederations – prevent all BGP speakers from having full information on all potential AS exit points due to the best-path selection process. This unavoidable loss of additional information may result in suboptimal routing or routing loops, as illustrated below.