The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes

In link state routing algorithm after construction of link state packets, new routes are computed using:

  1. DES algorithm
  2. Dijkstra’s algorithm
  3. RSA algorithm
  4. Packets
asked in Others by Active (3.9k points) | 1.3k views

1 Answer

+1 vote

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.

answered by Active (3.9k points)

Related questions

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
50,071 questions
53,206 answers
70,424 users