Link State Routing
Construct Link State Packet (LSP)
- who you are
- list of (neighbor, cost) pairs
Broadcast the LSP to all routers
Store latest LSP from every other node
Compute routes
- Edsgar Dijkstra’s algorithm
- Put (SELF,0) on tree as Root
- Look at LSP of node just placed on tree. If for any node N the cost is best path of any found so far, add (N,c) to tree under N with dotted line
- Make shortest dotted line solid. Go to 2.