Chapter 11: Routing Outline:
Chapter Review |
Chapter Overview |
11.1 | Routing Basics
11.1.1 | Path determination
11.1.2 | How routers route packets from source to destination
11.1.3 | Network and host addressing
11.1.4 | Path selection and packet switching
11.1.5 | Routed versus routing protocol
11.1.6 | Network-layer protocol operations
11.1.7 | Multiprotocol routing
11.2 | Why Routing Protocols are Necessary
11.2.1 | Static versus dynamic routes
11.2.2 | Why use a static route
11.2.3 | How a default route is used
11.2.4 | Why dynamic routing is necessary
11.2.5 | Dynamic routing operations
11.2.6 | How distances on network paths are determined by various metrics
11.2.7 | Three classes of routing protocols
11.2.8 | Time to convergence
11.3 | Distance-Vector Routing
11.3.1 | Distance-vector routing basics
11.3.2 | How distance-vector protocols exchange routing tables
11.3.3 | How topology changes propagate through the network of routers
11.3.4 | The problem of routing loops
11.3.5 | The problem of counting to infinity
11.3.6 | The solution of defining a maximum
11.3.7 | The solution of split horizon
11.3.8 | The solution of hold-down timers
11.4 | Link-State Routing
11.4.1 | Link-state routing basics
11.4.2 | How link-state protocols exchange routing tables
11.4.3 | How topology changes propagate through the network of routers
11.4.4 | Two link-state concerns
11.4.5 | Unsynchronized link-state advertisements (LSAs) leading to inconsistent path decisions amongst routers
11.5 | The Context of Different Routing Protocols
11.5.1 | Distance-vectors versus link-state routing protocols
11.5.2 | Hybrid routing protocols
11.5.3 | LAN-to-LAN routing
11.5.4 | LAN-to-WAN routing
11.5.5 | Path selection and switching of multiple protocols and media
Chapter Summary |
Chapter Quiz |