Register

GO Classes DPP | CN | ROUTING

• edited by
435 views
5 5 votes

$\text { Consider a network running a link-state routing protocol with the following topology: }$


The numbers represent link costs. Router A needs to compute the shortest path to all other routers using Dijkstra's algorithm.
 

After completing the algorithm, what is the total cost of the shortest path from $\textbf{A}$ to $\textbf{D}$ ?
 

  1. $4$
     
  2. $5$
     
  3. $6$
     
  4. $7$

 

2 Answers

Voting & Accepting an answer helps improve the community
Answer:
← Previous · GO Classes DPP | CN ...Next → · GO Classes DPP | CAL...
← Previous in category · GO Classes DPP | CN ...Next in category → · GO Classes DPP | CN ...
Position:
Show:

Related questions

7 7 votes
1 1 answer
349
349 views
GO Classes asked Nov 21, 2025
349 views
GO Classes DPP | CN | CONGESTION CONTROL
Consider a TCP connection where the congestion window varies between $\mathrm{W}$ and $\mathrm{W} / 2$ due to periodic packet losses caused by congestion. The round-trip ...
5 5 votes
1 1 answer
384
384 views
GO Classes asked Nov 21, 2025
384 views
GO Classes DPP | CN | CONGESTION CONTROL
Consider a TCP connection using AIMD (Additive Increase Multiplicative Decrease) congestion control. The current congestion window size is $\mathbf{2 4 ~MSS}$. A timeout ...
6 6 votes
3 3 answers
409
409 views
GO Classes asked Nov 21, 2025
409 views
GO Classes DPP | CN | FRAGMENTATION
An IP datagram of size $\mathbf{2400} ~\textbf{bytes}$ (including IP header) passes through two networks with different MTUs:Network A: MTU $= 1500 ~\textbf{bytes}$ Netwo...
6 6 votes
2 2 answers
466
466 views
GO Classes asked Nov 21, 2025
466 views
GO Classes DPP | CN | FRAGMENTATION
Consider an IP datagram of $\mathbf{1500 ~bytes}$ (including the IP header) that must be sent over a network with an MTU of $\mathbf{576 ~bytes}$. The IP header size is $...