Size: 261
Comment:
|
Size: 533
Comment:
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
Back to ComputerTerms |
|
Line 4: | Line 6: |
* What: Send Link stata packet about dirrect connected links | * What: Send Link state packet (LSP) about direct connected links |
Line 7: | Line 9: |
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.pdf |
Line 10: | Line 14: |
Back to ComputerTerms |
Back to ComputerTerms
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 attach:cse952lec03.pdf
Uses OpenShortestPathFirst OSPF algorithm
Back to ComputerTerms