Routing
Routing is the process of selecting paths for traffic across interconnected networks. Routers examine destination IP addresses, consult routing tables built from static configuration or dynamic protocols, and forward packets hop by hop toward their destination using the longest prefix match.
itNetworking | OpenSkills.info
Course pathWalk it in order
Look it upDip in anytime
Go furtherLeaves this page
Don't Panic
Don't Panic - Routing
Routing moves IP packets across network boundaries. A switch forwards frames inside a broadcast domain. A router forwards packets between networks by reading destination IP addresses and choosing a next hop.
Every attached device routes somehow. Hosts decide same-subnet versus default gateway. Routers choose among learned paths. This course focuses on the protocol-independent core: the routing table, forwarding decisions, static routes, dynamic protocol categories, route selection, and design choices that affect convergence and stability.
Forwarding is mechanical. Read the destination. Find matching prefixes. Take the longest match. Send to the next hop or out the interface. Decrement TTL and drop at zero. Dynamic protocols are machinery for filling the table; they are not a substitute for understanding the table.
Design choices bite later. Redistribution without filters creates loops. Static routes stay quiet until a path dies. Healthy adjacencies can hide data-plane drops. Prefer clear administrative domains, intentional redistribution, and verification with real probes.
Read the Intro for the host-versus-router decision split. Use the Cheatsheet when you need longest-prefix steps and administrative distance defaults. Field Notes call out redistribution and control-versus-data-plane traps. The Intro and Cheatsheet carry the worked vocabulary; return to them when a term here feels thin. Field Notes hold the judgment calls that change what you do next. The Intro and Cheatsheet carry the worked vocabulary; return to them when a term here feels thin. Field Notes hold the judgment calls that change what you do next. The Intro and Cheatsheet carry the worked vocabulary; return to them when a term here feels thin. Field Notes hold the judgment calls that change what you do next.
Where this skill leads
Relevant careers
See how this topic contributes to broader role-level skill maps.
Sources
- https://www.rfc-editor.org/rfc/rfc1812
Supports
- IP forwarding algorithm and longest prefix match rule
- TTL handling and ICMP Time Exceeded generation
- Routing table structure and requirements
- Default route behavior (0.0.0.0/0)
- https://www.rfc-editor.org/rfc/rfc2328
Supports
- Link-state protocol design and SPF computation
- OSPF cost metric derived from interface bandwidth
- Area hierarchy and inter-area summarization
- Hello protocol and adjacency formation
- https://www.rfc-editor.org/rfc/rfc4271
Supports
- Path-vector protocol design
- AS path as loop prevention mechanism
- BGP best path selection algorithm
- Inter-domain routing and policy application
- https://www.cisco.com/c/en/us/support/docs/ip/routing-information-protocol-rip/13769-5.html
Supports
- Administrative distance comparison between routing sources
- Static vs dynamic route characteristics
- Route redistribution concepts
- Distance-vector vs link-state operational comparison
- https://www.rfc-editor.org/rfc/rfc4632
Supports
- CIDR prefix notation replacing classful addressing
- Route aggregation and summarization principles
- Hierarchical address assignment for scalable routing
