210 views
0 votes
0 votes

Consider the network given below :

Each node in the graph represents the router. Each node maintains its routing table to send a packet to its destination with minimum cost. Initially routing table is empty. The table is filled as every node knows only the distance to the immediate neighbour. What will be the routing table ‘F’ after each node has twice reported the information it had in the proceeding steps in its immediate neighbours?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
2
2 votes
2 votes
1 answer
4