Professional Documents
Culture Documents
Sept 2000 M10 Sept 2000 M5 Nov 1999 M20 Mar 2000 M160
MCI Worldcom vBNS/vBNS+ Department of Energy ESnet DANTE - TEN-155 (Pan-European Research & Education Backbone) NYSERNet New York State Education & Research Network Georgia Tech SOX GigaPoP
University of Washington Pacific/Northwest GigaPoP STAR TAP (International Research & Education Network Meet Point) APAN (Asia Pacific Advanced Network) Consortium NOAA (National Oceanographic and Atmospheric Administration) NASA Goddard Space Flight Center
NIH (National Institutes of Health) DoD (Department of Defense) US Army Engineer Research and Development Center
3
Original Agenda
MPLS Fundamentals Traffic Engineering Constraint-Based Routing Refreshment Break Virtual Private Networks
Our Agenda
A bunch of pure marketing slides A bunch of filler slides Slides with content that is of interest mainly to ISPs
Here is how you can use MPLS to bring in more revenue,
What Is MPLS?
IETF Working Group chartered in spring 1997 IETF solution to support multi-layer switching:
IP Switching (Ipsilon/Nokia)
Objectives
Enhance performance and scalability of IP routing
Facilitate explicit routing and traffic engineering Separate control (routing) from the forwarding mechanism
MPLS Terminology
Label
Short, fixed-length packet identifier Unstructured Link local significance
in the same manner to the same label based on destination IP address prefix
MPLS Terminology
Connection Table
IP 25
Port 1
Port 2
Swap
Swap
Swap Swap
Port 3
Port 4
Label Swapping
Connection table maintains mappings Exact match lookup Input (port, label) determines: Label operation Output (port, label) Same forwarding algorithm used in Frame Relay and ATM
11
MPLS Terminology
LSP
MPLS Terminology
LSR LSR San Francisco New York LSR LSR
LSP
13
MPLS Terminology
Egress LSR
Ingress LSR San Francisco Transit LSR New York Transit LSR
LSP
Transit LSR
Forwards MPLS packets using label swapping
MPLS Header
Label (20-bits) CoS S TTL
L2 Header
MPLS Header
32-bits
IP Packet
Fields
Label Experimental (CoS) Stacking bit Time to live
15
134.5.1.5
2
200.3.2.7
200.3.2.7 12.29.31.4
3
12.29.31.5 200.3.2.7
5
12.29.31.9 200.3.2.7
200.3.2/24 12.29.31.5
Routing Table
Destination 134.5/16 Next Hop 12.29.31.5
Routing Table
Destination 134.5/16 Next Hop 12.29.31.5
200.3.2.1
200.3.2.7
200.3.2/24 12.29.31.9
200.3.2/24 12.29.31.4 16
134.5.6.1
(2, 84)
(6, 0)
2
200.3.2.7
3
Ingress Routing Table
Destination 134.5/16 200.3.2/24 Next Hop (2, 84) (3, 99)
5
200.3.2.7
MPLS Table
In Out
MPLS Table
In Out
200.3.2.1 200.3.2.7
(1, 99)
(2, 56)
(3, 56)
(5, 0)
17
E-BGP peers
AS 77 Transit SP
E-BGP peers
BGP
134.5/16 LSP 32
Map LSP to the BGP next hop FEC = {all BGP destinations reachable via egress LSR}
18
Egress LSR
Ingress LSR
LSP
Two
approaches:
Manual Configuration
Using a Signaling Protocol
19
The IETF MPLS architecture does not assume a single label distribution protocol LDP
Executes hop-by-hop Selects same physical path as IGP Does not support traffic engineering
RSVP
Easily extensible for explicit routes and label distribution
Deployed by providers in production networks
CR-LDP
Extends LDP to support explicit routes
Ingress LSR
LSP
Two approaches:
Offline path calculation (in house or 3rd party tools)
Online path calculation (constraint-based routing)
Simultaneously considers
All link resource constraints All ingress to egress
traffic trunks
Benefits
Similar to mechanisms used
in overlay networks Global resource optimization Predictable LSP placement Stability Decision support system
Egress LSR
Ingress LSR
Output:
Set of physical paths, each expressed
as an explicit route
23
Egress LSR
Ingress LSR
R8 R3 R5
Egress LSR
Ingress LSR
R8 R3 R5
R7 to R9 directly connected
25
Constraint-Based Routing
Egress LSR Ingress LSR
Online LSP path calculation Operator configures LSP constraints at ingress LSR
Bandwidth reservation
Include or exclude a specific link(s) Include specific node traversal(s)
Network actively participates in selecting an LSP path that meets the constraints
26
Constraint-Based Routing
Silver
San Francisco
Bronze
Gold
27
Constraint-Based Routing
Choose
28
Constraint-Based Routing
G I
A D
1
C
6
2
F H
29
Chicago
San Francisco
Kansas City Los Angeles Atlanta
New York
Dallas
30
Madrid
Rome
31 31
LSPs
Reroute
Label
Stacking
GMPLS
32
to ingress LSR Calculate & signal new LSP Reroute traffic to new LSP
33
Ingress signals fast reroute during LSP setup Each LSR computes a detour path (with same constraints) Supports failover in ~100s of ms
34
1 3 5
Label (20-bits)
CoS S
TTL
A label stack is an ordered set of labels Each LSR processes the top label Applications
Routing hierarchy Aggregate individual LSPs into a trunk LSP
VPNs
35
1 3
2 5
MPLS Table
In (1, 25) (3, 35) Out (2, Push [42]) (2, Push [42])
MPLS Table
In (5, 42) Out (6, 18)
MPLS Table
In (2, 18) Out (5, Pop)
MPLS Table
In (4, 25) (4, 35) Out (2, 56) (5, 17)
36
1 3
2 5
MPLS Table
In (1, 25) (3, 35) Out (2, Push [42]) (2, Push [42])
MPLS Table
In (5, 42) Out (6, 18)
MPLS Table
In (2, 18) Out (5, Pop)
MPLS Table
In (4, 25) (4, 35) Out (2, 56) (5, 17)
37
LSP Trunk
LSP 3
LSP 3
LSP 4
LSP 4
Reduce complexity Reduce cost Router subsumes functions performed by other layers
Fast router interfaces eliminate the need for MUXs MPLS replaces ATM/FR for traffic engineering MPLS fast reroute obviates SONET APS restoration
Dynamic provisioning of optical bandwidth is required for growth and innovative service creation
39
LSC Cloud
TDM Cloud
PSC Cloud
Bundle
Time-slot LSPs
l LSPs
Fiber LSPs
l LSPs
Nesting LSPs enhances system scalability LSPs always start and terminate on similar interface types LSP interface hierarchy
Packet Switch Capable (PSC)
Lowest Time Division Multiplexing Capable (TDM) Lambda Switch Capable (LSC) Fiber Switch Capable (FSC) Highest
40
AGENDA
41
Layer 3 Routing
Traffic Engineering
42
Brief History
Early
1990s
links between routers Only a handful of routers and links to manage and configure Humans could do the work manually Metric-based traffic control was sufficient
43
A
1
44
A
1
45
46
Discomfort Grows
Mid
1990s
Internet core Large growth spurt imminent Routers too slow Metric engineering too complex IGP routing calculation was topology driven, not traffic driven Router based cores lacked predictability
47
Full traffic control Per-circuit statistics More balanced flow of traffic across links
48
Overlay Networks
ATM
Logical View
A C B
49
Denver
Seattle
Perryman, MD
San Francisco
Washington DC
Atlanta
Boston
Cleveland A C
C
C
C MFS NAP
Washington, DC
C Atlanta
A
C J
DS-3
C
OC-3C OC-12C
Houston
FORE ASX-1000
NAP
OC-48
51
Growth in full mesh of ATM PVCs stresses everything Router IGP runs out of steam Practical limitation of updating configurations in each switch and router ATM 20% Cell Tax ATM SAR speed limitations OC-48 SAR very difficult/expensive to build OC-192 SAR?
52
caught up
Current generation of routers have High speed, wire-rate interfaces Deterministic performance Software advances
MPLS
came along
performance routing engines Uses low-overhead circuit mechanism Automates path selection and configuration Implements quick failure recovery
53
AGENDA
55
Branch office
Mobile users and telecommuters Suppliers, partners and customers
Extranet
Network
DLCI
FR switch
FR switch
CPE
CPE
FR switch
DLCI
FR switch
CPE
FR switch
DLCI
FR switch
CPE
CPE
PVCs overlay the shared infrastructure (ATM/Frame Relay) Routing occurs at CPE Mature technologies Inherently secure Service commitments (bandwidth, availability, etc.)
Limitations
Scalability and management of the overlay model Not a fully integrated IP solution
57
Site 2
Site 2
Site 3
Site 1
Benefits
Seamlessly integrates multiple networks Permits a single connection to the service provider Supports rapid delivery of new services Minimizes operational expenses Provides higher network reliability and availability
58
Layer
CCC
2 VPNs
Layer3
VPNs
RFC 2547bis
59
L2TP tunnel
PPP dial-up
Dial access server
Application: Dial access for remote users Layer 2 Tunneling Protocol (L2TP) Point-to-Point Tunneling Protocol (PPTP) Both support IPSec for encryption Authentication & encryption at tunnel endpoints
60
61
CPE
62
LSPs
LSP 2
LSP 5
LSP 6
PE
PE
DLCI 506
CPE
ATM (or Frame Relay)
(MPLS core)
In
CCC Function
Benefits
Reduces provider configuration complexity
MPLS traffic engineered core Subscriber can run any Layer 3 protocol User Nets do not know there is a cloud in the middle
Limitations
Circuit type (ATM/FR) must be like to like
63
M40
University X ATM Access Abilene Traffic: ATM VC2 mapped to port facing Abilene
An M20/40/160 can both terminate ATM PVCs (layer 3 lookup) and support CCC pass-through on the same port.
64
vBNS used CCC and MPLS to tunnel IPv6 across their backbone for SC2000
CCC
vBNS/vBNS+ IPv4
CCC
Chicago
SC2000 in Dallas ATM
IPv6
ATM
IPv6
65
Site 1
CPE
PE
CPE
FT FT
Site 3
CPE
Site 2
CPE
P P P
Site 2
CPE
FT
Site 3
FT FT
Site 1
PE
PE
MPLS (Multiprotocol Label Switching) is used for forwarding packets over the backbone BGP (Border Gateway Protocol) is used for distributing routes over the backbone Multiple Forwarding Tables (FT) on some edge routers, one for each VPN
66
Questions?
67
Thank You
jjamison@juniper.net
http://www.juniper.net
68