Log In
0 votes

Where can I get a question similar to this one asked in gate 2011? Where they ask what will happen to the routing table of a node(after some round of exchanges ) ,when a link goes down. If you have any pls share.

in Computer Networks 72 views

Please log in or register to answer this question.

Related questions

0 votes
3 answers
Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated __________. automatically by server by exchanging information with neighbour nodes with back up database
asked Mar 24, 2020 in Computer Networks jothee 196 views
1 vote
1 answer
Consider the network of Figure. Distance vector routing is used, and the following vectors have just come in to router C: from B: (5, 0, 8, 12, 6, 2); from D: (16, 12, 6, 0, 9, 10); and from E: (7, 6, 3, 9, 0, 4). The cost of the links from C to B, D, and E, are 6, 3, and 5, respectively. What is C’s new routing table? Give both the outgoing line to use and the cost.
asked Mar 16, 2019 in Computer Networks ajaysoni1924 178 views
1 vote
0 answers
What is optimal and Estimated Cost here, and why eliminate option A and C, why option B is correct.
asked Jan 15, 2019 in Computer Networks Raja Rawal 179 views