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}?$ $x>4$ $y+x<6$ $y+x<4$ $x<4$ Computer Networks goclasses2023-iiith-mock-1 goclasses computer-networks link-state-routing 1-mark + – GO Classes asked Mar 26, 2023 • edited Mar 27, 2023 by Lakshman Bhaiya GO Classes 734 views answer comment Share Follow See 1 comment See all 1 1 comment reply MANSI_SOMANI commented Mar 27, 2023 reply Follow Share How ans is C? if we take x=2,y=1 then we r getting BDAC=7 and BAC=8 anyone explain this !! 0 votes 0 votes Please log in or register to add a comment.
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. Himanshu555 answered Mar 27, 2023 Himanshu555 comment Share Follow See 1 comment See all 1 1 comment reply MANSI_SOMANI commented Mar 27, 2023 reply Follow Share ok got it thnx 0 votes 0 votes Please log in or register to add a comment.