|
Size: 532
Comment:
|
Size: 867
Comment: missing edit-log entry for this revision
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 8: | Line 8: |
| * How: Reliable flooding | |
| Line 11: | Line 12: |
| 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 13: | Line 14: |
| 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 === Plus === * LinkState is fast statble and takes a log of space. * It is founded upon reliable flooding. |
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)
- How: Reliable flooding
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
- ID of the node that created the LSP
- List of directly connected neighbors, cost of link
- A sequence number
- TTL
OpenShortestPathFirst OSPF is an example protocol
Plus
LinkState is fast statble and takes a log of space.
- It is founded upon reliable flooding.
Back to ComputerTerms