Register

Peterson Davie Q.15,17

• edited by
948 views
0 votes
0 votes

Graph links are given as A-C=3,A-D=8,B-E=2,C-F=6,C-E=1,D-E=2 (A)Give global distance vector table (B)Routing table at node D by Link State algorithm (C) Suppose the forwarding tables are all established as in (A) and then the C–E link fails. Give (i) The tables of A, B, D, and F after C and E have reported the news. (ii) The tables of A and D after their next mutual exchange. (iii) The table of C after A exchanges with it.

• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
1
prasoon raghav asked May 13, 2017
488 views
Peterson and Davie
Suppose that forwarding tables are all established and then C-E link fails. Question : What update will be there in the C and E tables after failure and which tables information will be exchanged? what will be the table of A after C and E have reported the news?
Suppose that forwarding tables are all established and then C-E link fails.Question : What update will be there in the C and E tables after failure and which tables info...
User Avatar
0 votes
0 votes
0 answers
3
Parimal Paritosh asked Jul 2, 2018
998 views
Link State Routing
Why do we use Dijkstra algorithm in Link State Routing Protocol? I understand that it is essential to compute the shortest path to every other node, but is Dijkstra algorithm run for each system in the graph and does each node have its own Shortest Path Tree?
Why do we use Dijkstra algorithm in Link State Routing Protocol? I understand that it is essential to compute the shortest path to every other node, but is Dijkstra algor...
User Avatar
0 votes
0 votes
1 answer
4
Jaydeep gupta 1 asked May 21, 2018
395 views
Routing
Can distance vector routing implementation is possible with delay? usually, is it done by hop-count? also, Can link state routing implementation is possible with hop-count? usually, is it done by delay?
Can distance vector routing implementation is possible with delay?usually, is it done by hop-count?also, Can link state routing implementation is possible with hop-count?...
User Avatar
Link Copied!