Differences between revisions 3 and 9 (spanning 6 versions)
⇤ ← Revision 3 as of 2003-09-12 18:06:06 →
Size: 482
Editor: pcp025745pcs
Comment:
← Revision 9 as of 2003-09-25 17:54:30 → ⇥
Size: 706
Editor: yakko
Comment:
Deletions are marked like this. Additions are marked like this.
Line 1: 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. The LSP contains the following information
Line 11: Line 13:
Uses OpenShortestPathFirst OSPF algorithm 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

Back to ComputerTerms

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. The LSP contains the following information

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

Back to ComputerTerms

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