IP Routing Flashcards

1
Q

What is a router on a stick consisted of

A

A layer 2 switch which cannot route information with separate vlans out of different ports, so it is connected to a router via a trunk port to be able to route between vlans

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

What is a SVI & routed port

A

With a layer 3 switch, you have a virtual interface (with ip address) for each VLAN, which represents all ports that belong to the VLAN so internal routing is possible, OR if you want a routed port, you assign a port on the switch to a router port and connect the switch to a router (assign an IP to the port)

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

What does SVI stand for

A

Switch Virtual Interface

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

What does OSPF stand for

A

Open shortest path first

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

What versions of OSPF are for IPv4 and IPv6

A

OSPFv2 only covers IPv4 while OSPFv3 covers IPv6

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

What is OSPF’s Admin Distance

A

110

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

What type of routing protocol is OSPF

A

Link State

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

What is characteristic of OSPF

A

Establishes adjacencies with other routers by sending Link State Advertisements to routers in an area, Constructs a link state database from link state advertisements

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

What does OSPF find the best path based on?

A

Cost, which is a function of bandwidth

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

How does a router send a packet down the right path

A

It attempts to inject the best path into an IP routing table (populates routing information table) to be injected into IP table

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

What is a neighbor

A

A neighbor is a router that reside on the same network link, exchange hello messages with one another BUT NOT NECESSARY Link State Advertisements

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

What is an adjacency

A

An adjacency are routers that are neighbors, have exchanged Link State Updates and Data Description Packets; Only adjacencies construct a link state database

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

What does each OSPF topology have?

A

Area 0, a backbone area, or 0.0.0.0

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

What’s the requirement for having multiple areas in the OSPF model?

A

Each non-backbone area should connect to the backbone area.

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

What are routers with interfaces in more than one area called

A

Area Border Router (ABR)

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

What is one way that Cisco does not recommend but can allow you to directly connect any non-backbone area to a backbone area

A

Establish a virtual link between the two areas

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

What is one way that Cisco does not recommend but can allow you to directly connect any non-backbone area to a backbone area

A

Establish a virtual link between the two Area Border Routers

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

How do you calculate cost of an OSPF route?

A

Cost = reference bandwidth / interface bandwidth

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

What is the default reference bandwidth?

A

100 Mbps

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

What happens if your OSPF cost is a decimal?

A

You round up to the next nearest number

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

What is the command to set a higher reference bandwidth for OSPF

A

auto-cost reference-bandwidth value

22
Q

What’s the solution to not having a full adjacency for all routers in a network

A

Elect a DR and a BDR

23
Q

What are the addresses for OSPF config

A

224.0.0.5 for All OSPF router multicast and 224.0.0.6 for All designated routers (top 2) FF02::5 and FF02::6 for IPv6 respectively

24
Q

How is a DR elected?

A

DR election goes first then BDR, router with highest OSPF priority wins 0 = don’t run 1 = default up to 255 (can be statically set), Router with highest id becomes DR if that’s not enough (highest IP of router loopback or non-loopback = router id)

25
Q

What does it mean that DR system is non-preemptive

A

If you add a router with a higher ID and OSPF priority to an existing configuration, the new router will not become the DR

26
Q

Tell me about a OSPF Broadcast network (DR, Default Hello Interval, static neighbors?)

A

Will elect a DR and BDR, Default Hello Interval of 10 sec, Can use multicast to dynamically discover neighbors (ie 6 routers connected to a broadcast median such as a switch)

27
Q

Tell me about a Point To Point Network

A

A Router connected to another router over a WAN
No need to elect a DR and BDR as there’s only one other router to discover, Default Hello 10 sec, Can discover other router so no need for static assignment

28
Q

Tell me about a Non-Broadcast (NBMA)

A

Elects a DR& sometimes BDR but you have to make sure the DR is openly adjacent to the rest of the routers
Statically configure neighbors
Hello Interval is 30 seconds

29
Q

Tell me about a point to multipoint network

A

Topologically looks like a non-broadcast type with a router connected to frame relay and 3 other routers connected via WAN
No DR and BDR needed since each dashed line is a point to point connection Hello Interval of 30 seconds no need for static neighbors

30
Q

What is the default OSPF type for ethernet networks

A

broadcast

31
Q

What is the default OSPF type for frame relay and point to point sub-interfaces

A

Point to Point

32
Q

What is the default OSPF type on frame replay physical interfaces and multiple sub-interfaces

A

Non-Broadcast

33
Q

How do you change the OSPF type of a network

A

in a specific interface, type: ip ospf network

34
Q

What happens when you change a timer to align with a neighbor but both are set to different OSPF connections

A

showing a neighbor would be possible but routes from the network will not be received

35
Q

What is the administrative distance of EIGRP

A

90

36
Q

What is the administrative distance of RIP

A

120

37
Q

What are some benefits of EIGRP

A

fast convergence time (that is if one path fails, you can find a new route quickly)
Load balance over unequal cost links
Supports variable length subnet masks
Used to be proprietary to Cisco

38
Q

What is the multicast address that EIGRP communicates over

A

224.0.0.10 or FF02::A

39
Q

What are 4 components of EIGRP

A

Neighbor discovery (automatic), Reliable Transport Protocol (EIGRP packets get there and in the right order), packets only sent when needed, Protocol Dependent Modules (can handle multiple protocols) including IPv4 IPv6 AppleTalk IPX, etc.

40
Q

What is DUAL

A

DUAL Diffusing Update Algorithm, figures out which neighbor is the most efficient, next hop router successor, successor route

41
Q

What is a feasible successor

A

A neighbor that can still get to the destination but not the most efficient one (which is known as the successor)

42
Q

What are the 3 data structures of EIGRP and what do they do

A

Neighbor Table - holds info about the router’s adjacent EIGRP neighbors show ip eigrp neighbors
Interface Table - show info about interfaces participating in EIGRP
show ip eigrp interfaces
Topology Table - shows routes known to EIGRP
show ip eigrp topology

43
Q

What’s the default hello interval and hold time for a EIGRP timer

A

5 and 15, hold time tells the other router how long to count down before assuming the neighbor is no longer available

44
Q

Do timers have to match between EIGRP neighbors?

A

No

45
Q

How do you access the timers of a router running EIGRP

A

show ip eigrp interfaces

46
Q

What is the requirement to be a feasible successor

A

The reported distance must be < the feasible distance to become a feasible successor

47
Q

What is the reported distance

A

How far a particular router is from its destination

48
Q

What is the feasible distance

A

The Neighbor Distance + Reported Distance

49
Q

How is the successor route determined (EIGRP)

A

The path with the feasible distance is considered the successor route

50
Q

Variance

A

a feature that allows EIGRP to load-balance across a network’s successor route and one or more feasible successor routes.

51
Q

Unequal Cost Load Balancing

A

When routes have different metrics and costs, you can set the variance which says to include all routes smaller than n times the successor route’s metric where n is the variance (n = 1 = equal cost load balancing)