NET-08-P1 Dynamic Routing Flashcards

1
Q

The purpose of these protocols is to map networks and update routing tables with the shortest routes, in a fully automatic and independent manner

A

Dynamic Routing

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

Indicates that the route was manually created by an administrator to reach a specific network

A

Routing Source Codes: S

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

indicates that the route was learned dynamically from another router

A

Routing Source Codes: EIGRP

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

Indicates that the route was learned dynamically from another router using OSPF routing protocol

A

Routing Source Codes: O

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

is a measurable value assigned by the routing protocol to different routes based on the usefulness of the route

A

metric

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

This metric will choose the path with the least amount of hops, where hops refer to the router

A

Routing Protocol Metrics: RIP - Routing information Protocol

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

This metric is based on cumulative bandwidth from source to destination and will choose the path with the highest bandwidth

A

Routing Protocol Metrics: OSPF - Open Shortest Path First

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

are routing protocols used within an autonomous system (AS), such as company routers

A

Protocol Types - Interior Gateway Protocols (IGP)

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

are used to map routes between AS’s and are mainly used by ISPs

A

Exterior Gateway Protocols - EGP

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

What is the difference between Vector vs Link-State

A

how the protocols discover topology and the way they share routing information with the routers

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

is a routing algorithm that calculates the best path for a packet based on the factors of distance and vector

A

Distance Vector

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

The distance between the router and the destination network, based on the metric of number of hops (routers)

A

Distance

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

The outgoing interface and the direction to the path that leads to the destination network

A

Vector

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

routing protocols include complete network topology maps

A

Link State

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

The map is created based on information gathered from all routers on the network

A

Network Map

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

Link state routing protocols do not broadcast information regularly. Updates are only sent when a change occurs on the network

A

Network Changes

17
Q

is a feature used in all routing protocols. its purpose is to disable routing updates on specific interfaces which decreases resource usage and increase security

A

Passive Interface Feature

18
Q

What is STP

A

Spanning Tree Protocol

19
Q

What is BGP

A

Border Gateway Protocol

20
Q

What is the parameter for Administrative Distance

A

AD value is 120

21
Q

is a feature that allows automatic summarization of routes to their classful network. often disabled because most address schemes in networks today do not allow address summaries without compromising communication

A

Auto-Summarization Feature

22
Q

Keeps track of changes in the topology, such as when a new network is added or when a link fails

23
Q

this packet is sent every 10 seconds to all OSPF-enabled routers

A

Hello intervals

24
Q

When a router does not receive a “hello” packet from its neighbor within 40 seconds, it will consider that neighbor “dead” and will start looking for alternative routes

A

Dead intervals

25
A router uses this to advertise the routing topology to all other local routers in the same OSPFv2 areas
LSA - Link State Advertisement
26
stores received LSA packets, adter the routers enable OSPFv2 to use the SPF algorithm to calculate the routes
Link State Database
27
When an adjacency is initialized, OSPFv2 exchanges this packet to describe the content of the topological database
Database Description
28
If a router notices that parts of its topological database are outdated. It will send this link to a neighbor for more updated versions of those components
Link State Request
29
messages are responses to LSR message
Link State Update