Differences between revisions 1 and 3 (spanning 2 versions)
⇤ ← Revision 1 as of 2003-09-12 17:57:20 →
Size: 261
Editor: pcp025745pcs
Comment:
← Revision 3 as of 2003-09-12 18:06:06 → ⇥
Size: 482
Editor: pcp025745pcs
Comment:
Deletions are marked like this. Additions are marked like this.
Line 4: Line 4:
   * What: Send Link stata packet about dirrect connected links    * What: Send Link state packet (LSP) about direct connected links
Line 7: Line 7:
Local information globally 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

  • 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

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