Dijkstra’s algorithm

which are possible paths which can later be moved into PATH

• Forwarding database: (ID, forwarding direction) which is the actual routing table

• Algorithm:
  • Start with “self” as the root of a tree: I.e put (myID, 0, 0) in PATH.
  • If N is just put into PATH, look at N’s links (ie its LSP). For each link (to say neighbor) M, add cost from root-to-N to the cost of link from N to M. If M not already in PATH or TENTATIVE with better path cost, add (M, new path cost, M-N link) to TENTATIVE

  Previous slide

  Next slide

  Back to first slide

  View graphic version