Courseiva
Networking FundamentalshardMultiple ChoiceObjective-mapped

JN0-106 Networking Fundamentals Practice Question

Exhibit

Mar 15 10:00:00 R1 rpd[2345]: RPD_OSPF_NBRDOWN: OSPF neighbor 10.0.0.2 (ge-0/0/0) state changed from Full to Down (event: KillNbr)
Mar 15 10:00:01 R1 rpd[2345]: RPD_OSPF_NBRUP: OSPF neighbor 10.0.0.2 (ge-0/0/0) state changed from Down to Full

Refer to the exhibit. The OSPF neighbor adjacency repeatedly goes up and down on R1. What is a likely cause?

⚠ Common exam trap

It's easy for candidates to assume physical link flapping (Option A) is the cause, but OSPF adjacency flapping can occur with a stable link due to Layer 3 mismatches like MTU, which is a subtle but classic JNCIA-JUNOS exam topic.

Answer choices

Why each option matters

Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.

Correct answer & explanation

MTU mismatch between the two routers

An MTU mismatch between OSPF neighbors can cause the adjacency to flap because OSPF includes the interface MTU in the Database Description (DBD) packets. If the MTU values do not match, the receiving router will reject the DBD packet, preventing the exchange of LSAs and causing the neighbor state to reset. This is a common cause of repeated up/down OSPF adjacencies even when the physical link is stable.

Answer analysis

Option-by-option breakdown

For each option: why learners choose it and why it is or isn't the right answer here.

  • The physical link is flapping

    Why it's wrong here

    Link flapping would cause the physical interface to transition between up and down, generating syslog messages such as "Physical link down" and "Physical link up," and the OSPF adjacency would drop and immediately restart based on interface state changes. The exhibit shows the neighbor adjacency repeatedly cycling through non-full states without any interface state change, which is inconsistent with a flapping physical link. Additionally, link flapping affects all routed protocols, whereas an MTU mismatch selectively impacts adjacency formation while keeping the interface operational.

  • MTU mismatch between the two routers

    Why this is correct

    MTU mismatch is the correct answer because OSPF uses Database Description (DBD) packets to exchange link-state summaries, and these packets can exceed the interface MTU. When a router receives a DBD packet larger than its configured MTU, it silently drops the packet, causing the neighbor to remain stuck or repeatedly restart the ExStart/Exchange process. The router that is the slave in the exchange will detect the mismatch via the MTU field in the DBD packet and cycle back to ExStart, which produces the repeated adjacency behavior shown in the exhibit.

  • OSPF authentication is misconfigured

    Why it's wrong here

    Authentication misconfiguration would cause OSPF hello packets to be discarded or rejected, producing "authentication failed" log messages at each hello interval. The neighbor would remain in the Down or Attempt state and never progress to ExStart, because no hello packets would successfully pass the authentication check. In the exhibit, the adjacency is repeatedly being attempted and reaching the database exchange phase, which would be impossible if authentication were failing on every hello packet.

  • The routers are in different OSPF areas

    Why it's wrong here

    If the routers were in different OSPF areas, the area ID is carried in the OSPF header, and a mismatch causes incoming Hello packets to be silently dropped. As a result, the neighbor would never leave the Down state, and no adjacency would be attempted. Because the exhibit explicitly shows the neighbor adjacency repeatedly forming and then resetting across multiple states, an area mismatch cannot explain the behavior—it would prevent any progression beyond Down.

Visual reference

R1 R2 R3 R4 10 100 10 100 OSPF picks R1→R2→R4 (cost 20) over R1→R3→R4 (cost 200)

Quick reference

Routing Protocol Comparison

ProtocolMetricMax HopsAlgorithmType
RIP v2Hop count15Bellman-FordDistance vector
OSPFCost (bandwidth)UnlimitedDijkstra (SPF)Link state
EIGRPComposite metricUnlimitedDUALHybrid
IS-ISCostUnlimitedDijkstraLink state
BGPPolicy / attributesUnlimitedPath vectorPath vector

RIP's 15-hop limit makes it unsuitable for large networks. OSPF and EIGRP dominate modern enterprise deployments.

About these practice questions

Courseiva writes every JN0-106 question from scratch — 156 in total, each with an explanation and a wrong-answer breakdown. None are copied from real exams or dumps. Learn why practice questions differ from exam dumps →

How Courseiva writes practice questions · Editorial policy

JA

Written by Johnson Ajibi, MSc IT Security

Senior Network & Security Engineer · founder of Courseiva

This JN0-106 practice question is part of Courseiva's free Juniper Networks certification practice question bank. Courseiva provides original exam-style practice questions with explanations, topic-based practice, mock exams, readiness tracking, and study analytics to help learners prepare for the JN0-106 exam.