Routing%20Algorithms%20and%20Traffic%20Engineering

1
Routing Algorithms and Traffic Engineering

• MPLS and OSPF
• traffic engineering
• minimum delay routing
• linear programming
• non-linear optimization

2
OSPF (Open Shortest Path First)

• link state protocol
• Cisco recommendation - link weight 1/(link
  capacity)
• shortest path computations at each node
• flow equally split on all outgoing links
  belonging to shortest paths

3
MPLS

• flows assigned labels, routing along LSP
• finer granularity for routing
• can allow uneven traffic split
• not tied to any route computation algorithm

4
Traffic Engineering Framework

• knowledge of topology
• traffic matrix
• K set of origin destination flows
• k ?K, dk demand, sk source, tk destination
• optimization criteria
• minimize maximum utilization
• keep utilizations below 60

5
How does one set link weights?
6
Digression linear programming
7
Linear program

• polynomial time solution in n, m

8
Surplus variables
9
Slack variables
10
Free variables
11
Example optimal routes

• topology G (V,E)
• K set of origin destination flows
• k ?K, dk demand, sk source, tk destination
• set of given link weights wij (i,j) ?E
• fraction of flow k going over (i,j) ?E

12
(No Transcript)
13
Example

• decomposes into separate problems per flow k ?K

14
Interpretation

• let be optimal solutions
• if takes values 0 and 1, corresponds to
  shortest paths
• if takes other values, there exist
  multiple shortest paths.

15
Linear Program
?

• x0 is feasible if Ax0 b and x0 gt 0

16
Basic solutions
17
Theorem of LP
18
Dual problem.
Primal
Dual
19
Dual problem properties.

• if x, y feasible, then cTx gt yT b
• if x, y feasible and if cTx yT b, then x
  and y are optimal
• if either problem has finite solution, so does
  other, if either has unbounded solution, so does
  other

20
Complementary slackness.

• Let x and y be feasible solutions. A necessary
  and sufficient condition for them to be optimal
  is that for all i
• xi gt 0 ? yT Ai ci
• xi 0 ? yT Ai lt ci
• Here Ai is i-th column of A

21
Example primal (P-SP)
22
Example dual problem

• introduce dual variables
• dual problem

23
Example dual (D-SP)

• change of variables
• leads to

24
Example

• optimal solution to dual problem
• length
  of shortest path from sk to j
• length of shortest path from sk to tk

25
How does one set link weights for OSPF?
26
Traffic engineering problem minimize maximum
link utilization

• topology G (V,E)
• cij capacity of link (i,j) ? E
• K set of origin destination flows
• k ? K, dk demand, sk source, tk destination
• a maximum link utilization

27
LP formulation
28
LP formulation
29
LP formulation

• can be many solutions with same a
• in case of tie, want solution with short paths
• ? add term
• with small r to cost
• use standard LP algorithms (simplex) to solve
• Q can we find link weights so that solution
  comes from shortest path problem?

30
Duality revisited
Primal
Dual

• free variables in primal ? equality constraints
  in dual

31
Dual formulation

• decision variables
• dual problem

32

• change of variables
• leads to (next slide)

33
Dual formulation
34
Properties of primal-dual solutions

• optimal solution to primal problem
• dual problem
• if
• can think of as shortest path distance
• from sk to j when link weights are
• Therfore solution to TE problem is also solution
  to shortest path problem with

35
Link weight assignment

• works for rich set of cost functions
• example
• where Fij are piecewise linear

36
Issues

• solutions are flow specific - need destination
  specific solutions
• not a big deal, can reformulate to account for
  this
• solutions may not support equal split rule of
  OSPF
• accounting for this yields NP-hard problem
• see heuristics in FT paper
• modify IP routing

37
One approach to overcome the splitting problem

• current routing tables have thousands of routing
  prefixes
• instead of routing each prefix on all equal cost
  paths, selectively assign next hops to (each)
  prefix
• i.e., remove some equal cost next hops assigned
  to prefixes
• goal to approximate optimal link load

38
Example EQUAL-SUBSET-SPLIT
j
Prefixes C D
9
4 5 9
Prefix A 5
3
Prefix B 1
Prefixes A B
i
k
Prefix C 8
2.5 0.5 3
12
Prefix D 10
Prefixes A B C D
Prefix A Hops k,l Prefix B Hops k,l Prefix C
Hops j,l Prefix D Hops j,l
l
2.5 0.5 4 5 12
39
Advantages

• requires no change in data path
• can leverage existing routing protocols
• current routers have 10,000s of routes in routing
  tables
• provides large degree of flexibility in next hop
  allocation to match optimal allocation

40
Performance
41
Summary

• can use OSPF/ISIS to support traffic
  engineering objectives
• performance objectives link weights
• equal splitting rule complicates problem
• heuristics provide good performance
• small changes to IP routing provide in better
  performance
• MPLS suffers none of these problems