Tunnel based FRR <draft-bryant-ipfrr-tunnels-00.txt> RTWG - - PowerPoint PPT Presentation

tunnel based frr
SMART_READER_LITE
LIVE PREVIEW

Tunnel based FRR <draft-bryant-ipfrr-tunnels-00.txt> RTWG - - PowerPoint PPT Presentation

Tunnel based FRR <draft-bryant-ipfrr-tunnels-00.txt> RTWG IETF-60 August 2004 Stewart Bryant <stbryant@cisco.com> Mike Shand <mshand@cisco.com> 1 Goals FRR MUST do no harm the impact of the mechanism is never worse


slide-1
SLIDE 1

1

Tunnel based FRR

<draft-bryant-ipfrr-tunnels-00.txt>

RTWG IETF-60 August 2004 Stewart Bryant <stbryant@cisco.com> Mike Shand <mshand@cisco.com>

slide-2
SLIDE 2

2 Tunnel based FRR IETF-60

Goals

  • FRR MUST do no harm – the impact of the

mechanism is never worse than if it were not used.

  • Once a router has detected the failure, no further

packets will be lost.

  • No topology tuning required.
  • MUST be suitable for incremental deployment
slide-3
SLIDE 3

3 Tunnel based FRR IETF-60

Implications of the goals

  • Following invocation of the repair a

controlled convergence is needed to avoid undoing the FRR repair, and collateral damage due to micro-looping.

  • Controlled convergence takes time,

therefore repair must be 100% to prevent extending outage for un-repaired destinations.

slide-4
SLIDE 4

4 Tunnel based FRR IETF-60

Overview

  • This is a long-reach repair mechanism to

complement ECMP and “downstream” routes.

  • Works by tunnelling the packet to a router in the

network, which is reachable by the repairer, and which has a natural route to the destination that avoids the failure.

  • Simplified computation by using other side of the

failure as a proxy for the packet destination.

slide-5
SLIDE 5

5 Tunnel based FRR IETF-60

Basic Operation

Link or Node Failure A B P Q Pspace Qspace Tunnel Max 1 hop if metrics symmetric SPF from A with all destinations reached via the failure excised Reverse SPF from B with all Nodes that reach B via the failure excised

If link failure A & B adjacent, otherwise compute Qspace for each of B’s neighbors reachable via AB

First hop directed forwarding from A can extend Pspace (i.e. we use the Pspace

  • f a neighbour)
slide-6
SLIDE 6

6 Tunnel based FRR IETF-60

Interference

D A B C H E G F 3 4

  • A node repair problem that SOMETIMES arises due to the packet

getting sucked back towards the failed node.

  • Solved by concatenating repair paths using a selected neighbour (F) as an

intermediary.

  • A encaps to F, repairs to F, F decaps and repairs as normal.
  • MAY need to repeat this secondary repair process to another neighbour.
slide-7
SLIDE 7

7 Tunnel based FRR IETF-60

Multi-homed Prefixes

  • A very similar problem to interference in

which nodes unaware of the failure “suck” the packet back to the failed node.

  • Only affects node protection
  • Solution is to encapsulate packet to

alternate router with reachability to the prefix, and then repairing to that router.

slide-8
SLIDE 8

8 Tunnel based FRR IETF-60

Loop-free via delayed FIB update

Link or Node Failure B P Q A 1 2 3 Order of change of FIB for loop-free convergence Each node computes Its own order of transition by computing a reverse SPF as if it were rooted at B

slide-9
SLIDE 9

9 Tunnel based FRR IETF-60

Data-plane modifications

  • Rapid detection mechanism and routing to alternative next-

hop is common to all FRR solutions.

  • To cover all pathological case may need three layers of

tunnel encapsulation and one directed forwarding operation:

–Encapsulate to MHP –Encapsulate to secondary repair –Encapsulate to P

  • Any tunnelling mechanism may be used: IP-IP, GRE, L2TPv3
  • The only nodes needing modification are the encapsulating
  • routers. Tunnel decapsulation is a “standard” mechanism.
slide-10
SLIDE 10

10 10 10 Tunnel based FRR IETF-60

Control Plane Modifications

  • New sub-TLV to flood FRR parameters

Router FRR capable Link protected DF vector

  • IPFRR routers must calculate repair strategy.
  • For traffic for which node is single point of failure, repairing

router must do node-link discrimination check.

  • Loop-free convergence requires additional calculation and

controlled execution of FIB updates.

slide-11
SLIDE 11

11 11 11 Tunnel based FRR IETF-60

Dataplane complexity

Tunnel encapsulation, particularly the need to apply nested tunnels in sequence due to the need to fixup length and checksum

slide-12
SLIDE 12

12 12 12 Tunnel based FRR IETF-60

Control Plane Complexity – Link Protection

  • Symmetric costs

For each protected link, each node prunes the existing SPF and calculates 1 reverse SPF

  • Asymmetric costs

As above, plus up to k-1 SPF to extend Pspace if needed

Note – SPFs can terminate as soon as repair is found.

slide-13
SLIDE 13

13 13 13 Tunnel based FRR IETF-60

Control Plane Complexity – Node Protection

  • Symmetric Costs

If secondary repairs not needed, then for each protected neighbour we need 1 SPF prune plus k-1 reverse SPF. For each neighbour taking part in a secondary repair we need one additional SPF.

  • Asymmetric Costs

As above, plus up to k-1 SPF to extend Pspace if needed

slide-14
SLIDE 14

14 14 14 Tunnel based FRR IETF-60

Loop-free convergence

Several methods – consider ordered FIB update Each node effected by the failure computes 1 reverse SPF (from B), and determines it’s position WRT the horizon Each node must update its FIB within a maximum time. As an optimisation may use signalling to reduce the time needed to converge.

slide-15
SLIDE 15

15 15 15 Tunnel based FRR IETF-60

Comparison with other methods

  • This is a long-range method, capable of finding and using a

repair point some distance from the failure.

  • In symmetric cost networks (and non-pathological asymmetric

cost networks) repair coverage is 100%, and when used with loop-free convergence, post repair packet loss is zero.

  • Following an arbitrary number of failures, the network will

recompute an equally effective repair strategy limited only by an induced single point of failure.

  • Layered tunnelling allows us to overcome pathological

topologies, and to repair multi-homed prefixes.

  • Use of other side of failure as proxy for the destination results

in a significant reduction in repair path computation.

  • Does not require a change to forwarding behaviour of

neighbours (U-turn).

slide-16
SLIDE 16

16 16 16 Tunnel based FRR IETF-60

What we can take from other methods

  • Per-destination strategy may enable us to

use less complex repair strategy to some destinations.

  • IP loose source routing or multi-hop

tunnels (e.g. MPLS) could enhance this solution.

slide-17
SLIDE 17

17 17 17 Tunnel based FRR IETF-60

Coverage In Some Operational Networks

Percentage of links fully protected

70% 75% 80% 85% 90% 95% 100% A B C D E F G H Dow nstream U-turn Tunnels w ithout DF Tunnels WITH DF

slide-18
SLIDE 18

18 18 18 Tunnel based FRR IETF-60

  • Thank You