lecture09.ppt
1 Even More Routing EE122 Fall 2012 Scott Shenker ee122/ Materials with thanks to Jennifer Rexford, Ion Stoica, Vern Paxson.
15-441 Computer Networking
Routing Graph abstraction for routing algorithms: graph nodes are routers graph edges are physical links –link cost: delay, $ cost, or congestion level.
10-1 Last time □ Transitioning to IPv6 ♦ Tunneling ♦ Gateways □ Routing ♦ Graph abstraction ♦ Link-state routing Dijkstra's Algorithm ♦ Distance-vector.
2004.4.15.
Week 6 Routing Concepts
Chapter 4 roadmap
15-441 Computer Networking Intra-Domain Routing, Part I RIP (Routing Information Protocol)
Even More Routing
4.1 introduction 4.2 virtual circuit and datagram networks 4.3 what ’ s inside a router
