Routing Without Flow Control Hot-Potato Routing Simulation

1
Routing Without Flow ControlHot-Potato
RoutingSimulation
Project

• by Larry Bush

2
MotivationPaper Summary
3
Overview

• Concepts
• How Algorithm Works
• Demonstration
• Results

4
Algorithm Concepts

• Flow Control
• Hot Potato Routing
• Greedy
• Dynamic

5
Topology

• NN Torus Network

6
(No Transcript)
7
(No Transcript)
8
The Algorithm

• Good-Link / Bad-Link
• Home-Run Path
• 4 priority states
• Sleeping Lowest Priority
• Active
• Excited
• Running Highest Priority

9
State Change Rules

• Sleeping
• Active
• Excited
• Running

10
Active PacketDemo
11
(No Transcript)
12
(No Transcript)
13
(No Transcript)
14
(No Transcript)
15
(No Transcript)
16
(No Transcript)
17
(No Transcript)
18
(No Transcript)
19
(No Transcript)
20
(No Transcript)
21
(No Transcript)
22
(No Transcript)
23
(No Transcript)
24
(No Transcript)
25
(No Transcript)
26
(No Transcript)
27
(No Transcript)
28
(No Transcript)
29
(No Transcript)
30
Running PacketDemo
31
(No Transcript)
32
(No Transcript)
33
(No Transcript)
34
(No Transcript)
35
(No Transcript)
36
(No Transcript)
37
(No Transcript)
38
(No Transcript)
39
(No Transcript)
40
(No Transcript)
41
(No Transcript)
42
(No Transcript)
43
(No Transcript)
44
(No Transcript)
45
(No Transcript)
46
(No Transcript)
47
(No Transcript)
48
(No Transcript)
49
(No Transcript)
50
(No Transcript)
51
Conflicts

• Both Packets
• Conflicts

52
(No Transcript)
53
(No Transcript)
54
(No Transcript)
55
(No Transcript)
56
(No Transcript)
57
(No Transcript)
58
(No Transcript)
59
(No Transcript)
60
(No Transcript)
61
(No Transcript)
62
(No Transcript)
63
(No Transcript)
64
(No Transcript)
65
(No Transcript)
66
(No Transcript)
67
(No Transcript)
68
(No Transcript)
69
(No Transcript)
70
(No Transcript)
71
(No Transcript)
72
(No Transcript)
73
(No Transcript)
74
(No Transcript)
75
(No Transcript)
76
(No Transcript)
77
(No Transcript)
78
Demo

• Both Packets
• Plus Other Sleeping Packets

79
(No Transcript)
80
(No Transcript)
81
(No Transcript)
82
(No Transcript)
83
(No Transcript)
84
(No Transcript)
85
(No Transcript)
86
(No Transcript)
87
(No Transcript)
88
(No Transcript)
89
(No Transcript)
90
(No Transcript)
91
(No Transcript)
92
(No Transcript)
93
(No Transcript)
94
(No Transcript)
95
(No Transcript)
96
(No Transcript)
97
(No Transcript)
98
(No Transcript)
99
(No Transcript)
100
(No Transcript)
101
(No Transcript)
102
(No Transcript)
103
(No Transcript)
104
(No Transcript)
105
Guarantees

• O(N) Delivery Time
• O(N) Injection Time

106
(No Transcript)
107
(No Transcript)
108
(No Transcript)
109
(No Transcript)
110
Conclusion

• Algorithm behaved as expected.
• ROSS Speed-up is Good.

111
Take Aways

• Difficult to analyze theoretically.
• Simulation is a good tool for this type of
  problem.
• ROSS is a good tool for this type of simulation.

112
End
113
Questions/Facts
114
Theoretical Model vs. Practical Model

• Theoretical
• Does not Absorb Sleeping Packets
• Practical
• Absorbs Sleeping Packets

115
Outline (notes)

• Introduction to the problem
• Project scope.
• Motivation.
• Utilized all free links.
• Paper Overview.
• Define concepts in model.
• Define model.
• Destinations chosen randomly
• Demonstrate model.
• Results
• Model results.
• Explain Graphs
• Delivery Time (Theoretical Model / Practical
  Model)
• Injection Time (Theoretical Model / Practical
  Model)
• Summarize Results
• ROSS performance
• Speed-up (Parallel vs. Sequential)
• Event Rate

116
Graphs / Results

• Results
• Model results.
• Explain Graphs
• Delivery Time
• Injection Time
• ROSS performance
• Speed-up (Parallel vs. Sequential)
• Event Rate

117
Project Scope - Sim Analyzed - Algo. In
Costas PaperPaper Overview - New version of
HPR. - Proved Theoretically. - Dynamic vs.
StaticMotivation - Utilized all free links. -
Difficult to analyze theoretically. Simulation
is a better tool for this type of problem.
118
Network Concepts

• Synchronous
• Buffer-less
• Model of Optical
• Switching Network