Next: 2.3.3 Conclusion: Network Properties
Up: 2.3.2 Packets
Previous: 2.3.2.6 Distance Vector Routing
Contents
- Each switch knows addresses that are direct neighbours
- Switch constructs packets saying who are neighbours - link
state packets.
- Link state packets flooded to all other switches
- Switch constructs complete graph using most recent link state
packets from all other switches
- Use Dijkstra shortest path to figure out routing table.
Examples include OSPF.
Next: 2.3.3 Conclusion: Network Properties
Up: 2.3.2 Packets
Previous: 2.3.2.6 Distance Vector Routing
Contents
Daniel Chalmers
2007-02-08