IP fast reroute s olutions and challenges Amund Kvalbein.

Slides:



Advertisements
Similar presentations
Path Splicing Nick Feamster, Murtaza Motiwala, Megan Elmore, Santosh Vempala.
Advertisements

Multihoming and Multi-path Routing
Path Splicing with Network Slicing Nick Feamster Murtaza Motiwala Santosh Vempala.
A Narrow Waist for Multipath Routing Murtaza Motiwala Bilal Anwer, Mukarram bin Tariq David Andersen, Nick Feamster.
Identifying MPLS Applications
Micro-loop Prevention Methods draft-bryant-shand-lf-conv-frmwk-00.txt draft-zinin-microloop-analysis-00.txt.
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.
IEEE HPSR IP Network Background and Strategy Milestones  Started as a Internet backbone/IGW  Expansion with MAN networks  Tripleplay and multimedia,
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—8-1 MPLS TE Overview Introducing the TE Concept.
Computer Networks20-1 Chapter 20. Network Layer: Internet Protocol 20.1 Internetworking 20.2 IPv IPv6.
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
UNIT-IV Computer Network Network Layer. Network Layer Prepared by - ROHIT KOSHTA In the seven-layer OSI model of computer networking, the network layer.
Dynamic Routing Scalable Infrastructure Workshop, AfNOG2008.
EIGRP routing protocol Omer ben-shalom Omer Ben-Shalom: Must show how EIGRP is dealing with count to infinity problem Omer Ben-Shalom: Must.
Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.
TIE Breaking: Tunable Interdomain Egress Selection Renata Teixeira Laboratoire d’Informatique de Paris 6 Université Pierre et Marie Curie with Tim Griffin.
Trajectory Sampling for Direct Traffic Observation Matthias Grossglauser joint work with Nick Duffield AT&T Labs – Research.
Introduction to MPLS and Traffic Engineering Zartash Afzal Uzmi.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
MPLS and Traffic Engineering
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Introduction to MPLS and Traffic Engineering
Routing.
Tesseract A 4D Network Control Plane
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Ashish Gupta (98130) Ashish Gupta (98131) Under guidance of Prof. B. N. Jain.
Class 3: SDN Stack Theophilus Benson. Outline Background – Routing in ISP – Cloud Computing SDN application stack revisited Evolution of SDN – The end.
Routing of Outgoing Packets with MP-TCP draft-handley-mptcp-routing-00 Mark Handley Costin Raiciu Marcelo Bagnulo.
Draft-atlas-rtgwg-mrt-frr-architecture-00IETF 81 RTGWG: 27 July An Architecture for IP/LDP Fast-Reroute Using Maximally Redundant Trees draft-atlas-rtgwg-mrt-frr-architecture-00.
INTRA- AND INTERDOMAIN ROUTING Routing inside an autonomous system is referred to as intradomain routing. Routing between autonomous systems is.
Russ White IP Fast reroute Russ White
Chapter 22 Network Layer: Delivery, Forwarding, and Routing
University of the Western Cape Chapter 11: Routing Aleksandar Radovanovic.
Profiles and Multi-Topology Routing in Highly Heterogeneous Ad Hoc Networks Audun Fosselie Hansen Tarik Cicic Paal Engelstad Audun Fosselie Hansen – Poster,
Multi-topology protection: promises and problems G. Apostolopoulos Institute of Computer Science Foundation Of Research and Technology Hellas (FORTH)
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.
Chapter 9. Implementing Scalability Features in Your Internetwork.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Unicast Routing Protocols.
Central Control over Distributed Routing fibbing.net SIGCOMM Stefano Vissicchio 18th August 2015 UCLouvain Joint work with O. Tilmans (UCLouvain), L. Vanbever.
Draft-francois-segment-routing-ti-lfa-00 Pierre Francois, IMDEA Networks Institute Clarence Filsfils, Ahmed Bashandy, Cisco Systems Bruno Decraene, Stephane.
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.
A Snapshot on MPLS Reliability Features Ping Pan March, 2002.
Jennifer Rexford Fall 2010 (TTh 1:30-2:50 in COS 302) COS 561: Advanced Computer Networks Backbone.
Fast recovery in IP networks using Multiple Routing Configurations Amund Kvalbein Simula Research Laboratory.
Dynamic Routing Protocols II OSPF
On Improving the Efficiency and Manageability of NotVia Ang Li †, Pierre Francois ‡, and Xiaowei Yang † † UCIrvine ‡ Université catholique de Louvain CoNext.
Mike Freedman Fall 2012 COS 561: Advanced Computer Networks Traffic Engineering.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—3-1 Route Selection Using Policy Controls Using Multihomed BGP Networks.
A Snapshot on MPLS Reliability Features Ping Pan March, 2002.
1 IP Fast Reroute with Interface Specific Forwarding Srihari Nelakuditi University of South Carolina, Columbia.
Extended procedures and Considerations for Loop Free Alternatives draft-chunduri-rtgwg-lfa-extended-procedures-01 Uma Chunduri Ericsson Inc. Jeff Tantsura.
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Prof. Alfred J Bird, Ph.D., NBCT Office – McCormick 3rd floor 607 Office Hours – Monday 3:00 to 4:00 and.
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Advanced Computer Networks
Amund Kvalbein, Audun F. Hansen,
Presenter: Jeffrey Zhang
draft-francois-segment-routing-ti-lfa-00
IP Multicast Fast Reroute follow-up on draft-dimitri-rtgwg-mfrr-framework-00 RTG Working Group IETF 75 meeting Stockholm (Sweden) July 2009.
Loop protection and IPFRR
Routing.
Dynamic Routing and OSPF
COS 561: Advanced Computer Networks
Backbone Traffic Engineering
Routing.
Achieving Resilient Routing in the Internet
IPFRR WITH FAST NOTIFICATION
Presentation transcript:

