Draft-litkowski-rtgwg-spf-uloop-pb-statement IETF 90 - Toronto S. Litkowski, Orange.

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

New Timing Distribution Mechanism TICTOC WG, IETF 71th Philadelphia, USA draft-ji-tictoc-new-timing-distribution-mechanism-00.txt Kuiwen Ji
Micro-loop Prevention Methods draft-bryant-shand-lf-conv-frmwk-00.txt draft-zinin-microloop-analysis-00.txt.
Part 2: Preventing Loops in the Network
Composite Link Framework Issues. Functional requirement #1 The solution SHALL provide a means to summarize routing advertisements regarding the characteristics.
Consensus Routing: The Internet as a Distributed System John P. John, Ethan Katz-Bassett, Arvind Krishnamurthy, and Thomas Anderson Presented.
Courtesy: Nick McKeown, Stanford
OSPF Traffic Engineering (TE) Express Path draft-giacalone-ospf-te-express-path-00.txt Spencer Giacalone, Alia Atlas, John Drake, Dave Ward.
Draft-li-isdnrg-seamless-mpls-mbh-00IETF 92 SDNRG1 Inter-SDN in Seamless MPLS for Mobile Backhaul Zhenbin Li, Rober Tao Huawei Technologies IETF 92, Dallas,
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public BSCI Module 4 Lesson 1 1 The IS-IS Protocol BSCI Module 4 Lesson 1 Introducing IS-IS and Integrated.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Path Protection in MPLS Networks Using Segment Based Approach.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Draft-li-rtgwg-cc-igp-arch-00IETF 88 RTGWG1 An Architecture of Central Controlled Interior Gateway Protocol (IGP) draft-li-rtgwg-cc-igp-arch-00 Zhenbin.
Chapter 22 Network Layer: Delivery, Forwarding, and Routing.
1 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Confidential Session Number Presentation_ID Advanced BGP Convergence Techniques Pradosh Mohapatra.
Link State Routing Protocol W.lilakiatsakun. Introduction (1) Link-state routing protocols are also known as shortest path first protocols and built around.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Link-State Routing Protocols Routing Protocols and Concepts – Chapter.
Lecture Week 10 Link-State Routing Protocols. Objectives Describe the basic features & concepts of link-state routing protocols. List the benefits and.
Network Course Internetworking Protocols Dr. Raed Al Qadi.
Multi-topology protection: promises and problems G. Apostolopoulos Institute of Computer Science Foundation Of Research and Technology Hellas (FORTH)
IGP Multicast Architecture Lucy Yong, Weiguo Hao, Donald Eastlake Andrew Qu, Jon Hudson, Uma Chunduri November 2014 Honolulu USA draft-yong-rtgwg-igp-mutlicast-arch-00.
Multiple Links Failover Mechanism for RPR Interconnected Rings IEEE WG Orlando, Florida USA March 11~16, 2007.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
Chapter 3 Developing an algorithm. Objectives To introduce methods of analysing a problem and developing a solution To develop simple algorithms using.
Draft-li-mpls-network-virtualization-framework-00IETF 88 SPRING WG1 Framework of Network Virtualization Based on MPLS Global Label draft-li-mpls-network-virtualization-framework-00.
IGP Multicast Architecture Lucy Yong, Weiguo Hao, Donald Eastlake Andrew Qu, Jon Hudson, Uma Chunduri November 2014 Honolulu USA draft-yong-rtgwg-igp-mutlicast-arch-00.
Routing Area WG (rtgwg) IETF 90 – London Chairs: Alvaro Retana Jeff Tantsura
CCNA 3 Week 2 Link State Protocols OSPF. Copyright © 2005 University of Bolton Distance Vector vs Link State Distance Vector –Copies Routing Table to.
IGP Data Plane Convergence draft-ietf-bmwg-dataplane-conv-meth-14.txt draft-ietf-bmwg-dataplane-conv-term-14.txt draft-ietf-bmwg-dataplane-conv-app-14.txt.
1 IETF-61 – Washington DC Path Computation Element (PCE) BOF-2 Status - CCAMP Co-chairs: JP Vasseur/Adrian Farrel ADs: Alex Zinin/Bill Fenner.
Lecture 2 Agenda –Finish with OSPF, Areas, DR/BDR –Convergence, Cost –Fast Convergence –Tools to troubleshoot –Tools to measure convergence –Intro to implementation:
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning Tree Protocol.
SRI International 1 Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) Richard Ogier September 21, 2002.
Kireeti Kompella draft-kompella-mpls-rmr-01
1 Requirements for Very Fast Setup of GMPLS LSPs draft-malis-ccamp-fast-lsps-01 Andrew G. Malis Ronald A. Skoog Haim Kobrinski George Clapp John E. Drake.
Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.
Inter-area MPLS TE Architecture and Protocol Extensions
IP/LDP Local Protection draft-atlas-ip-local-protect-00.txt Alia Atlas Raveendra Torvi Gagan Choudhury
Spring 2000CS 4611 Routing Outline Algorithms Scalability.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
Draft-li-rtgwg-igp-ext-mrt-frr-00IETF 85 RTGWG1 Applicability of LDP Multi-Topology for Unicast Fast-reroute Using Maximally Redundant Trees draft-li-rtgwg-ldp-mt-mrt-frr-01.
COE-541 LAN / MAN Simulation & Performance Evaluation of CSMA/CA
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
Expedited Flooding for Restoration in Shared-Mesh Transport Networks -draft-rabbat-expedited-flooding-00 -Richard Rabbat (FLA) -Vishal Sharma (Metanoia,
Coping with Link Failures in Centralized Control Plane Architecture Maulik Desai, Thyagarajan Nandagopal.
82 nd Taipei Protection Mechanisms for LDP P2MP/MP2MP LSP draft-zhao-mpls-mldp-protections-00.txt Quintin Zhao, Emily Chen, Huawei.
Requirements for the Resilience of Control Plane in GMPLS (draft-kim-ccamp-cpr-reqts-00.txt) Young Hwa Kim CCAMP WG (59 th IETF) Apr.04,
draft-patel-raszuk-bgp-vector-routing-01
Zhenbin Li, Li Zhang(Huawei Technologies)
draft-litkowski-rtgwg-node-protect-remote-lfa
draft-litkowski-pce-state-sync-00
draft-litkowski-isis-yang-isis-cfg IETF 90 - Toronto
Synchronisation of Network Parameters draft-bryant-rtgwg-param-sync-00
Tomohiro Otani Kenji Kumaki Satoru Okamoto Wataru Imajuku
PCEP Extensions For Transporting Traffic Engineering (TE) Data
Multi Topology Routing (MTR) for OSPF
L1VPN Working Group Scope
Link-State Routing Protocols
Dynamic Routing Protocols part2
Rip Routing Protocol.
OSPF & ISIS Flooding Reduction
Link-State Routing Protocols
RFC 1058 & RFC 2453 Routing Information Protocol
Separating Routing Planes using Segment Routing draft-gulkohegde-spring-separating-routing-planes-using-sr-00 IETF 98 – Chicago, USA Shraddha Hegde
IS-IS Flooding Reduction in MSDC
Link-State Routing Protocols
draft-litkowski-spring-non-protected-paths-01
BGP-Based SPF IETF 98, Chicago
PIM Backup DR Mankamana Mishra IETF-102
Presentation transcript:

draft-litkowski-rtgwg-spf-uloop-pb-statement IETF 90 - Toronto S. Litkowski, Orange

Introduction The draft analyses how different implementations of IGP link state protocols may favor microloops The draft does not propose any solution but calls for standardizing some new components of IGP (apart of the protocol itself)

Microloops (reminder … ) Traffic goes from S to D When SD fails, if D converges before E, the traffic will loop until E has converged Why taking care about microloops ? – See our other draft : draft-ietf-rtgwg-uloop-delay S ---- E | | 10 | | 10 | | D ---- A 2

IGP convergence time difference between nodes is critical in the microloop phenomenon Components of IGP LinkState convergence : – Detection (direct or indirect through protocol notification) – SPF delay – SPF computation time – RIB/FIB insertion IGP convergence influence on microloops HW and implementations are more and more powerful in this area Negligeable with current CPUs (x msec) Hundreds of msec or seconds May be hundreds of msec (theorically) May favor microloops

Multiple implementation exists : – Always compute full SPF – Run Full SPF only when required If a link fails, two LSPs are sent, if a SPF has already been computed for LSP1, there is no need to run full SPF for LSP2 (topology has not change) – If topology does not change, only recomputes reachability SPF trigger strategies

Most (all) implementations are introducing variable delays before running SPF in order to manage churns Major implementations : – Exponential backoff – Two steps (rapid/slow mode) SPF delay strategies SPF delay time ^ | SD- | x xx x | RD- | x x x x | > Events | | | | || | | SPF delay time ^ MD- | xx x | | x | | x | FD- | x x x ID | > Events | | | | || | | FM->BM >FM

Consider : – S strategy : Full SPF triggered only when necessary Two step SPF delay (Rapid=150ms,Rapidruns=3,Slow=1s) Separate timer is used for SPF delay and PRC delay but same values – E strategy : Always compute full SPF (no PRC) Exponential backoff SPF delay (FD=150ms,ID=150ms,max=1s) Mixing strategies in a network S ---- E | | 10 | | 10 | | D ---- A 2

Mixing strategies in a network S ---- E | | 10 | | 10 | | D ---- A 2 S timescale E timescale Event timescale | | | | | | <- t0 Event prefix down | Schedule PRC (150ms) | Schedule SPF (150ms) | | | | | PRC starts | SPF starts | | PRC ends | | | RIB/FIB starts | SPF ends | | | RIB/FIB starts | | RIB/FIB ends | | | | RIB/FIB ends | t0+180ms | | | | | | < - t0+200ms Event prefix up | Schedule PRC (150ms) | Schedule SPF (150ms) | | | | | PRC starts | SPF starts | | PRC ends | | | RIB/FIB starts | SPF ends | | | RIB/FIB starts | | RIB/FIB ends | | | | RIB/FIB ends | t0+380ms | | | < - t0+400ms Event prefix down | Schedule PRC (300ms) | Schedule SPF (300ms) | | | |

| PRC starts | SPF starts | | PRC ends | | | RIB/FIB starts | SPF ends | | | RIB/FIB starts | | RIB/FIB ends | | | | RIB/FIB ends | t0+730ms | | | | | | < - t0+1000ms Event link S-D down | Schedule SPF (150ms) | Schedule SPF (600ms) | | | | | SPF starts | | | | | | SPF ends | | | RIB/FIB starts | | | | | } | RIB/FIB ends | | } | | | } | | | } Micro-loop creation | | | } | | SPF starts | } | | | } | | SPF ends | } | | RIB/FIB starts | } | | | } | | RIB/FIB ends | } S ---- E | | 10 | | 10 | | D ---- A 2 Misalignement of SPF delays

Proposed work items Standardize SPF trigger strategy Standardize SPF timer scope : – Single timer for all computations, or multiple … Standardize progressive SPF delay algorithm

Other parameters may be standardized like flooding strategies Flooding strategies are critical piece of codes in implementation that may be not so easy to touch … Non goal

WG feedback ? Do WG consider that this is an item to work on ? – We DO ! – Simple to agree and implement … and will help to minimize microloops duration or occurrences. What’s next ?