|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
n |
Same
topology as before,
|
|
|
numbers
along edges indicate
|
|
|
available
bandwidth
|
|
n |
OLSR:
node B will select C as
|
|
|
its
MPR
|
|
n |
So
all the other nodes know that
|
|
they
can reach B via C
|
|
n |
When
D is building its routing
|
|
|
table,
for destination B, it will
|
|
|
select
the route D-C-B, whose
|
|
|
bottleneck
bandwidth is 3, the
|
|
|
worst
among all the possible
|
|
|
routes
|
|
n |
Optimal
route (i.e., path with
|
|
|
maximum
bottleneck
|
|
|
bandwidth:
D-F-B (bottleneck
|
|
|
bandwidth
of 10)
|
|