● One of the most widely used routing protocols in IP networks is the Routing Information Protocol (RIP). RIP is the canonical example of a routing protocol built on the （71）algorithm. Routing protocols in internetworks differ slightly from the idealized graph model. In an internetwork, the goal of the routers to forward packets to various （72）.
Routers running RIP send their advertisement about cost every （73） seconds. A router also sends an update message whenever an update from another router causes it to change its routing table.
It is possible to use a range of different metrics or costs for the links in a routing protocol. RIP takes the simplest approach, with all link costs being equal （74）. Thus it always tries to find the minimum hop route. Valid distances are 1 through （75）.This also limits RIP to running on fairly small networks.
（71）
A. distance vector
B. link state
C. flooding
D. minimum spanning tree
（72）
A. computers
B. routers
C. switches
D. networks
（73）
A. 10
B. 30
C. 60
D. 180
（74）
A. 1
B. 15
C. 16
D. length of the link
（75）
A. 6
B. 10
C. 15
D. 16
