recategorized
2,249 views

3 Answers

1 votes
1 votes

option 2

Dijkstra’s algorithm  

Link state protocols, sometimes called shortest path first or distributed database protocols, are built around a well-known algorithm from graph theory, E. W. Dijkstra's shortest path algorithm, which is  is a graph search algorithm that solves the single-source shortest path problem for a graph with non-negative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms.

0 votes
0 votes

Link State Routing(LSR) algorithm after construction of link state packets, new routes are computed using Dijkstra's algorithm.
Each node independently runs an algorithm over the map to determine the shortest path from itself to every other node in the network;
generally some variant of Dijkstra's algorithm is used.

Answer:

Related questions

1 votes
1 votes
3 answers
1
go_editor asked Mar 24, 2020
1,239 views
Match the following Layers and Protocols for a user browsing with $\text{SSL}:$$\begin{array}{clcl} \text{a.} & \text{Application of layer} & \text{i.} & \text{TCP} \\...
0 votes
0 votes
2 answers
2
go_editor asked Mar 24, 2020
1,323 views
The maximum size of the data that the application layer can pass on to the $TCP$ layer below is ________.$2^{16}$ bytes$2^{16}$ bytes + $TCP$ header length$2^{16}$ bytes ...
2 votes
2 votes
5 answers
3
go_editor asked Mar 24, 2020
1,406 views
A packet whose destination is outside the local $TCP/IP$ network segment is sent to ________.File server$DNS$ server$DHCP$ serverDefault gateway
1 votes
1 votes
4 answers
4