Routing

Graph abstraction for routing algorithms:

• graph nodes are routers

• graph edges are “physical” links

  • link cost: delay, $cost, or congestion level

Goal: determine “good” path

(sequence of routers) thru

network from source to dest.

• “good” path:
  • minimum cost path
  • other def’s possible
    • policy constraints

Previous slide

Next slide

Back to first slide

View graphic version