Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
121 Cards in this Set
- Front
- Back
ASBR
|
Connects to different domain
|
|
ABR
|
Connects different areas
|
|
Backbone
|
At least one interface in Area 0
|
|
Internal
|
All interfaces in same area
|
|
Type 1 Flood
|
Entire Area
|
|
Type 2 Flood
|
Entire Area
|
|
Type 3 Flood
|
Entire AS
|
|
Type 5 Flood
|
Entire AS
|
|
Type 6 Flood
|
Entire AS
|
|
LSA Type 1
|
Router
Route links and state Flooded in the area of orig. |
|
LSA Type 2
|
Network
Generated by DR Lists all attached routers flooded in the area of orig. |
|
LSA Type 3
|
Network Summary
Generated by ABRs set into an area to advertise prefixes in other areas flooded through the AS |
|
LSA Type 4
|
ASBR Summary
generated by ABRs advertises the ASBR flooded throughout the AS |
|
LSA Type 5
|
AS External
generated by the ASBR advertises external destination flooded throughout the AS |
|
LSA Type 7
|
NSSA External
generated by the ASBR in NSSA advertises external destination |
|
Allows you to see LSA in the OSPF database
|
show ip ospf database
|
|
An OSPF router in area 0 that connects to another AS and Area
|
Considered a backbone router, ABR, and ASBR
|
|
What router in an OSPF AS generates a Type 2 LSA
|
DR
|
|
What router in an OSPF AS generates a Type 5 LSA
|
ASBR
|
|
What type of area do you have in OSPF if you note Type 7 LSAs in use?
|
NSSA
|
|
Backbone Area
|
Area 0
|
|
Backbone Area Truths
|
All inter-area traffic passes through the backbone
The backbone summarizes each area to each other area The area must be labeled 0 or 0.0.0.0 |
|
What connects one OSPF AS to another OSPF AS or an Area that does not connect directly to Area 0?
|
Virtual Link
|
|
Stub Area
|
Blocks type 4,5 (external types)
receives 1 type 3 default route from ABR to reach external and internal |
|
Stub Area restrictions
|
No Virtual Links permitted in or through area
|
|
Totally Stubby
|
Allows 1,2 from ABR
Blocks 3, 4, 5 |
|
Not so stubby
|
(ASBR)External routes propagated as type 7 to ABR
|
|
Command for summarization from one area to another
|
area range
|
|
Summarization of external prefixes
|
summary-address
|
|
Main reason to summarize in OSPF
|
To reduce the convergence domain size
|
|
OSPF Algorithm
|
Dijkstra Shortest path first
|
|
OSPF P2P Link Adjacency
|
P2P links - neighbors become fully adjacent
Occurs through exchanges of hello packets Once adjacent LSDB synched DROTHERS maintain partial relationship with each other |
|
OSPF LAN Adjacency
|
LAN - all routers form adjacency with DR and BDR
Occurs through exchanges of hello packets Once adjacent LSDB synched |
|
OSPF P2P Link Adjacency
|
No DR / BDR
|
|
OSPF LAN Adjacency
|
DR / BDR
|
|
DR / BDR election
|
Highest IP address or Highest Priority value
|
|
DR / BDR priority value
|
default is 1, non-preemptive
set to 0 to disallow router to become DR |
|
OSPF NBMA Adjacency
|
DR / BDR
Manual neighbor config (unicast) |
|
NBMA
|
Non-Broadcast Multi-Access
|
|
DR
|
Designated Router
|
|
BDR
|
Backup Designated Router
|
|
OSPF P2MP Adjacency
|
No DR/BDR
|
|
OSPF P2MP Non-Broadcast Adjacency
|
No DR/BDR
Manual neighbor config (unicast) |
|
True or false there is a DR in an NBMA network type
|
True
|
|
True or false setting a higher priority on a device does not preempt the existing DR
|
True
|
|
OSPF Graceful Restart
|
Also known as NSF or NSR
Stabilizes the peer devices as well |
|
On dual proc systems, its the ability to continue forwarding traffic while restarting control plane of the second processor
|
OSPF Graceful restart
|
|
Graceful restart
|
Also available for IS-IS, EIGRP, LDP, and BGP
|
|
OSPF Graceful restart peers
|
They need to be able to understand the graceful restart messaging
|
|
What does a device use to forward traffic during a restart if it is capable of OSPF Graceful Restart?
|
Hardware-Based forwarding
|
|
OSPF Neighbor list empty
|
Not properly configured on interfaces
Layer 1 or 2 issue Passive interface Access list block error in layer 3 interface config hello or dead time mismatch auth config error area id mismatch stub flag mismatch secondary IP addressing issue incorrect network type config |
|
OSPF Stuck in ATTEMPT state
|
misconfigured neighbor statement
unicast non-functional in NBMA environment |
|
OSPF Stuck in INIT state
|
Hellos being blocked in one direction
Multicast nonfunctional on one side Authentication only on one side Broadcast keyword missing from map command |
|
OSPF Stuck in TWO-WAY State
|
Priority of 0 on all routers
neighbor stuck in EXSTART mismatched MTU Duplicated Router IDs Broken unicast connectivity |
|
OSPF Stuck in LOADING State
|
Mismatched MTU
Corrupted link-state request |
|
Name two network types you might configure in OSPF over frame relay that do not use a DR
|
P2P and P2MP
|
|
OSPF Version 2 RFC
|
2328
|
|
OSPF Multicast address (All SPF)
|
224.0.0.5
|
|
OSPF Multicast address (All DR)
|
224.0.0.6
|
|
State DOWN
|
This is the first OSPF neighbor state. It means that no information (hellos) has been received from this neighbor, but hello packets can still be sent to the neighbor in this state.
|
|
OSPF Neighbor State Attempt
|
This state is only valid for manually configured neighbors in an NBMA environment. In Attempt state, the router sends unicast hello packets every poll interval to the neighbor, from which hellos have not been received within the dead interval
|
|
OSPF Neighbor State Init
|
This state specifies that the router has received a hello packet from its neighbor, but the receiving router's ID was not included in the hello packet.
|
|
OSPF Neighbor State 2-Way
|
This state designates that bi-directional communication has been established between two routers. Bi-directional means that each router has seen the other's hello packet.
|
|
OSPF Neighbor State Exstart
|
In this state, the routers and their DR and BDR establish a master-slave relationship and choose the initial sequence number for adjacency formation.
|
|
OSPF Neighbor State Exchange
|
In the exchange state, OSPF routers exchange database descriptor (DBD) packets.
|
|
OSPF Neighbor State Loading
|
In this state, the actual exchange of link state information occurs.
|
|
OSPF Neighbor State FULL
|
In this state, routers are fully adjacent with each other. All the router and network LSAs are exchanged and the routers' databases are fully synchronized.
|
|
configure ospf priority
|
interface sub-config mode
ip ospf priority 1 |
|
Routing between AS's
|
BGP
|
|
BGP Features
|
Reliable updates
Triggered updates Rich metrics Extremely scalable |
|
True or false BGP discovers neighbors
|
False, BGP requires manual neighbor configuration
|
|
BGP uses TCP port #
|
179
|
|
This command is used for Internal BGP and external BGP peerings
|
neighbor remote-as
|
|
Assumed to be directly connected
|
eBGP
|
|
Use this command when eBGP neighbors are not directly connected
|
neighbor ebgp-multihop
|
|
This command is used to advertise prefixes in BGP
|
network
|
|
True or false the prefix must be in the routing table for the BGP network command to advertise the prefix
|
True
|
|
iBGP split horizon
|
An iBGP learned route will not be forwarded on to another iBGP peer.
|
|
Ways around BGP Split horizon
|
route reflector
confederations full mesh |
|
DUAL
|
Diffusing Update Algorithm
|
|
True or False Auto-summary is enabled by default with EIGRP
|
True
|
|
The 5 EIGRP Metrics
|
Bandwidth (weakest link)
Delay (sum for path) Reliability Load MTU |
|
Real metrics used by EIGRP
|
Bandwidth
Delay |
|
CIR
|
Committed Information Rate
|
|
K value
|
constant value, coordinate the use of metrics in the metric formula
|
|
true or false K values must match between your EIGRP speakers
|
True
|
|
True or false reliability and load are not considered by default in EIGRP
|
True
|
|
True or false it is the weakest link bandwidth that is considered in the calculation in EIGRP
|
True
|
|
True or False MTU does not have a corresponding K Value
|
True
|
|
What is feasible distance?
|
the cost between the local router and the destination prefix
|
|
What does the feasible distance consist of?
|
the cost to the next hop, added to the cost that the next hop is advertising to the local router (Advertised Distance)
|
|
What is a Successor?
|
the best (lowest cost) route to a destination
|
|
What is a feasible successor?
|
The second best route
|
|
What is required of Feasible successors next hop? Feasibility condition..Loop prevention measure DUAL takes
|
next hop must have Advertised Distance less than the current FD of the successor
|
|
Another name for advertised distance is
|
Reported Distance
|
|
Successor
|
The best path to the destination
|
|
FD
|
cost from local device to destination
|
|
Feasible successor
|
the second best path
|
|
Advertised distance (AD)
|
cost from the next hop to destination
|
|
Passive
|
network available
State seen in show ip eigrp topology |
|
Active
|
network unavailable
State seen in show ip eigrp topology |
|
Update
|
network is being updated
State seen in show ip eigrp topology |
|
Query
|
Outstanding query wait for ACK
State seen in show ip eigrp topology |
|
Reply
|
generating a reply to a Query
State seen in show ip eigrp topology |
|
SIA (Stuck in active)
|
convergence problem
State seen in show ip eigrp topology |
|
Describe the rule for the selection of a Feasible Successor route in EIGRP and why does the condition exist?
|
The feasibility condition states that the advertised distance (AD) of a potential Feasible successor route must be less than the Feasible Distance (FD) of the current successor route. This is a loop prevention mechanism.
|
|
Use of MTU in the EIGRP metric calculation...
|
MTU is a tiebreaker and is not actually used in the calculation of the EIGRP metric
|
|
True or false EIGRP is plug and play
|
False
|
|
EIGRP passive routes are better than active routes true or false
|
True
|
|
In the EIGRP topology table, what is the ( x/x )
|
(FD/AD)
|
|
describe two methods of scoping queries of EIGRP
|
Queries can be scoped using summarization or the EIGRP stub feature
|
|
Describe the EIGRP SIA problem
|
As EIGRP router sends a query becuase a route has been removed from the EIGRP topology table and there is no feasible successor route. If the query is not responded to by a neighbor within a certain time limit, the neighbor relationship between the devices resets
|
|
PBR
|
Policy Based routing
|
|
PBR is built using what
|
Route map
|
|
PBR traffic is matched based on
|
Access list protocol or app
Access list source and/or destination Layer 3 packet length |
|
What type of behaviors can be set by PBR
|
Next hop
output interface default next hop or interface |
|
PBR only affects traffic...
|
through the router
|
|
benefits for multi-area OSPF
|
reduction in SPF calculations
Memory and CPU utilization reduction in routing table size |
|
Valid reasons an OSPF neighborship might not form:
|
timer mismatch
stub flag setting MTU mismatch |
|
highest to lowest preference for OSPF route selection process:
|
intra-area
inter-area External type 1 External type 2 |
|
two modes for router under IETF NSF
|
restarting mode
helper mode |