Thread: How link state routing

  1. #1
    Registered User
    Join Date
    Sep 2003

    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.


  2. #2
    Registered User
    Join Date
    Sep 2003
    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.

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Grammar to FSA to C code (Newbie)
    By aybe in forum C Programming
    Replies: 4
    Last Post: 02-29-2008, 02:10 PM
  2. Replies: 16
    Last Post: 11-23-2007, 01:48 PM
  3. Replies: 0
    Last Post: 10-06-2007, 01:25 PM
  4. Replies: 0
    Last Post: 07-22-2003, 11:29 AM
  5. Undefined Structure in Link List
    By _Cl0wn_ in forum C Programming
    Replies: 1
    Last Post: 03-22-2003, 05:57 PM