|
Size: 526
Comment:
|
Size: 706
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 11: | 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 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 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
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 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