|
0
|
|
1 via A
|
|
1 via B
|
|
1 via C
|
|
1 via D
|
|
1 via E
|
|
2 via B
|
|
2 via C
|
|
2 via D
|
|
3 via B
|
|
3 via C
|
|
3 via D
|
|
4 via B
|
|
4 via D
|
|
A
|
|
After each update of a forwarding table, verify which pairs of routers are able to exchange packets. Provide your answer using a table similar to the one shown above.
|
|
An important difference between OSPF and RIP is that OSPF routers flood link state packets that allow the other routers to recompute their own routing tables while RIP routers exchange distance vectors. Consider that link `B-C` fails and that router `B` is the first to detect the failure. At this point, `B` cannot reach anymore `C`, `D` and `E`. `C` cannot reach `B` and `A` anymore.
|
|
Are these paths possible with link-state or distance vector routing ? If so, how do you configure the link weights? If not, explain your answer.
|
|
Assume that the routers located in `Denver` and `Kansas City` need to exchange lots of packets. Can you configure the link metrics such that the link between these two routers does not carry any packet sent by another router in the network ?
|
|
Assuming that the network uses source routing, what are the possible paths from `R1` to `R4` ?
|
