Brainscape's Knowledge GenomeTM


Top Flashcards (Certified)
All Flashcards

CCNA > OSPF > Flashcards

OSPF Flashcards

(44 cards)

Start Studying
1
Q

BGP

A

Border Gateway Protocol

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

OSPF

A

Open Shortest Path First

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

Open Shortest Path First

A
  • Internal gateway protocol
  • Used on primarily smaller scale network
  • The fastest route is preferred over shortest
  • IP protocol
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Border Gateway Protocol

A
  • External gateway protocol (only EGP used)
  • Mostly used on large scale networks such as the internet
  • Best path is determined for the datagram
  • TCP Protocol
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

EIGRP

A

Enhanced Interior Gateway Routing Protocol

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

Routing protocol

A

A set of messages, rules, and algorithms used by routers for the overall purpose of learning routes. This process includes the exchange and analysis of routing information. Each router chooses the best route to each subnet (path selection) and finally places those best routes in its IP routing table. Examples include RIP, EIGRP, OSPF, and BGP.

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

Routed protocol and routable protocol

A

Both terms refer to a protocol that defines a packet structure and logical addressing, allowing routers to forward or route the packets. Routers forward packets defined by routed and routable protocols. Examples include IP Version 4 (IPv4) and IP Version 6 (IPv6).

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

Routing Protocol Functions

A
  1. Learn routing information about IP subnets from neighboring routers.
  2. Advertise routing information about IP subnets to neighboring routers.
  3. If more than one possible route exists to reach one subnet, pick the best route based on a metric.
  4. Convergence
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Convergence

A

all the routers collectively realize something has changed in topology, advertise the information about the changes to all the other routers, and all the routers then choose the currently best routes for each subnet.

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

IGP

A

(interior gateway protocols)A routing protocol that was designed and intended for use inside a single autonomous system (AS)

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

EGP

A

(exterior gateway protocols)A routing protocol that was designed and intended for use between different autonomous systems

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

Autonomous system (AS)

A

network under the administrative control of a single organization

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

Routing protocol algorithm

A

Three branches of RPA exist for IGP routing protocols:
-Distance vector (DV) (sometimes called Bellman-Ford after its creators)
-Advanced distance vector (sometimes called “balanced hybrid”)
-Link-state (LS)

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

Routing Information Protocol (RIP)

A

first popularly used IP distance vector protocol

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

VLSM

A

variable-length subnet masks.

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

Route Redistribution

A

router can take routes learned by OSPF and advertise them into EIGRP, and vice versa

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

Administrative Distance

A

-A number that denotes how believable an entire routing protocol is on a single router.
-When IOS must choose between routes learned using different routing protocols

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

LSA & LSDB

Study These Flashcards
A

Link-State Advertisements
Link-State Advertisement databases

19
Q

Dijkstra Shortest Path First (SPF)

Study These Flashcards
A

link-state protocols type of math algorithm

20
Q

Three phases of how OSPF routers accomplish exchanging LSAs and calculating routes

Study These Flashcards
A
  1. Becoming neighbors
  2. Exchanging databases
  3. Adding the best routes
21
Q

Becoming neighbors

Study These Flashcards
A

A relationship between two routers that connect to the same data link, created so that the neighboring routers have a means to exchange their LSDBs.

22
Q

Exchanging databases

Study These Flashcards
A

The process of sending LSAs to neighbors so that all routers learn the same LSAs.

23
Q

Adding the best routes

Study These Flashcards
A

The process of each router independently running SPF, on their local copy of the LSDB, calculating the best routes, and adding those to the IPv4 routing table.

24
Q

OSPF Hello messages

Study These Flashcards
A

-The Hello message follows the IP packet header, with IP protocol type 89.
-packets are sent to multicast IP address 224.0.0.5, a multicast IP address intended for all OSPF-speaking routers.
-OSPF routers listen for packets sent to IP multicast address 224.0.0.5, in part hoping to receive Hello packets and learn about new neighbors.

25
RID
Router ID -32-bit numbers that are part of the Hello Message. -Most command output lists these as dotted-decimal numbers (DDN). -By default, IOS chooses one of the router’s interface IPv4 addresses to use as its OSPF RID. -OSPF RID can be directly configured
26
Link-State Update (LSU) packet
OSPF messages that actually send the LSAs between neighbors
27
Routers monitor each neighbor relationship using two related timers:
Hello Interval and the Dead Interval
28
Three maintenance tasks for maintaining Neighbors and the LSDB
-Maintain neighbor state by sending Hello messages based on the Hello Interval and listening for Hellos before the Dead Interval expires -Flood any changed LSAs to each neighbor -Reflood unchanged LSAs as their lifetime expires (default 30 mins)
29
OSPF Ethernet network type
defaults to use a network type of broadcast, which causes OSPF to elect one of the routers on the same subnet to act as the designated router (DR).
30
“All SPF Routers” multicast address “All SPF DRs” multicast address
224.0.0.5 224.0.0.6
31
DROthers
routers that are neither a DR nor a BDR
32
Problems with a single area design include the following:
- A larger topology database requires more memory on each router. - The SPF algorithm requires processing power that grows exponentially compared to the size of the topology database. - A single interface status change anywhere in the internetwork (up to down, or down to up) forces every router to run SPF again.
33
OSPF Areas
- Put all interfaces connected to the same subnet inside the same area. - An area should be contiguous. - Some routers may be internal to an area, with all interfaces assigned to that single area. - Some routers may be Area Border Routers (ABR) because some interfaces connect to the backbone area, and some connect to non-backbone areas. - All non-backbone areas must have a path to reach the backbone area (area 0) by having at least one ABR connected to both the backbone area and the non-backbone area.
34
Area Border Router (ABR)
An OSPF router with interfaces connected to the backbone area and to at least one other area
35
Backbone router
A router connected to the backbone area (includes ABRs)
36
Internal router
A router in one area (not the backbone area)
37
Area
A set of routers and links that shares the same detailed LSDB information, but not with routers in other areas, for better efficiency
38
Backbone Area
A special OSPF area to which all other areas must connect— area 0
39
Intra-area route
A route to a subnet inside the same area as the router
40
Interarea route
A route to a subnet in an area of which the router is not a part
41
Summary LSA
- Does not include topology - List subnet Id and mask in other areas
42
Arguing for the use of multiple areas in larger OSPF networks
-Routers require fewer CPU cycles to process the smaller per-area LSDB with the SPF algorithm, reducing CPU overhead and improving convergence time. - The smaller per-area LSDB requires less memory. - Changes in the network (for example, links failing and recovering) require SPF calculations only on routers in the area where the link changed state, reducing the number of routers that must rerun SPF. -Less information must be advertised between areas, reducing the bandwidth required to send LSAs.
43
DR & BDR
Designated router and Backup designated router
44
(OSPFv2) LSA
-One router LSA for each router in the area -One network LSA for each network that has a DR plus one neighbor of the DR -One summary LSA for each subnet ID that exists in a different area

CCNA (3 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions