Routing and QoS

• Presented by:
Jon Berger
DC-ISIS Development Manager
 Contents
• Credentials
• Background
• Key Problems
• Solutions
• Summary

Slide 2
 Data Connection Ltd (DCL)
• Jon Berger
– DCL for 10 years
– Multiple signaling and routing protocols
– ISIS development manager
• Architect
• Standards involvement
• Customer interaction
– MA from Cambridge
• DCL
– 20+ years in portable protocol software
– Unicast, multicast, MPLS, ATM and VoIP
– Conferencing, messaging, directories
– MetaSwitch
• Very unusual company
– Independent since founding (1981)
– Consistently profitable
– People retention (3% turnover)
Slide 3
 Why expand the scope of TE?
• Intra-area TE is very successful
• Providers see revenue in
– VPNs spanning ASs
– End-to-end MPLS
• Important for
– Standards Bodies
– Equipment Manufacturers
– Carriers
Slide 4
 What is Traffic Engineering?
• Optimizing network performance

• MPLS-TE uses LSPs to direct traffic

through a particular network path

Slide 5
 Why is TE useful?
• QoS guarantees (bandwidth, etc.)
• Optimization of network resources
• Fast recovery
– very fast re-routing around failed paths
• VPNs (through) LSPs

Slide 6
 TE demands on Routing
• Distribution of link characteristics

• Constrained route calculation

– requirements for each LSP may be different
– formation of an LSP changes the topology

Slide 7
Limitations on existing deployments
• Single Area only
• What about?
– Inter-area TE
– Inter-AS TE

Slide 8
 What are the difficulties?
• Area borders for scalability
• Trade off between
– perfect routing
– scalability
• AS borders for confidentiality

Slide 9
 Options
• Full link state available in all areas
• Area by area solutions
– Hierarchical Summary
– BGP Summary
– PCS Summary

Slide 10
 Full link state available in all areas
• For Inter-AS routing this is unacceptable
• For Inter-area routing this may be OK
– small networks
– guarantees optimal routing
– allows setting up of protected paths

Slide 11
 Area by area solutions
• These options are all more scalable
• May not satisfy constraints at first try
• Potentially employ iteration to get there

Slide 12
Full Hierarchical Information Flow
B

A C
D

B1 B2
1
10
C1
16 B3
6 5
1
C3
A1 A2
1
C2
1
15
10
D2
D1

Slide 13
 Use BGP to provide summary information

Carrier Carrier
Carrier A1 B1 Network B2 C1
Network
Network
B C
A
C2

D1 Carrier D2
Netw ork
D

• No link state information across boundaries

– Potentially poor quality routing

Slide 14
 Path Computation Server
• Used by other nodes to do the route calculation
• Discovered dynamically or statically configured
• Required for some solutions
• Useful even if not necessary

Slide 15
Use PCSs to get across each area/AS

PCS PCS
Carrier Carrier
Carrier A1 B1 B2 C1
Network Network
Network
B C
A
C2

PCS
D1 Carrier D2
Network
D

• More information is available

– Better than BGP

Slide 16
 Summary
• This is important
• It will generate SP revenue
• It is difficult
• Many options are being pursued

Slide 17
 For more information
– www.dataconnection.com
– www.dataconnection.com/products/whitepapers.htm
– Several internet drafts in this area
• draft-ietf-tewg-interarea-mpls-te-req
• draft-ietf-tewg-interas-mpls-te-req
• draft-ietf-kompella-mpls-multiarea-te
• draft-vasseur-ccamp-inter-area-as-te
– Also ITU work on optical TE
• G.7715

Slide 18