IP fast reroute s olutions and challenges Amund Kvalbein

Outline Motivation for fast IP recovery What do we want? Current solutions What are the challenges?

Do we need proactive IP recovery? Yes: –Strict delay/availability requirements dictate a proactive solution –The costs of a re-convergence are too great for transient failures No: –Re-convergence is fast enough (sub-second) –If you want FRR, use MPLS

What do we want? Functional: Protect both link and node failures 100% coverage (?) Easy support for multicast traffic LANs, ECMP, asymmetric weights, SRLG, MPLS Protect multihomed prefixes if reachable Operational: Smooth network dynamics / plug-and-play Easy integration in current routing Nice distribution of recovered traffic

Selected IPFRR mechanisms Interface specific routing (USC) Not-via (Cisco) Multiple Routing Configurations (Simula) (IP Redundant Trees (Simula)) All give protection against both link and node failures

Interface specific routing (FIR/FIFR) Infer failures from packet flight Interface specific FIB Repair to egress

FIR/FIFR strengths No tunnelling, packet marking or other special treatment of repaired traffic Repair paths almost shortest path Easy support for MHP

FIR/FIFR weaknesses Not always 100% coverage –No strategy for last-hop link failures –Issue with looping when there are more than one failure Not easy support for multicast traffic Little flexibility to control recovered traffic Difficulties with SRLGs

Not-via Connectionless version of MPLS-FRR Create special not-via addresses Routing to these addresses is restricted –Avoid the failed component 2|E| addresses needed Repair to next-next hop

Not-via strengths 100% coverage Easy support for multicast traffic –Due to repair to next-next hop Easy support for SRLGs …

Not-via weaknesses Relies on tunnelling –Heavy processing –MTU issues Suboptimal backup path lengths –Due to repair to next-next hop

Multiple Routing Configurations Relies on multiple logical topologies –Builds backup configurations so that all components are protected Recovered traffic is routed in the backup configurations Repairs to the egress node

MRC strengths 100% coverage Better control over recovery paths –Recovered traffic routed independently Easy support for SRLGs

MRC weaknesses Needs a topology identifier –Packet marking, or –Tunnelling Multicast not trivially solved Number of topologies not bounded

IP redundant trees New method developed at Simula by combining RT and MRC Fixed number of backup ”topologies” (two trees) Trees are calculated per destination

Key design difference Where is recovered traffic sent –Next-next hop (Not-via) –Egress router (FIR & MRC) This has consequences for –MC support –Traffic Engineering

Combining MRC and Not-via If tunnelling is used in MRC, then MRC can be seen as a generalized version of not-via –Freedom to repair to egress or next-next hop –Not-via: exclude heavily loaded links

Main challenges How to handle network dynamics MC support More elegant support for MHP Effects of FRR on traffic (TCP etc) Practical issues –FIB organisation –Traffic differentiation

Groups Intra-domain and other network environments –Mike (Scribe) –Tarik –Audun –Srihari Inter-domain –Georgios (Scribe) –Rudiger –Amund –Pierre Framework & Metrics –James (Scribe) –Michael –Josh –Stein –Marian