U-turn Alternates for IP/LDP Fast-Reroute draft-atlas-ip-local-protect-uturn-01.txt Alia Atlas Gagan Choudhury

Slides:



Advertisements
Similar presentations
APNOMS03 1 A Resilient Path Management for BGP/MPLS VPN Jong T. Park School of Electrical Eng. And Computer Science Kyungpook National University
Advertisements

RSVP-TE Extensions for SRLG Configuration of FA
MPLS - 74th IETF San Francisco1 Composite Transport Group (CTG) Framework and Requirements draft-so-yong-mpls-ctg-framework-requirement-01.txt draft-so-yong-mpls-ctg-framework-requirement-01.txt.
Generalized Multiprotocol Label Switching: An Overview of Signaling Enhancements and Recovery Techniques IEEE Communications Magazine July 2001.
IP Fast Reroute Using Tunnel-AT draft-xu-ipfrr-tunnelat-00 Mingwei Xu, Lingtao Pan, Qing Li Tsinghua University, China 75 th IETF Meeting, Stockholm July.
Pseudowire Endpoint Fast Failure Protection draft-shen-pwe3-endpoint-fast-protection-00 Rahul Aggarwal Yimin Shen
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
MPLS H/W update Brief description of the lab What it is? Why do we need it? Mechanisms and Protocols.
RD-CSY3021 Comparing Routing Protocols. RD-CSY3021 Criteria used to compare routing protocols includes  Time to convergence  Proprietary/open standards.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
Draft-atlas-rtgwg-mrt-frr-architecture-01IETF 82 RTGWG: 17 Nov IP/LDP Fast-Reroute Using Maximally Redundant Trees draft-atlas-rtgwg-mrt-frr-architecture-01.
Network Redundancy Multiple paths may exist between systems. Redundancy is not a requirement of a packet switching network. Redundancy was part of the.
Mobile IP Performance Issues in Practice. Introduction What is Mobile IP? –Mobile IP is a technology that allows a "mobile node" (MN) to change its point.
Chapter 4: Managing LAN Traffic
1 Multi Protocol Label Switching Presented by: Petros Ioannou Dept. of Electrical and Computer Engineering, UCY.
Lecture Week 10 Link-State Routing Protocols. Objectives Describe the basic features & concepts of link-state routing protocols. List the benefits and.
1 Multi-Protocol Label Switching (MPLS). 2 MPLS Overview A forwarding scheme designed to speed up IP packet forwarding (RFC 3031) Idea: use a fixed length.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
 Network Segments  NICs  Repeaters  Hubs  Bridges  Switches  Routers and Brouters  Gateways 2.
Routers. What is a Router? A multi-port connectivity device Can connect different types of LANs as well as WANS Works at Layer 3 – Network Layer using.
1 Countering DoS Through Filtering Omar Bashir Communications Enabling Technologies
OSI Model. Switches point to point bridges two types store & forward = entire frame received the decision made, and can handle frames with errors cut-through.
Protection and Restoration Definitions A major application for MPLS.
U-Turn Alternates for IP/LDP Local Protection draft-atlas-ip-local-protect-uturn-00.txt Alia Atlas Gagan Choudhury
Routing and Routing Protocols
Networking and internetworking devices. Repeater.
IP/LDP Local Protection draft-atlas-ip-local-protect-00.txt Alia Atlas Raveendra Torvi Gagan Choudhury
Section #7: Getting Data from Point A to Point B.
PIM Extension For Tunnel Based Multicast Fast Reroute (TMFRR) draft-lwei-pim-tmfrr-00 IETF 76, Hiroshima.
1 IGP Data Plane Convergence Benchmarking draft-ietf-bmwg-igp-dataplane-conv-app-01.txt draft-ietf-bmwg-igp-dataplane-conv-term-01.txt draft -ietf-bmwg-igp-dataplane-conv-meth-01.txt.
1 IP Fast Reroute with Interface Specific Forwarding Srihari Nelakuditi University of South Carolina, Columbia.
Fundamentals of Computer Networks ECE 478/578
Extended procedures and Considerations for Loop Free Alternatives draft-chunduri-rtgwg-lfa-extended-procedures-01 Uma Chunduri Ericsson Inc. Jeff Tantsura.
82 nd Taipei Protection Mechanisms for LDP P2MP/MP2MP LSP draft-zhao-mpls-mldp-protections-00.txt Quintin Zhao, Emily Chen, Huawei.
1 IGP Data Plane Convergence Benchmarking draft-ietf-bmwg-igp-dataplane-conv-app-00.txt draft-ietf-bmwg-igp-dataplane-conv-term-00.txt draft -ietf-bmwg-igp-dataplane-conv-meth-00.txt.
MPLS Introduction How MPLS Works ?? MPLS - The Motivation MPLS Application MPLS Advantages Conclusion.
CSE 421 Computer Networks. Network Layer 4-2 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside.
Fast Reroute for Node Protection in LDP-based LSPs draft-esale-mpls-ldp-node-frr-02 Raveendra Torvi Luay Jalil
Advanced Computer Networks
Requirements for LER Forwarding of IPv4 Option Packets
Instructor Materials Chapter 5: Dynamic Routing
P2MP MPLS-TE Fast Reroute with P2MP Bypass Tunnels
RSVP-TE Extensions for Associated Co-routed Bidirectional Label Switched Paths (LSPs) draft-gandhishah-teas-assoc-corouted-bidir-01 Author list: Rakesh.
Presenter: Jeffrey Zhang
Authors: Scott Poretsky, Quarry Technologies Brent Imhoff, LightCore
draft-francois-segment-routing-ti-lfa-00
Routing Protocols and Concepts
Link-State Routing Protocols
Dynamic Routing Protocols part2
Multi Protocol Label Switching (MPLS)
Chapter 2: Static Routing
THE NETWORK LAYER.
Chapter 5: Dynamic Routing
Extensions to Resource Reservation Protocol For Fast Reroute of Traffic Engineering GMPLS LSPs draft-ietf-teas-gmpls-lsp-fastreroute-06 Authors: Mike Taillon.
Chapter 2: Static Routing
MPLS Basics 2 2.
LDP Extensions for RMR draft-esale-mpls-ldp-rmr- extensions
Fast Reroute for Node Protection in LDP- based LSPs
CHAPTER 8 Network Management
Chapter 2: Static Routing
Link-State Routing Protocols
ECE 544 Project3 Team member: BIAO LI, BO QU, XIAO ZHANG 1 1.
Link-State Routing Protocols
1 Multi-Protocol Label Switching (MPLS). 2 MPLS Overview A forwarding scheme designed to speed up IP packet forwarding (RFC 3031) Idea: use a fixed length.
COMP/ELEC 429/556 Introduction to Computer Networks
Fast Reroute for Node Protection in LDP- based LSPs
Chapter 10 Link State Routing Protocols
Editors: Bala’zs Varga, Jouni Korhonen
OSPF Protocol.
Presentation transcript:

