Optimum Implementation of TI-LFA and Segment Routing on SURFnet 8
RP #22 Peter Prjevara & Fouad Makioui Supervisors: Marijke Kaat & Wouter Huisman
Optimum Implementation of TI-LFA and Segment Routing on SURFnet 8 - - PowerPoint PPT Presentation
Optimum Implementation of TI-LFA and Segment Routing on SURFnet 8 RP #22 Peter Prjevara & Fouad Makioui Supervisors: Marijke Kaat & Wouter Huisman The Goals of Networks ARPANET - 1974 2 https://en.wikipedia.org/wiki/ARPANET What
Optimum Implementation of TI-LFA and Segment Routing on SURFnet 8
RP #22 Peter Prjevara & Fouad Makioui Supervisors: Marijke Kaat & Wouter Huisman
The Goals of Networks
ARPANET - 1974
2
https://en.wikipedia.org/wiki/ARPANET
What IGPs Currently Offer?
○ If effects BGP -> can take up to 3 minutes
○ Fault Recognition ○ Information Flooding
3 Source: T Anji Kumar and MHM Prasad. Enhanced multiple routing configurations for fast ip network recovery from multiple failures.
The Goals of Networks Today
○ VoIP / Video ○ Cloud Software ○ Financial Trading ○ Experimental
Where might virtual reality lead us?
David Ramos/Getty Images
Not good enough
4
Network in a Normal State
5
Failure Occurs
6
The Reactive Approach: Step 1
7
The Reactive Approach: Step 2
8
Segment Routing (or SPRING)
○ Node ID
○ Adjacency ID
9
Protective Fast Reroute Solutions
rLFA TI-LFA
5 6 5 5 5 5 100
10
Point of Local Repair (PLR) Juniper Networks, 2017. Juniper Tech Library - Fast Reroute Overview.
Feature Link / Node Protection
11
Link Protection
12
Node Protection
13
Link / Node Protection Summary
14
Fate Sharing
15
16
SURFnet8 Topology
○ Line card sharing ○ Optical path sharing
○ TI-LFA ○ SPRING ○ Node Protection ○ Fate Sharing
17
18
Line card sharing
Optical cable sharing
Research Questions
implementing Node / Link Protection and Fate Sharing?
line card or optical layer?
19
Methodology
○ Understand novel concepts
○ Create topology
20
Our Test Topology
21
Our Test Topology
22
Our Test Topology
23
Our Test Topology
24
Experiment Sub Experiment Baseline SR Without TI-LFA With TI-LFA Baseline SR with extra hop Without TI-LFA With TI-LFA Multiple link failures with source as PLR With a single backup path With equal cost multi paths With fate sharing Link/Node Protection Observe the routing table on PLR ECMP Metric Calculation Python Script Simulation / Paper analysis
List of Experiments
25
Baseline SR
26
Baseline SR with Extra Hop
27
Results
28
Multiple Link Failures 1
29
Multiple Link Failures 2
30
Multiple Link Failures 3
31
Multiple Link Failures 4
32
Multiple Backup Paths
Route output
145.125.124.6/32 (2 entries, 1 announced) *L-ISIS Preference: 14 Next hop: 145.125.176.59 via ge-2/3/0.0 weight 0x1, selected Next hop: 145.125.176.18 via xe-2/0/2.0 weight 0xf000 Next hop: 145.125.176.0 via et-1/1/0.0 weight 0xf000
○ Equal Cost Multi Path (ECMP)
33
Experiment: Fate Sharing
34
Results
35
Multiple Broken Links
36
Average ~500ms
Multiple Broken Links
37
Average ~500ms
Multiple ECMPs
38
Average ~52ms
Fate Sharing Enabled
39
Average ~30ms
Link | Node Protection
Link protection
145.125.124.6/32 (2 entries, 1 announced) *L-ISIS Preference: 14 Next hop: 145.125.176.59 via ge-2/3/0.0 weight 0x1, selected Next hop: 145.125.176.18 via xe-2/0/2.0 weight 0xf000 Next hop: 145.125.176.0 via et-1/1/0.0 weight 0xf000
Node protection
145.125.124.6/32 (2 entries, 1 announced) *L-ISIS Preference: 14 Next hop: 145.125.176.59 via ge-2/3/0.0 weight 0x1, selected Next hop: 145.125.176.61 via ge-2/3/1.0 weight 0xf000 Age: 51 Metric: 25 40
41
42
43
Discussion
implemented on SURFnet8
convergence backup path
44
Recommendations
○ Default metric on the daisy chain (default 10) ○ Increase number of ECMPs
45
Future Work
○ Bidirectional Forwarding Detection (1 - 10ms)
○ Currently not implemented yet
46
Acknowledgements
○ Marijke Kaat and Wouter Huisman ○ SURFnet Team
47
48