Professional Documents
Culture Documents
Abdul Qader
Outline
Traditional IP Routing
- Forwarding and routing - Problems with IP routing - Motivations behind MPLS
MPLS routing: Only one router (source) makes the routing decision, Intermediate router make the forwarding decision
IP Routing
Address Prefix I/F 1 1 Address Prefix I/F 0 1
Address Prefix
I/F 0
128.89
171.69
128.89
171.69
128.89
Route Update
0 1 128.89
128.89.25.4 Data
1
128.89.25.4 Data
128.89.25.4 Data
128.89.25.4 Data
171.69
Every router may need full Internet routing, information (may be more than 100,000 routes). Destination-based routing lookup is needed on every hop. Greater the size of routing table time consuming for making routing decisions
Layer 2 devices have no knowledge of Layer 3 routing informationvirtual circuits must be manually established. Layer 2 topology may be different from Layer 3 topology,resulting in suboptimal paths and link use. Even if the two topologies overlap, the hub-and-spoke topologyis usually used because of easier management.
A
S
A
1
Packet 1: Destination A Packet 2: Destination B S computes shortest paths to A and B; finds D as next hop
Solution?
- Try to divert the traffic onto alternate paths
9
A
S
A
1
Increase the cost of link DA from 1 to 4 Traffic is diverted away from node D A new IP hotspot is created!
10
Most traffic goes between large sites A and B, and uses only the primary link.
Destination-based routing does not provide any mechanism for load balancing across unequal paths. Therefore, Policy-based routing can be used to forward packets based on other parameters, but this is not a scalable solution.
11
12
Only edge (source) routers must perform a routing lookup. Core routers switch packets based on simple label lookups and swap labels.
13
Layer 2 devices are IP-aware and run a routing protocol. There is no need to manually establish virtual circuits. MPLS provides a virtual full mesh topology.
14
Traffic can be forwarded based on other parameters (QoS, source, and so on). Load sharing across unequal paths can be achieved.
15
Outline
Traditional IP Routing
- Forwarding and routing - Problems with IP routing - Motivations behind MPLS
MPLS Architecture
17
MPLS Architecture
Router functionality is divided into two major parts: the control plane and the data plane
18
MPLS labels
To avoid IP lookup MPLS packets carry extra information called Label
Label = 20 bits Exp = Experimental, 3 bits S = Bottom of stack, 1bit TTL = Time to live, 8 bits
21
MPLS Labels
MPLS technology is intended to be used anywhere regardless of Layer 1 media and Layer 2 protocol.
MPLS uses a 32-bit label field that is inserted between Layer 2 and Layer 3 headers (framemode MPLS). MPLS over ATM uses the ATM header as the label (cell-mode MPLS).
22
23
24
25
R1 LSR1
LSR4
R2
D
destination
R1
LSR4 LSR1
R2
D
destination
2 - R1 determines the next hop as LSR1 and forwards the packet (Makes a routing as well as a forwarding decision)
27
R1 LSR1
31 D
LSR4
R2
D
destination
3 LSR1 establishes a path to LSR6 and PUSHES a label (Makes a routing as well as a forwarding decision)
28
R1 LSR1
LSR4
R2
D
destination
4 LSR3 just looks at the incoming label LSR3 SWAPS with another label before forwarding
29
R1 LSR1
LSR4
R2
D
destination
5 LSR6 looks at the incoming label LSR6 POPS the label before forwarding to R2
30
How do ingress routers decide not to always take the shortest path?
- Ingress routers use CSPF (constrained shortest path first) instead of SPF
- Examples of constraints:
oDo not use links left with less than 7Mb/s bandwidth oDo not use blue-colored links for this request oUse a path with delay less than 130ms
31
CSPF
What is the mechanism?
- First prune all links not fulfilling constrains - Now find shortest path on the rest of the topology
Requires some reservation mechanism Changing state of the network must also be recorded and propagated
- For example, ingress needs to know how much bandwidth is left on links - The information is propagated by means of routing protocols and their extensions
32
Upstream
Downstream
172.68.10/24
LSR1 Data
LSR2
33
Label advertisement
Always downstream to upstream label advertisement and distribution Upstream Downstream
171.68.32/24
MPLS Data Packet with label 5 travels
LSR2
LSR1
34
Label advertisement
Label advertisement can be downstream unsolicited or downstream on-demand
Upstream
Sends label Without any Request
Downstream 171.68.32/24
LSR1
Upstream
Sends label ONLY after receiving request
LSR1
LSR2
35
Label distribution
Label distribution can be ordered or unordered First we see an example of ordered label distribution
Label
Ingress LSR
Egress LSR
36
?
Label
Destination
LSR1
Label
37
Label operations
Advertisement
- Downstream unsolicited
- Downstream on-demand
Distribution
- Ordered - Unordered
Retention
- Liberal - Conservative
38
Outline
Traditional IP Routing
- Forwarding and routing - Problems with IP routing - Motivations behind MPLS
Traffic Engineering
(Application of CSPF)
40
Why?
- high cost of network assets
- service differentiation
41
Traffic engineering
Recall the IP hotspot problem
The ability to move traffic away from the shortest path calculated by the IGP (such as OSPF) to a less congested path
IP: changing a metric will cause ALL the traffic to divert to the less congested path MPLS: allows explicit routing (using CSPF) and setup of such explicitly computed LSPs
42
43
Signaling mechanisms
RSVP-TE
- Extensions to RSVP for traffic engineering
BGP-4
- Carrying label information in BGP-4
CR-LDP
- A label distribution protocol that distributes labels determined based on constraint based routing
RSVP-TE and CR-LDP both do label distribution and path reservation use any one of them!
45
PATH message is used to establish state and request label assignment R1 transmits a PATH message addressed to R9
46
RESV is used to distribute labels after reserving resources R9 transmits a RESV message, with label=3, to R8
R8 and R4 store outbound label and allocate an inbound label. They also transmits RESV with inbound label to upstream LSR
R1 binds label to forwarding equivalence class (FEC)
47
49
50
Protection LSP
51
References
RFC 2702 Requirements for Traffic Engineering Over MPLS