The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes
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?
asked in Computer Networks by (293 points) | 96 views
Dijkstra algorithm first chooses the shortest distant node from start, then calculate distance of each of adjacent nodes choose shortest among them or, update if less distant found.

And, since LSR is generally used in large network Dijkstra works faster here to find shortest path.
what do u want to say from shortest path tree??

Please log in or register to answer this question.

Related questions

0 votes
1 answer
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
48,452 questions
52,748 answers
68,220 users