What this book covers
Chapter 1, Introduction to Multiprotocol Label Switching (MPLS), revisits the fundamentals of MPLS, providing you with a concise yet insightful review of its operations. Additionally, it offers valuable perspectives into the basics of segment routing.
Chapter 2, Lab 1 – Getting Started with LDP-Based MPLS Network, walks you through setting up the basic network topology. It covers using IS-IS as the interior gateway routing protocol and LDP as the MPLS forwarding protocol.
Chapter 3, Lab 2 – Introducing Segment Routing MPLS (SR-MPLS), introduces segment routing within an existing MPLS network based on LDP and explains how forwarding operates in both scenarios.
Chapter 4, Lab 3 – SR-LDP Interworking, concentrates on connecting different domains from LDP to SR-MPLS, and vice versa. You will understand how the inter-domain label switch path is created and the essential requirements for it. You will also grasp the significance of SRMS in facilitating interaction between SR-MPLS and traditional MPLS networks.
Chapter 5, Lab 4 – Introducing TI-LFA (Topology Independent – Loop-Free Alternate), introduces TI-LFA in SR-MPLS networks, detailing the calculation and installation of backup paths on routers.
Chapter 6, Lab 5 – Zero-Segment FRR, explores scenarios where backup paths can reroute traffic in the event of network failures, without any additional segments introduced.
Chapter 7, Lab 6 – Single-Segment FRR, examines scenarios where backup paths reroute traffic in case of network failures, requiring only one additional segment for rerouting.
Chapter 8, Lab 7 – Double-Segment FRR, examines scenarios where backup paths reroute traffic in case of network failures, requiring two additional segments.
Chapter 9, Lab 8 – Microloop Avoidance, discusses the occurrence of microloops during network convergence and explores their mitigation within SR-MPLS networks.
Chapter 10, Lab 9 – TI-LFA Node Protection, prepares the network topology for forthcoming TI-LFA scenarios. It specifically delves into the node protection method, where the backup path is computed under the assumption that a link failure implies a node failure.
Chapter 11, Lab 10 – TI-LFA Local SRLG-Disjoint Protection, explores the TI-LFA local-SRLG disjoint scenario, where the backup path is calculated under the assumption that all local SRLG links fail simultaneously.
Chapter 12, Lab 11 – TI-LFA Global Weighted SRLG Protection, builds upon the previous lab, examining scenarios where both local and remote SRLG links are bypassed in the calculation of TI-LFA backup paths.
Chapter 13, Lab 12 – TI-LFA Node + SRLG Protection, delves into a scenario where TI-LFA is tasked with computing and implementing a backup path that circumvents both local as well as remote SRLGs and the involved node.
Chapter 14, Lab 13 – TI-LFA Tiebreaker, addresses scenarios where TI-LFA is tasked with calculating both node protection and SRLG protection simultaneously. It explores how prioritization is determined when both protections can’t be achieved concurrently.
