- task_id
networkrouting
dv1
Consider the network represented in the figure below. Assume that the network is using a distance vector protocol as its routing protocol. When the network boots, which of the following distance vectors correspond to the first vector that each router sends ? We assume that the link weights are configured on the routers as shown in the figure. We consider a basic version of distance routing without split horizon and without poisoning. What are all the correct distance vectors among the choices below ?
tikzstyle{arrow} = [thick,->,>=stealth] tikzset{router/.style = {rectangle, draw, text centered,minimum height=2em}, } tikzset{host/.style = {circle, draw, text centered, minimum height=2em}, } tikzset{ftable/.style={rectangle, dashed, draw} } node[router] (R1) { R1 }; node[router,right=of R1] (R2) {R2}; node[router,below=of R1] (R3) {R3}; node[router,below=of R2] (R4) {R4}; path[draw,thick] (R3) edge node [midway,fill=white] {em{3}} (R2) (R1) edge (R2) (R1) edge (R3) (R2) edge (R4);
Router R1 sends [ R1=0, R2=1, R3=1]
When a distance vector router boots, it only knows itself at a distance of 0.
Router R2 sends [ R2=0, R1=1, R3=3, R4=1]
When a distance vector router boots, it only knows itself at a distance of 0.
Router R3 sends [ R3=0, R1=1, R2=3]
When a distance vector router boots, it only knows itself at a distance of 0.
Router R4 sends [ R4=0, R2=1, R3=3, R4=1]
When a distance vector router boots, it only knows itself at a distance of 0.
Router R4 sends [ R4=0 ]
Router R3 sends [ R3=0 ]
Router R2 sends [ R2=0 ]
Router R1 sends [ R1=0 ]
dv2
- Consider the same network as in the previous question. The network has been running for several hours. Among the following answers, what are the distance vectors that are produced by the routers at that time ?
Router R1 sends [ R1=0, R2=1, R3=1]
A router always sends a summary of its routing table. After several hours, R1 already knows how to reach R4.
Router R2 sends [ R2=0, R1=1, R3=2, R4=1]
Router R3 sends [ R3=0, R1=1, R2=3]
A router always sends a summary of its routing table. After several hours, R3 already knows how to reach R4.
Router R4 sends [ R4=0, R2=1, R3=3, R1=2]
Router R4 sends [ R4=0 ]
A router always sends a summary of its entire routing table. This is not the case here.
Router R3 sends [ R3=0 ]
A router always sends a summary of its entire routing table. This is not the case here.
Router R2 sends [ R2=0 ]
A router always sends a summary of its entire routing table. This is not the case here.
Router R1 sends [ R1=0 ]
A router always sends a summary of its entire routing table. This is not the case here.
ls1
Consider the network shown in the figure below.
tikzstyle{arrow} = [thick,->,>=stealth] tikzset{router/.style = {rectangle, draw, text centered, minimum height=2em}, } tikzset{host/.style = {circle, draw, text centered, minimum height=2em}, } tikzset{ftable/.style={rectangle, dashed, draw} } node[router] (R1) { R1 }; node[router,right=of R1] (R2) {R2}; node[router,below=of R1] (R3) {R3}; node[router,above=of R2] (R4) {R4}; path[draw,thick] (R3) edge node [midway,fill=white] {em{3}} (R2) (R1) edge (R2) (R1) edge (R3) (R2) edge (R4) (R4) edge (R1);
Among the link state packets shown below, which corresponds to link state packets that could be transmitted by the nodes of this network ? Select all the valid answers.
Router R1 sends LSP : R1-0 [R2:1] [R3:1] [R4:1]
Router R2 sends LSP : R2-0 [R1:1] [R3:3] [R4:1]
Router R3 sends LSP : R3-0 [R1:1] [R2:3]
Router R4 sends LSP : R4-0 [R1:1] [R2:1]
Router R3 sends LSP : R3-0 [R1:1] [R2:3] [R4:3]
The link state packet contains the information about the direct neighbours of a network node. R3 is not directly attached to R4.
Router R4 sends LSP : R4-0 [R1:1] [R2:1] [R3:3]
The link state packet contains the information about the direct neighbours of a network node. R4 is not directly attached to R3.