Routing Protocols Flashcards

1
Q

Routing Protocol

A

A set of rules and processes that routers use to learn routes.

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

Interior Gateway Protocol

A

A protocol used by routers to share information within a single autonomous network

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

Exterior Gateway Protocol

A

A protocol used by routers to share information between autonomous networks.

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

Autonomous Network

A

A network or collection of networks that fall under the control of a single organization.

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

Routing Table

A

The list of routes that is used to make a decision on where to forward IP packets based on destination IP address.

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

Frame Rewrite

A

The process of reconstructing a packet to be forwarded to the next hop where the router strips the layer 2 information packet, discards the old frame and encapsulates the packet with a new destination MAC address.

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

Route Sources

A

Connected Routes

Static Routes

Dynamic Routes

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

Default Route

A

The route used to forward a packet if a destination IP is unknown.

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

What would occur if the routing table contains more than one route with the same destination?

A

The most specific route is chosen (longest prefix)

or load balance if the routes have equal subnet lengths.

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

Advantages of Dynamic Routes

A

Greatly reduces administrative overhead by eliminating the need to create many manual routes.

Fault Tolerant as it can automatically choose an alternative route if a link faills.

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

Distance Vector Protocol

A

A Dynamic Routing Protocl where route tables are shared with direct neighbors and uses hop count to determine routes.

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

Link State Routing Protocol

A

A Dynamic Routing Protocol where routers share detailed information about the topology via Link State Adveritisements to create a connectivity map in a Link State Database.

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

Metric

A

The value used to determine which protocol’s route is preferred.

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

RIP

A

An old Distance Vector protocol that determined routes via hop count. Has been largely replaced by OSPF.

Multicast: 224.0.0.9

AD: 120

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

EIGRP

A

A Cisco Proprietary Avanced/Hybrid Distance Vector Protocol. Determined routes via Hop Count but has no Hop Limit and can perform Unequal Cost Load Balancing

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

OSPF

A

Open Shortest Path First.

A Link State Routing Protocol that determines routes via Dijkstra’s algorithm.

Multicast: 224.0.0.5

AD 110

17
Q

OSPF Area Design Rules

A

OSPF Areas Must start with Area 0 (Backbone Area)

Must be contiguous (able to reach the backbone via ABRs)

Interfaces must be in the same subnet

18
Q

3 Main Phases of OSPF

A

1) Establish neighbor relationships with other routers
2) Exchange Database information with neighbors
3) Choose routes via LSDB

19
Q

OSPF RID selection Process

A

1) Manual RID
2) Highest UP loopback IP
3) Highest UP interface IP

20
Q

Neighbor States

A

1) Down
2) Init
3) 2Way
4) Exstart
5) Exchange
6) Loading
7) Full

21
Q

Down State

A

Routers send multicast hello packet hoping to learn about neighbors

22
Q

Init State

A

Router receives hello response and routers check Neighbor Adjacency requirements

23
Q

2way

A

Routers become neighbors

24
Q

Exstart

A

Routers select Master and Slave router based on Highest RID

25
Q

Exchange

A

Routers share a summary of their LSDB known as DBD (descritpion database)

26
Q

Loading

A

Routers request LSAs they do not have via sending an LSR, LSU and LSAck

27
Q

Full

A

Routers’ LSDB are synchronized

28
Q

Neighbor Adjacency Requirements

A

1) Area Number must match
2) Interfaces must be in the same subnet
3) Hello and Dead timers must match
4) OSPF IDs must be unique
5) Authentication settings must match

29
Q

Designated Router

A

Router that is elected to be the main router for an area and handle Area LSAs

30
Q

Area

A

Set of routers sharing the same LSDB

31
Q

Backbone Area

A

A special OSPF Area to which all other areas much connect to

32
Q

ASBR

A

Autonomous System Boundary Router;

A router connected to another Autonomous System (ISP)

33
Q

Benefits of MutliArea OSPF

A

Less information is shared between routers allowing for a smaller LSDB which reduces CPU overhead and bandwidth usage.

34
Q

5 Packet Types in OSPF

A

Hello Packet

Database Description Packet

Link State Request Packet

Link State Update Packet

Link State Acknowledgement Packet