 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| ä |
Primary
concern: routing
|
|
|
|
ä |
determines
path of packets from source to destination
|
|
(so
that non-adjacent machines can communicate)
|
|
|
|
ä |
implementations
differ as to when path is selected
|
|
|
(static,
dynamic, per packet, per circuit), where
|
|
|
selection
is done (centralized, distributed), and what
|
|
|
information
is used (none, local, adjacent, global)
|
|
|
|
ä |
selection
usually based on some least-cost criterion:
|
|
|
each
link is assigned a cost, cost of path is sum of
|
|
|
costs
of path traversed
|
|
|
| ä |
Routing
algorithms:
|
|
|
|
ä |
Djikstra’s
shortest path algorithm
|
|
|
|
ä |
source
routing
|
|
|
|
ä |
flooding
|
|
|
|
ä |
random
walk
|
|
|
|
ä |
backward
learning
|
|
