Interior Routing (IGP)

Edit Answers
12345678910
Across
  1. 2. Algorithm used to calculate the shortest path tree.
  2. 5. Advanced distance-vector protocol using the DUAL algorithm.
  3. 6. Packet containing local routing/link information in OSPF.
  4. 7. A network that has only one way to reach all other networks.
  5. 8. Link-state protocol using the Dijkstra algorithm.
  6. 9. Distance-vector protocol using hop count.
  7. 10. State where all routers agree on the topology.
Down
  1. 1. Value used to determine the best path (cost/delay).
  2. 3. The act of sharing routing tables with neighbors.
  3. 4. Prevents routing loops by not re-advertising routes.