Table of Contents
EECS 122, Lecture 15
Routing
Global and Local Knowledge
General Needs for Routing
Routing Pitfalls
Fundamental Choices
Routing for Packet Networks
Choices in Internet Routing
Distance Vector & LinkState Routing
Distance Vector Operation
DV Route Computation
Example (DV, phase 1)
Example (DV, phase 2)
Example (DV, phase 3)
Problems with DV Approaches
The Count to Infinity Problem
The Count to Infinity Problem
The Count to Infinity Problem
The Count to Infinity Problem
The Count to Infinity Problem
Count to Infinity Problem
Path Vector
Split Horizon
Triggered Updates
Source Tracing
LinkState Routing
LS Components
LS Topology Dissemination
LSA Sequence Numbers
Wrapped Sequence Numbers
Bootstrapping Seq. Numbers
Lollipop Sequence Space
Why Called Lollipop?
Lollipop Sequence Space Comparisons
Partitioning
Database Description Records
Link vs Router Failure
Computing Shortest Paths
Dijkstra’s Shortest Path
Dijkstra’s Shortest Path
Shortest Path
DV versus LS Routing
DV versus LS Routing [2]

Author: kfall
Email: kfall@cs.berkeley.edu
Home Page: http://wwwinst.eecs.berkeley.edu/~ee122
