the network: mesh
DESCRIPTION
Routing without Flow Control Costas Busch Rensselaer Polytechnic Institute Maurice Herlihy Brown University Roger Wattenhofer Microsoft Research. The network: mesh. Discrete time Bi-directional links At most one packet per link direction. Dynamic Routing:. - PowerPoint PPT PresentationTRANSCRIPT
1
Routing without Flow Control
Costas BuschRensselaer Polytechnic Institute
Maurice HerlihyBrown University
Roger WattenhoferMicrosoft Research
2
n
n
The network: meshnn
• Discrete time• Bi-directional links• At most one packet per link direction
3
Dynamic Routing:Packets are injected continuously
destination
4
A new packet can be injected whenthere is a free link:
A link direction is empty
5
Most dynamic routing algorithmsuse flow control:
Don’t utilize all the free links
Disadvantage: Network is under-utilized
6
Our Routing Algorithm:
•No flow control
•Utilizes all the free links
Advantage: Network is fully-utilized
7
Features of our algorithm:• Dynamic
• Hot potato
• Optimal delivery time:
• Injection time guaranty: )(nO
)(nO
8
Talk Outline The Algorithm
Time AnalysisStabilityFuture Work
9
Hot-Potato Routing:
• Nodes are buffer-less
• Packets are immediately forwarded
10
Conflicts
11
Conflict
Conflicts
12
Deflected
Conflicts
13
Packet states:
Running
Excited
Active
Sleeping
Priorities:
high
low
14
Sleeping packet
destination
Random destination
15
Sleeping packet
Follows a path to destination
destination
16
Sleeping packet
becomes Activewithprobability
n1
n
n
17
Active packet
Follows a greedy path
18
Active packet
Follows a greedy path
19
Active packet
A conflict situation
20
Conflict
Active packet
A conflict situation
21
Deflected
Active packet
A conflict situation
22
Deflected
Active packet
A conflict situation
becomes Excitedwithprobability
n
p 1
23
Excited packet
Follows a one-bend path
24
Excited packet
Follows a one-bend path
becomes Running
25
Running packet
Follows a one-bend path
26
Talk Outline The Algorithm
Time AnalysisStabilityFuture Work
27
Good condition for a column: at most non-sleeping packets with destination in the column
n10
28
Expected delivery time for one packet: n
(when the destination column is in good condition)
29
Initially a packet is sleeping
In expected time stepsbecomes active
n
We will show: An active packet is delivered in expected time steps nO
30
Interrupting a one-bend path
Excited
Time 1
31
Interrupting a one-bend path
Running
Time 2
32
Interrupting a one-bend path
Running
Excited
Time 2
33
Interrupting a one-bend path
Running
Running
Time 3
34
Interrupting a one-bend path
Running
Running
Time 4
conflict
35
Interrupting a one-bend path
Active
Running
Time 5
deflected
36
No interruption probability:
Number of non-sleeping packetswith destinations in same column
mp)1(
Excitement probability
37
No interruption probability:
cp m )1(
n1
n
constant
(when the destination column is in good condition)
38
Probability of success after a deflection:
n
cp 1
Expected number of deflections until success: n
Expected delivery timefor an active packet: nO
39
Talk Outline The Algorithm
Time AnalysisStabilityFuture Work
40
Divide time in time periods:
n6t
Examine the condition of a column
41
Good condition Bad condition
ne1
ne
nm 10 nm 10
1 time period
42
Good condition Bad condition
ne1
ne
nm 10 nne1
nne
nm 10
4n time periods
1 time period
43
Good condition Bad condition
ne1
ne
nm 10 nm 10
1 time period
44
Proof OutlineIn a time period:
•At most new non-sleeping packets are generated with destinations in the column
n2
•At least non-sleeping packets are delivered (if )
n2nm 8
45
Good condition Bad conditionnm 10 nne1
nne
nm 10
4n time periods
46
Proof OutlineIn a time period:
•At most new non-sleeping packets are generated with destinations in the column
n2
•At least non-sleeping packets are delivered
n3
47
•Most of the time, the columns are in good condition
•Each packet is delivered in expected time
Consequences:
n
48
Talk Outline The Algorithm
Time AnalysisStabilityFuture Work
49
•Arbitrary network topologies
•De-randomization:Determistic destinationsNo randomized algorithm
• Small number of packets