Chapter 8 - OSPF Flashcards

1
Q

backup designated router (BDR)

A

A backup pseudonode that maintains the network segment’s state to replace the DR in the event of its failure.

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

dead interval

A

The amount of time required for a hello packet to be received for the neighbor to be deemed healthy. Upon receipt, the value resets and decrements toward zero.

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

designated router (DR)

A

A pseudonode to manage the adjacency state with other routers on the broadcast network segment.

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

hello interval

A

The frequency at which hello packets are advertised out an interface.

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

hello packets

A

Packets that are sent out at periodic interval to detect neighbors for establishing adjacency and ensuring that neighbors are still available.

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

interface priority

A

The reference value for an interface to determine preference for being elected as the designated router.

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

passive interface

A

An interface that has been enabled with a routing protocol to advertise its associated interfaces into its RIB but that does not establish neighborship with other routers associated to that interface.

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

router ID (RID)

A

A 32-bit number that uniquely identifies the router in a routing domain.

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

shortest path tree (SPT)

A

A router’s view of the topology to reach all destinations in the topology, where the router is the top of the tree, and all of the destinations are the branches of the tree. In the context of multicast, the SPT provides a multicast distribution tree where the source is the root of the tree and branches form a distribution tree through the network all the way down to the receivers. When this tree is built, it uses the shortest path through the network from the source to the leaves of the tree.

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