Differences between revisions 7 and 8
⇤ ← Revision 7 as of 2003-09-25 17:51:19 →
Size: 532
Editor: yakko
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 11: 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

Back to ComputerTerms

  • 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

LinkState (last edited 2004-03-17 21:32:02 by yakko)