867
Comment: missing edit-log entry for this revision
|
706
|
Deletions are marked like this. | Additions are marked like this. |
Line 8: | Line 8: |
* How: Reliable flooding | |
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 |
1. ID of the node that created the LSP 2. List of directly connected neighbors, cost of link 3. A sequence number 4. TTL |
Line 21: | Line 20: |
=== 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)
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