510 views
9 9 votes

A network contains $6$ routers P1 to P6 interconnected with the following link costs:

 

 

Routers exchange information using a distance vector algorithm.

Once routing stabilises, some links do not appear in the forwarding tables.

All such unused link costs are now changed to $1$, and the routing algorithm is executed again until stabilisation.

After reconvergence, how many links still remain unused?

2 Answers

3 3 votes

P1-P2:

direct 4 vs via P1-P3-P2 $=6+2=8 \rightarrow$ use direct.

P1-P3:

direct $6 \rightarrow$ used.

P2-P3:

cost $2 \rightarrow$ used.

P2-P4:

direct 9 vs via P2-P3-P5-P4 $=2+8+2=12 \rightarrow$ direct 9 is used.

P4-P5:

cost $2 \rightarrow$ used.

P5-P6:

cost $3 \rightarrow$ used.

P4-P6:

direct 5 vs via P4-P5-P6 = $2+3=5$, equal

DV will choose fewer hops → direct

→ so P4-P6 is used.

→ No Initial unused links

Every edge is optimal.

Hence no edge cost will be changed.

Final answer: 0

edited by
Answer:
Position:
Show:

Related questions

7 7 votes
2 2 answers
460
460 views
GO Classes asked Nov 28, 2025
460 views
Consider a network of $6$ routers, A1 to A6 with link costs as shown in the following diagram:  Assume a standard distance vector routing protocol is used.Initially, some...
8 8 votes
4 4 answers
710
710 views
GO Classes asked Nov 28, 2025
710 views
A university campus is redesigning its legacy Ethernet network (Classic CSMA/CD) that operates at $1$ Gbps. The network engineers have specified that the maximum possible...
6 6 votes
4 4 answers
617
617 views
GO Classes asked Nov 28, 2025
617 views
A CSMA/CD protocol is surprisingly used on a geostationary satellite link between two ground stations. The data transmission rate on the link is $100$ Mbps . The distance...
12 12 votes
6 6 answers
1.1k
1.1k views
GO Classes asked Nov 28, 2025
1,136 views
The routing table of a router is shown below:\[\begin{array}{|l|l|l|}\hline\text{Destination} & \text{Subnet Mask} & \text{Interface} \\\hline140.24.56.0 & 255.255.254.0 ...