Routing Basics (3)

• Routing algorithms

  • goals: optimality, simplicity, stability, robustness, flexibility
  • static and dynamic
  • single-path and multi-path
  • flat and hierarchical (space of routers)
  • inter-domain (like RIP, IGRP) and intra-domain (like EGP, BGP)
  • host intelligent (end-node determines the whole path- source routing) and router intelligent
  • link-state (shortest path first - small updates everywhere, OSPF, IS-IS, E-IGRP) and distance vector (Bellman-Ford - larger updates only to neighboring routes, IGRP, RIP)

Previous slide

Next slide

Back to first slide

View graphic version