Download Segment Routing - Technology and Use Cases

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Recursive InterNetwork Architecture (RINA) wikipedia , lookup

Wake-on-LAN wikipedia , lookup

CAN bus wikipedia , lookup

IEEE 802.1aq wikipedia , lookup

Deep packet inspection wikipedia , lookup

Cisco Systems wikipedia , lookup

Routing in delay-tolerant networking wikipedia , lookup

Kademlia wikipedia , lookup

Multiprotocol Label Switching wikipedia , lookup

Transcript
Segment Routing
Clarence Filsfils – [email protected]
Distinguished Engineer
Christian Martin – [email protected]
Sr. Directior, Engineering
© 2010 Cisco and/or its affiliates. All rights reserved.
1
•  Introduction
•  Technology
•  Use Cases
•  Conclusion
© 2010 Cisco and/or its affiliates. All rights reserved.
2
Introduction
© 2010 Cisco and/or its affiliates. All rights reserved.
3
•  Make things easier for operators
– Improve scale, simplify operations
– Minimize introduction complexity/disruption
•  Enhance service offering potential through programmability
•  Leverage the efficient MPLS dataplane that we have today
– Push, swap, pop
– Maintain existing label structure
•  Leverage all the services supported over MPLS
– Explicit routing, FRR, VPNv4/6, VPLS, L2VPN, etc
•  IPv6 dataplane a must, and should share parity with MPLS
© 2010 Cisco and/or its affiliates. All rights reserved.
4
•  Simplicity
–  less protocols to operate
–  less protocol interactions to troubleshoot
–  avoid directed LDP sessions between core routers
–  deliver automated FRR for any topology
•  Scale
–  avoid millions of labels in LDP database
–  avoid millions of TE LSP’s in the network
–  avoid millions of tunnels to configure
© 2010 Cisco and/or its affiliates. All rights reserved.
5
•  Applications must be able to interact with the network
–  cloud based delivery
–  internet of everything
•  Programmatic interfaces and Orchestration
–  Necessary but not sufficient
•  The network must respond to application interaction
–  Rapidly-changing application requirements
–  Virtualization
–  Guaranteed SLA and Network Efficiency
© 2010 Cisco and/or its affiliates. All rights reserved.
6
•  Simple to deploy and operate
–  Leverage MPLS services & hardware
–  straightforward ISIS/OSPF extension to distribute labels
–  LDP/RSVP not required
•  Provide for optimum scalability, resiliency and virtualization
•  SDN enabled
–  simple network, highly programmable
–  highly responsive
© 2010 Cisco and/or its affiliates. All rights reserved.
7
•  Simple ISIS/OSPF extension
•  Welcoming contribution
© 2010 Cisco and/or its affiliates. All rights reserved.
8
Segment Routing
© 2010 Cisco and/or its affiliates. All rights reserved.
9
•  Forwarding state (segment) is established by IGP
–  LDP and RSVP-TE are not required
–  Agnostic to forwarding dataplane: IPv6 or MPLS
•  MPLS Dataplane is leveraged without any modification
–  push, swap and pop: all that we need
–  segment = label
•  Source Routing
–  source encodes path as a label or stack of segments
–  two segments: node or adjacency
© 2010 Cisco and/or its affiliates. All rights reserved.
10
A
B
C
D
Pop
9003
M
N
O
Z
P
65
A packet injected at
node C with label
9003 is forced
through datalink CO
•  C allocates a local label
•  C advertises the adjacency label in ISIS
–  simple sub-TLV extension
•  C is the only node to install the adjacency segment in MPLS dataplane
© 2010 Cisco and/or its affiliates. All rights reserved.
11
9105
9107
9107
9101
9103
9103
9105
9105
9105
B
C
9107
9101
9103
9105
D
9105
A
9107
N
Z
O
9103
P
9105
9103
9105
9105
•  Source routing along any explicit path
–  stack of adjacency labels
•  SR provides for entire path control
© 2010 Cisco and/or its affiliates. All rights reserved.
12
Pop 9003
9001 switches on blue member
Pop 9001
B
C
Pop 9002
Pop 9003
9002 switches on green member
9003 load-balances on any
member of the adj
•  Adjacency segment represents a specific datalink to an
adjacent node
•  Adjacency segment represents a set of datalinks to the
adjacent node
© 2010 Cisco and/or its affiliates. All rights reserved.
13
•  SR requires only 1 label per node in the IGP domain
–  insignificant: < 1% of label space
•  Node SR Range
–  a range of labels allocated to the SR control-plane
–  e.g. [64, 5000]
•  Each node gets one unique label from SR Range
–  Node Z gets label 65
© 2010 Cisco and/or its affiliates. All rights reserved.
14
FEC Z
push 65
swap 65
to 65
swap 65
to 65
A
B
C
pop 65
D
Z
65
A packet injected
anywhere with top
label 65 will reach Z
via shortest-path
•  Z advertises its node segment
–  simple ISIS sub-TLV extension
•  All remote nodes install the node segment to Z in the MPLS dataplane
© 2010 Cisco and/or its affiliates. All rights reserved.
15
Packet
to Z
FEC Z
push 65
swap 65
to 65
swap 65
to 65
A
B
C
pop 65
D
65
65
65
Packet
to Z
Packet
to Z
Packet
to Z
Z
Packet
to Z
65
A packet injected
anywhere with top
label 65 will reach Z
via shortest-path
•  Z advertises its node segment
–  simple ISIS sub-TLV extension
•  All remote nodes install the node segment to Z in the MPLS dataplane
© 2010 Cisco and/or its affiliates. All rights reserved.
16
72
72
9003
9003
9003
65
65
65
Packet to Z Packet to Z Packet to Z
72
A
72
B
C
D
Pop
9003
M
N
O
Z
P
65
65
•  Source Routing
65
Packet to Z
65
Packet to Z Packet to Z
•  Any explicit path can be expressed: ABCOPZ
© 2010 Cisco and/or its affiliates. All rights reserved.
17
72
72
78
78
78
65
65
65
Packet to Z Packet to Z Packet to Z
72
A
72
B
C
D
78
M
N
O
Z
P
65
65
65
Packet to Z
65
Packet to Z Packet to Z
•  Node Segment is at the heart of the proposal
–  ecmp multi-hop shortest-path
–  in most topologies, any path can be expressed as list of node segments
© 2010 Cisco and/or its affiliates. All rights reserved.
18
Nodal segment to C
Nodal segment to C
A
B
C
D
Adj Segment
M
N
O
Z
P
Nodal segment to Z
•  Simple extension
•  Excellent Scale: a node installs N+A FIB entries
–  N node segments and A adjacency segments
© 2010 Cisco and/or its affiliates. All rights reserved.
19
•  IP-based FRR is guaranted in
Backbone
any topology
–  2002, LFA FRR project at Cisco
C1
C2
–  draft-bryant-ipfrr-tunnels-03.txt
•  Directed LFA (DLFA) is
guaranteed when metrics are
symetric
•  No extra computation (RLFA)
•  Simple repair stack
E1
E4
1000
E2
Node segment
to P node
E3
Adj segment
to Q node
–  node segment to P node
–  adjacency segment from P to Q
© 2010 Cisco and/or its affiliates. All rights reserved.
Default metric: 10
20
Use Cases
© 2010 Cisco and/or its affiliates. All rights reserved.
21
A
B
PE2
PE1
M
N
All VPN services ride on the node
segment
to PE2
•  Efficient packet networks leverage ecmp-aware shortest-path!
–  node segment!
•  Simplicity
–  no complex LDP/ISIS synchronization to troubleshoot
–  one less protocol to operate
© 2010 Cisco and/or its affiliates. All rights reserved.
22
•  An SR core router scales much than with RSVP-TE
–  The state is not in the router but in the packet
–  N+A vs N^2
N: # of nodes in the network
A: # of adjacencies per node
© 2010 Cisco and/or its affiliates. All rights reserved.
23
SR avoids state in the core
SR avoids enumerating
RSVP-TE tunnels for each
ECMP paths
•  A sends traffic with [65]
Classic ECMP “a la IP”
•  A sends traffic with [111, 65]
Packet gets attracted in blue plane
and then uses classic ecmp “a la IP”
© 2010 Cisco and/or its affiliates. All rights reserved.
24
•  Tokyo to Brussels
–  data: via US: cheap capacity
–  voip: via russia: low latency
•  CoS-based TE with SR
–  IGP metric set such as
>  Tokyo to Russia: via Russia
>  Tokyo to Brussels: via US
Node segment to Brussels
Node segment to Russia
>  Russia to Brussels: via Europe
–  Anycast segment “Russia” advertised by Russia core routers
•  Tokyo CoS-based policy
–  Data and Brussels: push the node segment to Brussels
–  VoIP and Brussels: push the anycast node to Russia, push Brussels
© 2010 Cisco and/or its affiliates. All rights reserved.
25
9101
B
C
9101
D
9101
9105
9105
A
9107
N
9105
O
P
9103
Z
9107
9103
9105
9101
•  For Traffic Engineering
•  or for OAM
Nanog57, Feb 2013
© 2010 Cisco and/or its affiliates. All rights reserved.
26
65
2G from A to Z please
FULL
65
Link CD is full, I cannot use the
shortest-path 65 straight to Z
•  The network is simple, highly programmable and
responsive to rapid changes
–  The controller abstracts the network topology and traffic matrix
–  Perfect support for centralized optimization efficiency, if required
© 2010 Cisco and/or its affiliates. All rights reserved.
27
Tunnel AZ onto
{66, 68, 65}
66
FULL
68
65
Path ABCOPZ is ok. I account the BW.
Then I steer the traffic on this path
•  The network is simple, highly programmable and
responsive to rapid changes
© 2010 Cisco and/or its affiliates. All rights reserved.
28
•  Each engineered application flow is
mapped on a path
Millions of
Applications
flows
–  millions of paths
–  maintained in the orchestrator,
scaled horizontally
A path is
mapped on a
list of
segments
•  A path is expressed as an ordered list
of segments
•  The network maintains segments
–  thousands of segments
The network
only maintains
segments
No application
state
–  completely independent of application
size/frequency
© 2010 Cisco and/or its affiliates. All rights reserved.
29
Conclusion
© 2010 Cisco and/or its affiliates. All rights reserved.
30
•  Simple to deploy and operate
–  Leverage MPLS services & hardware
–  straightforward ISIS/OSPF extension
•  Provide for optimum scalability, resiliency and virtualization
•  Perfect integration with application
•  EFT and IETF available – test and contribute
© 2010 Cisco and/or its affiliates. All rights reserved.
31