|
At this point, a new link is added between `R1` and `R3`. What happens for the forwarding of packets ?
|
|
B
|
|
Building a network
|
|
C
|
|
Consider a distance vector protocol using split horizon and `periodic updates`. Assume that the link `B-C` fails. `B` and `C` update their local routing table but they will only advertise it at the end of their period. Select one ordering for the `periodic updates` and every time a router sends its distance vector, indicate the vector sent to each neighbor and update the table above. How many periods are required to allow the network to converge to a stable state ?
|
|
Consider again the network shown above. After some time, link state routing converges and all routers compute the same routing tables as above.
|
|
Consider the network shown in the figure below.
|
|
Consider the same distance vector protocol, but now with `triggered updates`. When link `B-C` fails, assume that `B` updates its routing table immediately and sends its distance vector to `A` and `D`. Assume that both `A` and `D` process the received distance vector and that `A` sends its own distance vector, ... Indicate all the distance vectors that are exchanged and update the table above each time a distance vector is sent by a router (and received by other routers) until all routers have learned a new route to each destination. How many distance vector messages must be exchanged until the network converges to a stable state ?
|
|
D
|
|
Destination
|
|
Discussion questions
|
|
Distance vector protocols can operate in two different modes : `periodic updates` and `triggered updates`. `Periodic updates` is the default mode for a distance vector protocol. For example, each router could advertise its distance vector every thirty seconds. With the `triggered updates` a router sends its distance vector when its routing table changes (and periodically when there are no changes).
|
|
E
|
|
Host `A` uses a different flat address on each of its links
|
|
Host `A` uses the same flat address for both links.
|
|
If you compute the routing tables of all routers in this network, you would obtain a table such as the table below :
|
|
In the five nodes network shown above, can you configure the link weights so that the packets sent by router `R5` (resp. `R4`) follow the `R5->R3->R1` path (resp. `R4->R2->R3->R1`) ?
|
|
In the five nodes network shown below, can you configure the link metrics so that the packets sent by router `R5` to router `R1` use link `R3->R1` while the packets sent by router `R3` use links `R3->R2` and `R2->R1`?
|
|
In this network, assume that all the link weights are set to 1. What is the paths followed by a packet sent by the router located in `Los Angeles` to reach :
|
|
In your daily life, you also use hierarchical and flat address spaces. Can you provide examples of these two types of addresses and discuss the benefits of using a hierarchical or flat addressing space in their particular context ?
|
