Distance Vector Routing Protocols - Routing Protocols and Concepts - page 172

Comparing Routing Protocol Characteristics Exercise

In Table 4-1, all the routing protocols discussed in the course are compared based on the characteristics
you briefly described in the previous exercise. For each characteristic, circle the description that applies
to each routing protocol. For example, RIP is slow to converge. So you would circle “slow” in the “Speed
of Convergence” row under both RIPv1 and RIPv2.

Table 4-1 Comparing Routing Protocol Features

Distance Vector Link-State

RIPv1 RIPv2 IGRP EIGRP OSPF IS-IS

Speed of Convergence Slow Slow Slow Slow Slow Slow

Fast Fast Fast Fast Fast Fast

Scalability — Size Small Small Small Small Small Small

of Network Large Large Large Large Large Large

Use of VLSM Ye s Ye s Ye s Ye s Ye s Ye s

No No No No No No

Resource Usage Low Low Low Low Low Low

Medium Medium Medium Medium Medium Medium

High High High High High High

Implementation and Simple Simple Simple Simple Simple Simple

Maintenance Complex Complex Complex Complex Complex Complex

Network Discovery

Network discovery is part of the process of the routing protocol algorithm that enables routers to first
learn about remote networks. In the following exercises, you will demonstrate your knowledge of the
network discovery process.

Network Discovery Exercise

Cold Start

What does a router know when it first boots?

The only information that a router has is from its own saved configuration file stored in NVRAM.

After it boots, what does the router know about the network topology?

The router will initially discover its own directly connected networks.

In Figure 4-1, the routers have booted. However, they have not yet discovered any neighbors. In the
tables below each router, fill in the networks, interfaces, and hop counts that each router has installed
in its routing table.