OSPF Neighbor Adjacencies Flashcards

1
Q

When does an adjacency occur?

A

when connected neighbors use Hello packets to agree on unique and common attributes - the exchanged parameters in the Hello packets need to match

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

What parameters must match in OSPF Hello to form an adjacency? (8)

A
  1. Area ID
  2. Hello interval
  3. Dead interval
  4. Interface MTU
  5. Network Type
  6. Authentication (if used)
  7. Stub Flags
  8. Subnet/mask
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What parameters in Hello packets do not need to match?

A
  • OSPF router ID (has to be different on both routers)
  • list of neighbors reachable on the interface
  • router priority
  • DR IP address
  • Backup DR IP address
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are the two different neighborship that can exist?

A
  • 2-Way Neighbors
    • neighbors recognize each other and send Hello to each other
    • neighbors didn’t exchange LSAs with each other - no topology information was exchanged
  • Fully Adjacent Neighbors
    • LSAs were exchanged, link state databases match
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is usually the default value for the Hello packet interval?

A

10 seconds

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

How is the Dead Interval calculated?

A

as 4 times of the Hello Interval

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

What are the 8 different adjacency states in OSPF?

A
  1. Down
  2. Attempt
  3. Init
  4. 2-Way State
  5. ExStart
  6. Exchange
  7. Loading
  8. Full
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Describe the Down adjacency state

A

no Hellos have been received from neighbor

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

Describe the Attempt adjacency state

A

unicast Hello packet has been sent to neighbor, but no Hello packet has been received back

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

Describe the Init adjacency state

A
  • an OSPF router has sent an OSPF Hello packet to its neighbor and is waiting for a response
  • the router has detected a potential neighbor on the link but has not yet confirmed the neighborship
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Describe the 2-Way State adjacency state

A
  • router received a hello packet from neighbor and the neighbor acknowledged hello packet
  • router ID of the initializing router is sent back from the neighbor (acknowledges that two routers receive each other packets)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Describe the ExStart adjacency state

A
  • first step of actual adjacency
  • master and slave relationship is formed where master has higher router-id
  • master chooses the starting sequence number for the database descriptor packets that are used for actual LSA exchange
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Describe the Exchange adjacency state

A
  • local link state database is sent through DBD packets
  • DBD sequence number is used for reliable acknowledgement/retransmission
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Describe the Loading adjacency state

A

Link State Request packets are sent to ask for more information about a particular LSA

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

Describe the Full adjacency state

A

neighbours are fully adjacent and databases synchronized

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