Routes from node a Forwarding Table for A 3 Dest Cost Next Hop 2 ABCDEF 046725 ABEBEE D B Properties Some set of shortest paths forms tree Shortest path spanning tree Solution not unique E.g., A-E-F-C-D also has cost 7 9/28/2006 Lecture 10: Intra-Domain routing9/28/2006 Lecture 10: Intra-Domain Routing 4 Routes from Node A • Properties • Some set of shortest paths forms tree • Shortest path spanning tree • Solution not unique • E.g., A-E-F-C-D also has cost 7 A E F C D B 2 3 6 4 1 1 1 3 Forwarding Table for A Dest Cost Next Hop A 0 A B 4 B C 6 E D 7 B E 2 E F 5 E