Log In
1 vote

Consider Dijkstra’s algorithm in linked state routing protocol at node $u.$ Professor Ram first sets the route for each directly connected node $v.$ to be the link connecting $u$ to $v.$ Ram then implements the rest of the algorithm correctly, aiming to produce minimum cost routes, but doesnot change the routes to the directly connected nodes. In this network, u has atleast two directly connected nodes and there is more than one path between any two nodes. Which of the following statement is false with u’s routing table?

$A)$ There are topologies and link costs where the majority of the routers to other nodes will be incorrect?

$B)$ There are topologies and link costs where no routing table entry (other than u to itself) will be correct.

$C)$ There are topologies and link costs where all routing table entry will be correct.

$D)$ Both $A)$ and $B)$

How Dijkstra working here? 

in Computer Networks 146 views

not getting. Can u explain a bit first.

Consider this diagram and verify the above condition and option c, see that all conditions are satisfied.

First adjacent node's weights of u are all made constant, now apply dijkstra at each node, it will always give the best result even after fixing the weights of 2 adjacent paths of u.



they r asking for u's routing table. Where u constructed it??

Sorry..! i thought the question was asking which one is the correct in options.. but now i saw that false was asked for.. but tell me one thing, if i even consider routing table for my above diagram for u, i will be getting the best routing table like

u--> a =4

u--> c=5

u->a->b = 6.

Is C the ans (as wrong)?

So where did i go wrong?
no, ans given B)

Please log in or register to answer this question.

Related questions

0 votes
0 answers
Consider a very large network $10000$ routers. Two host $A$ and $B$ connected with this network. Host $A$ sends a data to host $B$. and after some unit of time host $A$ receives $ICMP$ time exceed message for the samedata packet. The number of router ... some distance some ICMP message generated? Say if $ICMP$ message generated in $9999th$ router, then where it give error of time exceed message?
asked Apr 20, 2019 in Computer Networks srestha 267 views
0 votes
1 answer
Which of the following procedure results same output as Dijkstra’s Algo. on unweighted graph on $'n'$ verices? $A)$ BFS $B)$ DFS $C)$Kruskal $D)$ Prims As far I know Dijkstra and Prims both have $T.C.=O(E+VlogV)$ But ans given BFS. How this ans possible??
asked May 18, 2019 in Algorithms srestha 165 views
1 vote
1 answer
Consider two computers A and B are connected through a network of 30 Mbps. Assume the distance between them is 3000km and the signal propagation speed is same as the speed of light and the packet size is 12 KB. What is the minimum number of bits required for window to achieve 100% of utilization during GoBack-N and selective repeat protocol? A . 5 and 6 B. 6 and 7 C. 6 and 6 D. 7 and 8
asked Jan 22, 2019 in Computer Networks Ram Swaroop 347 views
1 vote
4 answers
DH key exchange algorithm is used to establish a session between sender and receiver with n=23 and g=5. The sender's secret key is 6 and the receiver's secret key is 15. What is the secret key between the receiver and sender? Please explain with solution P.S: Answer is given as 2
asked Aug 18, 2018 in Computer Networks Kalpataru Bose 204 views