9. Exploring the Functions of Routing Flashcards

1
Q

Networks to which a router is attached are called what?

A

Local or Directly Connected networks.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

List the four primary types of memory found in routers.

A

RAM, NVRAM, ROM, Flash.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

List the Two Primary Functions of a Router.

A

Path Determination and Packet Forwarding.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What do Routers use to determine how to forward packets?

A

A Routing Table.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Which routing table element describes the IPv4 address of the successive neighboring device?

A

Next Hop

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

List the four types of entries that might be found in a routing table.

A
  1. Directly Connected Networks
  2. Dynamic Routes
  3. Static Routes
  4. Default Routes.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

List the three parts of a directly connected routing table entry.

A
  1. Route Source
  2. Destination Network
  3. Outgoing Interface
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

List the seven parts of a dynamic routing table entry.

A
  1. Route Source
  2. Destination Network
  3. Adminitrative Distance
  4. Metric
  5. Next-hop
  6. Route time stamp
  7. Outgoing Interface
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Route Entries that are manually entered directly into the configuration of the router are called what?

A

Static Routes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

This is an optional entry used by the router if a packet does not match any other entry.

A

Default Route

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is Administrative Distance?

A

Administrative Distance represents the “Trust-Worthiness” or a route.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is the Administrative Distance of a Static Route?

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Given separate routes to the same destination, a router will pick the route with the ________ administrative distance.

A

Lowest

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is the Administrative Distance of a Directly Connected Network?

A

0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

The routing table entry whose leading address bits matches the largest number of the packet destination address bits is called what?

A

The Longest Prefix Match.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Name the Seven Parts of a Dynamic Routing Table Entry

Example: O 172.16.1.0/24 [110/2] via 192.168.10.2, 00:03:23, GigabitEthernet0/1

A
  1. Route Source
  2. Destination Network
  3. Administrative Distance
  4. Metric
  5. Next-hop
  6. Route time stamp
  7. Outgoing interface
17
Q

What is the adminitrative distance of a Static Route?

A

1

18
Q

What is the administrative distance of a Default Route?

A

1

19
Q

What is the command to display the IPv4 routing table of a router?

A

Router# show ip route

20
Q

What does a Route Source with the code “C” mean?

A

“C” indicates a directly connected network.

21
Q

What does a Route Source with the code “L” mean?

A

“L” indicates local interfaces within connected networks.

22
Q

What does a Route Source with the code “R” mean?

A

“R” indicates RIP

23
Q

What does a Route Source with the code “O” mean?

A

“O” indicates OSPF

24
Q

What does a Route Source with the code “D” mean?

A

“D” indicates EIGRP.

(Stands for Diffusing Update Algorithm or DUAL)

25
Q

What does a Route Source with the code “S” mean?

A

“S” indicates static routes

26
Q

What does a Route Source with the code that has an asterisk (*) mean?

A

An asterisk indicates that this route is a candidate for the default route.

27
Q

What is the Longest Prefix Match?

A

The routing table entry whose leading address bits matches the largest number of the packet destination address bits.