Link-State Routing - Sharif

Link-State Routing

Reading: Sections 4.2 and 4.3.4

Acknowledgments: Lecture slides are from Computer networks course thought by Jennifer Rexford at Princeton University. When slides are obtained from other sources, a reference will be noted on the bottom of that slide and full reference details on the last slide.

1

Goals of Todays Lecture

? Inside a router

?Control plane: routing protocols ?Data plane: packet forwarding

? Path selection

?Minimum-hop and shortest-path routing ?Dijkstra's algorithm

? Topology change

?Using beacons to detect topology changes ?Propagating topology information

? Routing protocol: Open Shortest Path First

2

What is Routing? ? A famous quotation from RFC 791

"A name indicates what we seek. An address indicates where it is. A route indicates how we get there."

-- Jon Postel

3

Routing vs. Forwarding ? Routing: control plane

?Computing paths the packets will follow ?Routers talking amongst themselves ?Individual router creating a forwarding table

? Forwarding: data plane

?Directing a data packet to an outgoing link ?Individual router using a forwarding table

4

Data and Control Planes

data plane

Processor

control plane

Line card Line card

Switching Fabric

Line card Line card

Line card

Line card

5

 ................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download