U-turn Alternates for IP/LDP Fast-Reroute draft-atlas-ip-local-protect-uturn-01.txt Alia Atlas Gagan Choudhury Christian Martin Brent Imhoff Don Fedyk Raveendra Torvi

Slide 2 draft-atlas-ip-local-protect-loopfree-00.txt IETF-60 Routing Area WG U-Turn Alternates: Cooperatively Breaking the Loop S can locally determine to use N as a U-turn alternate if and only if: S is the primary neighbor of N for any shortest paths from N to D that go through S (N is a U-turn neighbor of S). N has signaled that it is capable of breaking U-turns on that interface (U-turn traffic received from S destined to D will go to N’s alternate and not back to S). N has a loop-free node-protecting alternate (R) to reach the destination (D). R S A N Time D E N breaks the loop and sends traffic to alternate interface Time 3

Slide 3 draft-atlas-ip-local-protect-loopfree-00.txt IETF-60 Routing Area WG Original Implicit Packet Identification Method Router signals type of U-turn packet identification supported (implicit or explicitly marked) Implicit Method Packet is U-turn Packet if received from primary neighbor No need to mark packets Allows breaking of upstream micro-forwarding loops; this is best-effort because alternate computed for local failure, not a remote failure.

Slide 4 draft-atlas-ip-local-protect-loopfree-00.txt IETF-60 Routing Area WG Added Explicitly Marked Packet Identification Method Packet is a U-turn Packet if Explicitly Marked (well-known label suggested) Identifies packet as a potential U-turn packet – doesn’t imply switching. Received from primary neighbor This is required to handle transition cases where network isn’t converged. Advantages Easier to implement – marking identifies candidate U-turn packets. Handles more broadcast link scenarios – can have neighbors in different areas (or just hosts) on same link. Properly forwards packets from a TE LSP with Penultimate Hop Popping. Easier to predict – Traffic gets the behavior requested. Disadvantages Requires an explicit marking – must be below Layer 3, b/c no bits available in IP header Doesn’t mitigate micro-forwarding loops

Slide 5 draft-atlas-ip-local-protect-loopfree-00.txt IETF-60 Routing Area WG Other Changes Added example algorithm to look for U-turn alternates Worst-case for node or link protection is 1 additional SPF per neighbor. Connection to alternate selection clarified. Section on SRLGs More details needed Clarified local hold-down considerations Cleaned up text & terminology

Slide 6 draft-atlas-ip-local-protect-loopfree-00.txt IETF-60 Routing Area WG What’s Next? Simplification of Alternate Selection Same behavior regardless of number of Potential Primary Neighbors More Detailed Explanation Considering Link Protection Focus on broadcast links Link to use to access the U-turn neighbor or loop-free neighbor Other suggestions? What is working group interest? Please send comments to the list.