 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
– |
claimed
properties of the DSDV protocol:
|
|
|
|
n |
loop-free
at all instants
|
|
|
|
n |
dynamic,
multi-hop, self-starting
|
|
|
|
n |
low
memory requirements
|
|
|
|
n |
quick
convergence via triggered updates
|
|
|
|
n |
routes
available for all destinations
|
|
|
|
n |
fast
processing time
|
|
|
|
n |
reasonable
network load
|
|
|
|
n |
minimal
route trashing
|
|
|
|
n |
intended
for operation with 100 mobile nodes, depending on
|
|
“mobility
factor”
|
|