| Network
exploration by flooding & random walks |
|
|
|
|
|
|
| q | Flooding is exhaustive for all neighbors up to a distance d
or |
||||
| time to live (TTL); |
|||||
| Parallel search; large amount of
messages spread in all directions |
|||||
| q | Random walks follow some probabilistic
winding route |
||||