Diff for "LinkState"

Differences between revisions 6 and 7

Link State Protocol

Who: Send to all nodes
What: Send Link state packet (LSP) about direct connected links
When: Periodically or when a change occurs (triggered)

The point is that Local information is distributed globally.

The LSP information recieved is used to create a graph of the network. Then routing is easy because we use DijkstrasAlgorithm, to find the shortest path. See attach:cse952lec03.pd

Uses OpenShortestPathFirst OSPF algorithm

Back to ComputerTerms

-  ⇤ ← Revision 6 as of 2003-09-25 17:50:47 → 
  Size: 533
  Editor: yakko
  Comment:
+   ← Revision 7 as of 2003-09-25 17:51:19 → ⇥
  Size: 532
  Editor: yakko
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 11:
-The LSP information recieved is used to create a graph of the network. Then routing is easy because we use DijkstrasAlgorithm, to find the shortest path. See attach:cse952lec03.pdf
+The LSP information recieved is used to create a graph of the network. Then routing is easy because we use DijkstrasAlgorithm, to find the shortest path. See attach:cse952lec03.pd