The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+2 votes

Consider a router is working based on the Distance Vector Routing Algorithm. Consider the five-node network of the following figure.

Assume all nodes building distance from that node to $A$ (number of hops) and after initial set up, suddenly either $A$ goes down or the link between $A$ and $B$ is cut. What are the distance values at routers $B, C, D,$ and $E$ which they will find from node $A$ after $3^{rd}$ exchange?

$(A) B - 3, C - 4, D - 5, E - 4$

$(B) B - 5, C - 4, D - 5, E - 4$

$(C) B - 4, C - 5, D - 4, E - 5$

$(D)$ None

in Computer Networks by Loyal (6.7k points)
edited by | 252 views

This video explains the same question. Have a look if you need.

2 Answers

0 votes
by Active (2.6k points)
0 votes

Option B

In third exchange B value is less than C so it definitely increase it by 1
C=4 remain same
D=4+1=5(D update it's value using neighbor's value)
E=4  remain same because its neighbor's value is 3
by Active (4.1k points)

Related questions

0 votes
1 answer
0 votes
1 answer
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,092 questions
55,322 answers
86,220 users