The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
16 views
Consider Dijkstra's algorithm in the link 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 a minimum-cost routes,but does not 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.Assume that all link costs are non-negative.Which of the following statements is false of u's routing table?

A)There are topologies and link costs where the majority of the routes to other nodes will be incorrect.

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

C)There are topologies and link costs where all routing table entry (other than from u to itself) will be correct.

D)Both (A) and (B)
asked in Computer Networks by Active (4k points) | 16 views
0

professor Ram first sets the route for each directly connected node

 

This doesn't change any thing i guess because we are getting the distance directly without any effort (like sending hello packets) . So option c?? 

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
asked 3 days ago in Computer Networks by amitqy Junior (771 points) | 13 views
0 votes
0 answers
2
asked 3 days ago in Computer Networks by garimanand Active (1.2k points) | 26 views


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

42,628 questions
48,620 answers
155,927 comments
63,878 users