1.
A large network formed by connecting independent networks through intermediate devices.
2.
A routing table that contains manually entered routes.
3.
A routing table that automatically updates based on changing network conditions.
4.
A combination of rules and procedures that allows routers to inform one another of network changes.
5.
Standards of measurement used to evaluate the best path for a packet.
6.
Mechanisms that tell routers how to process routing information.
7.
A protocol that defines routes according to the number of links needed to reach a destination.
8.
A protocol in which the cost of passing through a network depends on the required service.
9.
A network device that does not perform routing or traffic-forwarding functions.
10.
A network device that performs routing or traffic-forwarding functions.
11.
A logical group of network segments and their attached devices.
12.
A collection of networks under common administration and routing strategy.
13.
Another term used for an autonomous system.
14.
Routing within an autonomous system.
15.
Routing between autonomous systems.
16.
An intra-domain routing protocol that uses RIP and considers only network distance.
17.
The first step in determining a node’s distance to other nodes.
18.
The step in which nodes exchange routing information.
19.
The step in which nodes revise routing information based on received data.
20.
The process of combining the cost between a node and the sending node.
21.
A method that assigns a smaller value to infinity to help detect network problems.
22.
A method that helps prevent routing loops and improves convergence.
23.
A routing protocol that operates through flooding and the shortest path tree.
24.
The dissemination of link state packets to every router in the internetwork.
25.
An algorithm used to find and examine neighbors to determine the shortest path tree.
