Routing Protocols Evolution and Classification...
Vocabulary Exercise: Matching (Key Words)
Match the definition on the left with a term on the right. This exercise is not necessarily a one-to-one matching. Some definitions might be used more than once, and some terms might have multiple definitions.
Definitions
|
Terms
|
a) A protocol that does not include subnet mask information in its messages
|
1) administrative distance
|
b) Routing protocols that operate between
autonomous systems
|
2) algorithm
|
c) A topology that consists of a major network separating the subnets of another major network
|
3) autonomous system
|
d) The ability to specify a different subnet mask for
the same network number on different subnets
|
4) classful routing protocols
|
e) Rating of trustworthiness of a routing information source
|
5) classless routing protocols
|
f. A collection of routers under a common administration
|
6) converged
|
g. Speed and ability of a group of routers to agree on the topology of the network after a change in that topology
|
7) convergence
|
h) Classification of a routing protocol that uses the shortest path first or Dijkstra algorithm
|
8) discontiguous network
|
i) Classification of a routing protocol that uses the
Bellman-Ford algorithm to determine the best path
|
9) distance vector
|
j) A finite list of steps used by routing protocols for
best-path determination
|
10) exterior gateway protocols
|
k) Routing protocols that operate within autonomous systems
|
11) interior gateway protocols
|
l) A protocol that does include subnet mask information in its message
|
12) link-state
|
m) A state when routers all have the same consistent network topology in their routing table
|
13) VLSM
|
No comments:
Post a Comment