Differences between revisions 5 and 7 (spanning 2 versions)
⇤ ← Revision 5 as of 2003-09-25 16:56:13 →
Size: 867
Editor: anonymous
Comment: missing edit-log entry for this revision
← 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 8: Line 8:
   * How: Reliable flooding
Line 12: 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 cse952lec03.pdf. The LSP contains the following information 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
Line 14: Line 13:
   1. ID of the node that created the LSP
   2. List of directly connected neighbors, cost of link
   3. A sequence number
   4. TTL

OpenShortestPathFirst OSPF is an example protocol

=== Plus ===

   * LinkState is fast statble and takes a log of space.
   * It is founded upon reliable flooding.		 Uses OpenShortestPathFirst OSPF algorithm

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 attach:cse952lec03.pd

Uses OpenShortestPathFirst OSPF algorithm

Back to ComputerTerms

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