Simulation and comparison of routing algorithms

1
Simulation and comparison of routing algorithms

• Tarakanov Yaniv
• Wiener Dani

Instructor Banner Ron
2
Agenda

• Overview
• Project goals
• Simulation definition
• Technical stuff
• Simulation results
• Conclusions
• QA

3
overview

• Terminology
• Topology (Directed Graph, Capacity Delay for
  each edge)
• Flow
• Load factor
• Routing algorithms
• Single path Vs. Multi path

4
Routing example

• Flow 10 units from Source to Target.
• Shortest path delay 5.

1
3,10
2,10
5,10
T
S

• Single path routing
• Alpha1
• Multi path routing (D5)
• Alpha0.5
• Multi path routing (D6)
• Alpha 0.3

1,20
5,20
2
5
Project Goals

• Comparison between RMP routing algorithm to
  simplier algorithms (ECMP,OMP).
• Extract the influence of max delay variable on
  load factor in RMP algorithm.

6
Simulation definitions

• Waxman topology
• Random capacity and delay for the edges.
• Range of shortest paths.
• Simplicity assumption - Only one source and one
  target.

7
Technical stuff

• Implementation notes
• All code was written in MATLAB.
• Main function blocks
• Build random Waxmam topology
• Run simulation (ECMP,OMP,RMP).
• Post process the results.

8

• ECMP, OMP was implemented by a recursive
  function.
• RMP was implemented as a linear problem, solved
  by a min_max function in MATLAB.

9

• All simulation results were saved including
• Topology
• Flow
• Max load factor
• Shortest path length

10
Simulation results

• What did we expect?
• RMP slightly better than ECMP/OMP when Dmax is
  exactly shortest path.
• Alpha should be monotony declining as Dmax
  increase.
• Expecting smooth graph.

11

• What did we get?

12
Conclusions

• Pros
• The RMP algorithm has a potential of improving
  the load factor of the flow by at least 30 (most
  likely much greater numbers in complicated
  topologies).
• The complexity of the algorithm can be partially
  controlled by the value of D.
• Cons
• COMPLEXITY currently, this algorithm doesn't
  seem feasible in terms of real time computation
  time.
• In order to use the RMP algorithm, the current
  state of each edge should be known which mean
  there must be a lot of overhead traffic of
  reported status.

13
QA