How link state routing
For an assignment I have to implement link state routing, but I don't understand how to do it. What I don't understand is when and LSP is sent out, when an LSP id is incremented, and when an LSP is rejected. Basically everything. Any help will be appreciated. The only difference is that routers don't ping each other; I already know the network topology.
Ok, I figured it out. It's even easier than distance vector routing. I store the weights in an adjancy matrix and runs Dijstra's algorithm on it. I don't store the next hop, though. Hope the TA doesn't notice.