Class 10-05-11

· About routing:

Dynamic routing protocols are classified into two major categories: (1) distance vector protocols and link-state protocols.

Routers running distance vector routing protocols share network information with directly connected (2) routers. The neighbor routers then (3) advertise the information to their neighbors, until all routers in the enterprise learn the information. A router running a distance vector protocol does not know the entire (4) path to a destination; it only knows the distance to the remote network and the direction, or vector. Its knowledge comes through information from directly connected neighbors.

Like all routing protocols, distance vector protocols use a (5) metric to determine the best route. Distance vector protocols calculate the best route based on the distance from a router to a network. An example of a metric used is (6) hop count, which is the number of (7) loops, or hops, between the router and the destination.


· About RIP:

The RIP distance vector routing protocol is easy to configure and (8) requires minimal amounts of router resources in order to function.

However, the simple hop count metric used by RIP is not an (9) accurate way to determine the best path in complex networks. Additionally, the RIP limitation of 15 hops can mark distant networks as unreachable.

RIP issues periodic updates of its routing table, which consumes (10) bandwidth, even when no network changes have occurred. Routers must accept these (11) updates and process them to see if they contain updated route information.

Updates passed from router to router take time to reach all areas of the network. As a result, routers may not have an accurate picture of the network. Routing (12) neighbors can develop due to slow (13) convergence time, which wastes valuable bandwidth.

These characteristics limit the usefulness of the RIP routing protocol within the enterprise environment.