Diff for "LinkState"

Differences between revisions 3 and 8 (spanning 5 versions)

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 cse952lec03.pdf

Uses OpenShortestPathFirst OSPF algorithm

Back to ComputerTerms

-  ⇤ ← Revision 3 as of 2003-09-12 18:06:06 → 
  Size: 482
  Editor: pcp025745pcs
  Comment:
+   ← Revision 8 as of 2003-09-25 17:52:28 → ⇥
  Size: 526
  Editor: yakko
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 1:
+Back to ComputerTerms
-Line 9:
+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.pd
+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 cse952lec03.pdf
-Line 12:
+Line 14:
+Back to ComputerTerms