Exit Zen
47
../../exercises/network.rst:363 • ../../exercises/network.rst:365
English
2 via B
0/100 · 7
48
../../exercises/network.rst:363 • ../../exercises/network.rst:367
English
3 via C
0/100 · 7
49
../../exercises/network.rst:363
English
4 via D
0/100 · 7
50
../../exercises/network.rst:364
English
B
0/100 · 1
51
../../exercises/network.rst:364
English
1 via B
0/100 · 7
52
../../exercises/network.rst:364 • ../../exercises/network.rst:366
English
2 via C
0/100 · 7
53
../../exercises/network.rst:364
English
3 via D
0/100 · 7
54
../../exercises/network.rst:365
English
C
0/100 · 1
55
../../exercises/network.rst:365
English
1 via C
0/100 · 7
56
../../exercises/network.rst:365 • ../../exercises/network.rst:367
English
2 via D
0/100 · 7
57
../../exercises/network.rst:366
English
D
0/100 · 1
58
../../exercises/network.rst:366
English
3 via B
0/100 · 7
59
../../exercises/network.rst:366
English
1 via D
0/100 · 7
60
../../exercises/network.rst:367
English
E
0/100 · 1
61
../../exercises/network.rst:367
English
4 via B
0/100 · 7
62
../../exercises/network.rst:367
English
1 via E
0/100 · 7
63
../../exercises/network.rst:370
English
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).
0/4010 · 401
64
../../exercises/network.rst:372
English
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 ?
0/4700 · 470
65
../../exercises/network.rst:374
English
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 ?
0/6380 · 638
66
../../exercises/network.rst:376
English
Consider again the network shown above. After some time, link state routing converges and all routers compute the same routing tables as above.
0/1430 · 143