Dynamic Routing

Done

Network Route: a route to a network/subnet. Also, the one with a prefix lower than /32

Host Route: route to a specific host → 2/32

A router form “adjacencies / neighbor relatioships / neighborships” with adjacent routers

If multiple routes to a destination are learned: if it has the same administrative distance, the lower metric will decide which one to use.

There are two types of dynamic routing protocols:

If a router learns two routes to the same destination with the same administrative distance and the same metric, both will be added to the routing table. Therefore, the traffic will be load-balanced between the two routes. → ECMP (Equal Cost Multi-Path)

IGPMetricDescription
RIPHop CountEach router in the path counts as one “hop”. So the total path cost is the sum of all the routers (hops) to a destination. The downside is that it doesn`t take the speed into account, so all links are the same
EIGRPBandwidth and delay (by default)Complex formula that can take many values. It uses the bandwidth of the slowest link in the route and the total delay of all links in the route.
OSPFCostThe cost of each link is calculated based on bandwidth. The total metric is calculated based on the sum of the cost of each link.
IS-ISCostIt associates a cost to each link, however it does not automatically calculate the cost of each link. Each link has a default cost of 10 (In the end, it is similar to RIP).
Routing ProtocolAdministrative Distance
Directly Connected0
Static Route1
External BGP (eBGP)20
EIGRP90
IGRP100
OSPF110
IS-IS115
RIP120
EIGRP (External)170
Internal BGP (iBGP)200
Unusable route255
💡
The administrative distance of a route can be altered by adding it to the end of the ip route command.