Dynamic Routing
After the public library, our Canadian visitor jumps into a taxi to go crash at a friend’s place in Brooklyn. “Go over the Brooklyn Bridge,” she tells the driver. They head downtown. Suddenly, the driver slams on his brakes and makes an abrupt turn. Cars all around jam on their brakes, and pedestrians run hither and thither. “The radio said it is an hour to go over the bridge! We will take the tunnel!” the driver shouts to the back seat. This is an example of dynamic routing in a transportation system. What is dynamic routing in IP networks? Dynamic routing protocols allow each router to automatically discover one or more paths to each destination in the network. When the network topology changes, such as when new paths are added or when paths go out of service, dynamic routing protocols automatically adjust the contents of the routing table to reflect the new network topology.
Dynamic routing relies on (frequent!) updates to discover changes in network topology. In the example in Figure 1-3, when the path R3 → R4 is added to the network it can be automatically discovered by a routing protocol, such as RIP, EIGRP, or OSPF.
The routing protocols in use today are based on one of two algorithms: Distance Vector or Link State. Distance Vector (DV) algorithms broadcast routing information to all neighboring routers. In other words, each router tells all of its neighbors the routes it knows. When a router receives a route (from a neighbor) that is not in its routing table, ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access