Register

GO Classes 2023 | IIITH Mock Test 1 | Question: 22

• edited by
740 views
2 votes
2 votes

Consider the network given below with routers $\text{A, B, C, D}$ and $\text{E}.$

If the network follows link state routing algorithm to determine next hop for least cost path then which constraints on $x$ and $y$ guarantee traffic from $\text{B}$ to $\text{C}$ will always flow through node $\text{A}?$

  1. $x>4$
  2. $y+x<6$
  3. $y+x<4$
  4. $x<4$
• edited by
User Avatar

1 Answer

4 votes
4 votes
There are 3 path from B to C,

BAC(6+X) ,BDAC(4+X+Y),BDEC(8)

NOW WE WANT PATH ALWAYS THROUGH A HENCE 6+X<8 AND 4+X+Y<8

WHICH MEANS X<2 AND X+Y<4

HENCE C IS MOST STRONG ANSWER.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
GO Classes asked Mar 26, 2023
628 views
GO Classes 2023 | IIITH Mock Test 1 | Question: 20
The routing table below uses the longest prefix match in its routing decisions. ...
The routing table below uses the longest prefix match in its routing decisions.$$\begin{array}{|c|c|}\hline \text{Network Address/Length} & \text{Next Hop} \\\hline \hlin...
User Avatar
1 votes
1 votes
1 answer
2
GO Classes asked Mar 26, 2023
532 views
GO Classes 2023 | IIITH Mock Test 1 | Question: 21
A protocol used by a router or destination host to communicate with the source, typically to report errors in IP datagram processing. ARP ICMP TCP DNS
A protocol used by a router or destination host to communicate with the source, typically to report errors in IP datagram processing.ARPICMPTCPDNS
User Avatar
Link Copied!