Network Engineer interview questions
100 real questions with model answers and explanations for Middle candidates.
See a Network Engineer resume example →Practice with flashcards
Spaced repetition · Hunter Pass
Questions
Static routing offers explicit control and low protocol overhead, while dynamic routing adapts reachability as topology changes.
- Static routes suit stable paths, defaults, and tightly controlled exceptions but require manual lifecycle management.
- Dynamic protocols discover alternate paths and converge after failures at the cost of control-plane traffic and complexity.
- Many networks combine both, with redistribution or preference rules defining how the route sources interact.
Why interviewers ask this: The interviewer checks whether you can compare operational behavior rather than only configuration syntax.
The RIB contains candidate and selected routes from routing sources, while the FIB contains optimized entries used to forward packets.
- Routing protocols and static configuration contribute routes to the control-plane RIB.
- The best routes and resolved next hops are programmed into the data-plane FIB.
- A platform may keep several candidate paths in the RIB even though only selected paths reach the FIB.
Why interviewers ask this: A strong answer separates control-plane route selection from data-plane forwarding.
Forwarding uses the longest matching prefix, while route installation for an identical prefix compares source preference and then protocol metrics.
- A more specific /24 is used instead of a covering /16 regardless of the /16 source's lower administrative distance.
- For the same prefix, administrative distance selects between sources such as static, OSPF, and EIGRP.
- The chosen protocol's metric ranks paths learned through that protocol, with equal-cost paths potentially installed together.
Why interviewers ask this: The interviewer checks whether you avoid comparing administrative distance across routes with different prefix lengths.
OSPF floods link-state advertisements within an area so routers can build a synchronized topology database and run SPF.
- LSAs describe routers, links, networks, and reachability rather than directly sending a complete route table as distance-vector updates.
- Each router independently runs Dijkstra's algorithm from itself as the root.
- The resulting shortest-path tree supplies next hops and costs for routes installed into the routing table.
Why interviewers ask this: A good answer connects LSA flooding, LSDB synchronization, SPF, and route installation.
OSPF neighbors need compatible interface and area parameters before their state machines can reach Full where adjacency is expected.
- Area ID, authentication, hello and dead timers, and key network parameters must be compatible.
- Router IDs must be unique, and IP connectivity must exist on the shared link.
- Stub-area flags and MTU behavior can also prevent successful database exchange even after Hellos are seen.
Why interviewers ask this: The interviewer evaluates whether you know adjacency as a negotiated protocol relationship with several prerequisites.
OSPF elects a designated router and backup to reduce adjacency count and LSA exchange on multiaccess segments.
- Other routers form full adjacencies with the DR and BDR instead of every router fully adjoining every other router.
- Election uses interface priority first and router ID as a tie-breaker.
- The election is non-preemptive, so a later router with a higher priority does not automatically replace the current DR.
Why interviewers ask this: A strong answer explains scalability, election inputs, and non-preemptive behavior.
OSPF areas limit detailed topology flooding and SPF scope, while area border routers exchange reachability between areas.
- Routers inside an area share that area's LSDB rather than every link-state detail in the entire domain.
- ABRs connect non-backbone areas to area 0 and maintain separate area databases.
- Summarization at area boundaries can reduce route count and isolate some topology changes.
Why interviewers ask this: The interviewer checks whether you understand areas as a control-plane scaling boundary.
OSPF adds outgoing interface costs along a path and prefers the route with the lowest total cost.
- Cost is commonly derived from reference bandwidth divided by interface bandwidth.
- The reference bandwidth must be set consistently so modern high-speed links remain distinguishable.
- Administrators can set interface cost explicitly when policy should differ from the bandwidth-derived value.
Why interviewers ask this: A good answer covers cumulative cost, reference bandwidth, and explicit policy.
EIGRP uses DUAL to select a successor as the best loop-free path and may retain feasible successors as safe backups.
- The successor has the lowest feasible distance for the destination.
- A neighbor qualifies as a feasible successor when its reported distance is lower than the current feasible distance.
- A feasible successor can be installed quickly after failure without first running a network-wide query.
Why interviewers ask this: The interviewer checks whether you understand the loop-free backup rule rather than only EIGRP's metric.
eBGP exchanges routes between autonomous systems, while iBGP distributes BGP routes within one autonomous system.
- eBGP adds the local AS to AS_PATH when advertising routes across an AS boundary.
- iBGP does not advertise routes learned from one iBGP peer to another by default, requiring full mesh or route reflectors.
- Their default session assumptions and next-hop handling differ, although policy can modify much of the behavior.
Why interviewers ask this: A strong answer distinguishes administrative scope and the iBGP advertisement rule.
BGP evaluates ordered attributes and policy, commonly including weight, local preference, locally originated status, AS_PATH, origin, MED, and eBGP versus iBGP.
- Higher local preference is favored throughout an AS, while shorter AS_PATH is generally preferred later in the process.
- Lower MED can suggest a preferred entry point to a neighboring AS under comparable conditions.
- The exact order and vendor-specific attributes must be verified for the platform in use.
Why interviewers ask this: The interviewer checks whether you understand BGP selection as ordered policy rather than shortest physical distance.
Local preference tells routers inside an AS which exit to prefer, while MED suggests to a neighboring AS which entry point to use.
- Higher local preference wins and is propagated to iBGP peers within the AS.
- Lower MED is preferred and is normally compared among paths received from the same neighboring AS.
- Local preference directly controls outbound choice, whereas MED is a suggestion the neighboring network may ignore or override.
Why interviewers ask this: A good answer separates outbound policy inside an AS from an inbound hint sent to another AS.
Redistribution can create loops, feedback, suboptimal paths, and inconsistent reachability when different protocol semantics meet.
- Metrics must be translated because OSPF, EIGRP, and other protocols measure paths differently.
- Route tags and filtering help prevent routes from being redistributed back into their source.
- Redistribution points should be few, deliberate, documented, and paired with explicit prefix policy.
Why interviewers ask this: The interviewer evaluates whether you treat redistribution as a controlled policy boundary.
MPLS separates transport labels from service context so a provider can carry isolated customer routes across a shared core.
- Provider-edge routers assign customer routes to VRFs and attach VPN labels.
- Core label-switching routers forward transport labels without needing customer route tables.
- MP-BGP distributes VPN routes and labels between provider edges while route targets control import and export.
Why interviewers ask this: A strong answer connects labels, VRFs, the provider core, and MP-BGP at a conceptual level.
STP elects the switch with the lowest bridge ID as root, then each non-root switch selects its lowest-cost path toward that root.
- Bridge ID combines bridge priority, extended system ID, and MAC address.
- Root path cost is the sum of port costs along the path.
- Ties are resolved through ordered BPDU fields such as sender bridge ID and sender port ID.
Why interviewers ask this: The interviewer checks whether you can derive STP decisions from bridge ID and cumulative path cost.
STP assigns root and designated roles while keeping redundant non-designated or alternate ports non-forwarding.
- Each non-root switch has one root port providing its best path toward the root bridge.
- Each segment has one designated port providing the best path from that segment toward the root.
- Redundant ports that would create a loop remain non-forwarding and can become active after a topology change.
Why interviewers ask this: A good answer explains each role relative to the root and a network segment.
RSTP uses explicit proposal and agreement handshakes and simplified port states to activate safe links more quickly.
- It uses discarding, learning, and forwarding states instead of the longer classic sequence.
- Alternate ports provide immediately known backup paths toward the root.
- Edge ports can enter forwarding directly when they are known not to connect another switch.
Why interviewers ask this: The interviewer checks whether you know the mechanisms behind faster convergence rather than only the protocol name.
BPDU Guard protects edge ports from unexpected switches, while Root Guard prevents a port from accepting a superior root claim.
- BPDU Guard commonly disables an edge port that receives a BPDU.
- Root Guard places the port into a root-inconsistent state while superior BPDUs continue.
- Both features enforce topology intent but apply to different trust assumptions and port roles.
Why interviewers ask this: A strong answer distinguishes endpoint protection from root-election protection.
Allowed VLANs define which tagged VLANs cross a trunk, while the native VLAN defines handling for untagged frames.
- Pruning unused VLANs limits unnecessary broadcast reach and accidental exposure.
- Native VLAN mismatches can place untagged traffic into different broadcast domains at each end.
- Both sides should use an explicit, consistent native VLAN policy and matching allowed lists.
Why interviewers ask this: The interviewer checks whether you understand trunk scope and the risk of native-VLAN mismatch.
EtherChannel members must have compatible physical and Layer 2 settings so they operate as one logical link.
- Speed, duplex, access or trunk mode, native VLAN, and allowed VLANs must agree.
- The channel protocol and group configuration must match the intended bundle.
- STP sees the port-channel as one logical link, preventing individual members from being blocked separately.
Why interviewers ask this: A good answer connects configuration consistency to bundling and STP behavior.
Locked questions
- 21
How do LACP active and passive modes interact?
- 22
How is traffic distributed across EtherChannel member links?
distributedswitching - 23
What does VXLAN add to a switched data-center network?
switchingdatacenter - 24
How does VLSM improve IPv4 address allocation?
ip-addressing - 25
How would a /24 be allocated with VLSM for subnets needing 100, 50, and 20 hosts?
networkingip-addressing - 26
What conditions allow several routes to be summarized into one prefix?
routing - 27
What is the main trade-off of aggressive route summarization?
routing - 28
How do standard and extended IPv4 ACLs differ?
- 29
How do wildcard masks work in IPv4 ACL entries?
network-security - 30
How do ACL order, direction, and implicit deny affect packet filtering?
network-security - 31
How do Layer 2 CoS and Layer 3 DSCP markings support QoS?
qos - 32
How do QoS policing and shaping differ?
qos - 33
Why are multiple queues and a strict-priority queue used in QoS?
data-structuresqos - 34
How do DNS delegation, NS records, and glue records work together?
dnsnetwork-servicesdelegation - 35
How do recursive and authoritative DNS servers differ?
dnsnetwork-servicesrecursion - 36
How does a DHCP relay deliver leases across routed subnets?
networkingip-addressingrouting - 37
How do global unicast, unique local, link-local, and multicast IPv6 addresses differ?
ip-addressing - 38
How do Router Advertisements, SLAAC, and DHCPv6 participate in IPv6 configuration?
ip-addressingroutingconfig - 39
How does IPv6 Neighbor Discovery replace and extend ARP?
protocolsip-addressing - 40
What IPv6 design practices differ from common IPv4 subnetting?
designnetworkingip-addressing - 41
How do IPsec transport and tunnel modes differ?
network-security - 42
Why is GRE often combined with IPsec?
network-security - 43
How does an SSL or TLS remote-access VPN differ from a site-to-site IPsec VPN?
tlsnetwork-security - 44
How do Layer 4 and Layer 7 load balancers differ?
load-balancing - 45
How do health checks and load-balancing algorithms affect backend selection?
health-checksalgorithms - 46
What is session persistence in load balancing and what trade-off does it create?
load-balancingsessions - 47
How do static NAT, dynamic NAT, and PAT differ?
networkingnetwork-services - 48
What do inside local, inside global, outside local, and outside global mean in NAT terminology?
networkingnetwork-services - 49
What state does PAT maintain for return traffic?
- 50
How do destination NAT and port forwarding publish an internal service?
networkingnetwork-services - 51
An OSPF adjacency is stuck in EXSTART or EXCHANGE; how would you troubleshoot it?
problem-solvingrouting - 52
An OSPF neighbor remains in INIT; what evidence would you collect?
routing - 53
OSPF neighbors are FULL but an expected prefix is missing; how would you trace it?
routing - 54
An OSPF adjacency flaps every few minutes; how would you find the cause?
routing - 55
An eBGP session alternates between Idle and Active; how would you troubleshoot it?
sessions - 56
A BGP session is ESTABLISHED but no prefixes are received; what would you inspect?
sessionsrouting - 57
A BGP prefix is received but not installed in the routing table; how would you explain it?
routing - 58
Outbound traffic uses one ISP but inbound traffic returns through another; how would you assess the BGP policy?
routing - 59
Route redistribution creates a loop between OSPF and BGP; how would you stop it?
routingredis - 60
Traffic to one subnet is blackholed after route summarization; how would you correct it?
networkingip-addressingrouting - 61
A switch network shows a broadcast storm and MAC flapping; how would you contain and diagnose it?
switching - 62
The wrong switch became STP root; how would you correct the topology safely?
switching - 63
A port-channel is up on one member but traffic is unstable; how would you troubleshoot it?
- 64
A VLAN works on some access switches but not others; how would you trace the misconfiguration?
switching - 65
A native VLAN mismatch appears on a trunk; how would you assess and fix it?
switching - 66
A MAC address repeatedly moves between switch ports; how would you determine whether it is a loop or a legitimate move?
switching - 67
An SVI is up but hosts in its VLAN cannot reach other networks; how would you investigate?
switching - 68
Clients lose connectivity during an HSRP or VRRP failover; what would you verify?
high-availability - 69
How would you break down high application latency across a network path?
planninglatency - 70
Packet loss appears only during peak utilization; how would you locate the bottleneck?
trackingtroubleshooting - 71
Average interface utilization is low but output drops increase; how would you investigate microbursts?
types - 72
A GRE or IPsec tunnel passes small traffic but stalls on large packets; how would you fix it?
network-security - 73
A high-bandwidth WAN link gives poor TCP throughput; how would you analyze it?
networkingprotocolsthroughput - 74
How would you build a QoS policy for voice and business-critical traffic on a congested WAN edge?
qos - 75
A QoS policy is configured but traffic still enters the default queue; how would you troubleshoot it?
qosconfigdata-structures - 76
Voice calls break up even though the WAN is not fully utilized on average; how would you investigate QoS?
qos - 77
How would you design ACLs between user, server, and management networks?
design - 78
An ACL permits the forward flow but return traffic still fails; how would you trace it?
network-security - 79
How would you deploy a large ACL change without accidentally blocking critical traffic?
network-securitydeployment - 80
A site-to-site IPsec VPN cannot complete IKE negotiation; how would you troubleshoot it?
network-security - 81
IKE is established but the IPsec tunnel passes no traffic; what would you inspect?
network-security - 82
Only some subnets work through a policy-based IPsec VPN; how would you correct it?
network-securitynetworkingip-addressing - 83
Traffic through two redundant VPN gateways is intermittent; how would you check asymmetric routing?
network-securitygateway - 84
A TLS handshake fails after TCP connects; how would you read the Wireshark trace?
networkingprotocolstls - 85
Wireshark flags retransmissions, out-of-order packets, and duplicate ACKs; how would you interpret them?
packet-analysis - 86
A TCP capture shows frequent zero-window announcements; what would you investigate?
networkingprotocols - 87
How would you correlate router and firewall logs during a short connectivity outage?
networkingroutingnetwork-security - 88
How would you combine SNMP and NetFlow to investigate recurring WAN congestion?
monitoring - 89
How would you segment users, servers, guests, and network management in a new office?
- 90
How would you enforce segmentation without creating unmanageable firewall policy?
network-securitynetworking - 91
Two AWS VPCs attached to a Transit Gateway cannot communicate; how would you trace the routes?
gatewayroutingcommunication - 92
An SD-WAN application keeps selecting a poor path; how would you tune the policy?
wan - 93
An MPLS L3VPN site receives some remote prefixes but not others; how would you isolate the issue?
wan - 94
Hosts in the same VXLAN segment work on one leaf but not across leaf switches; what would you verify?
switchingdatacenter - 95
How would you use Ansible to make a repeatable network configuration change?
configansible - 96
How would you detect and correct configuration drift across Cisco and Juniper devices?
configiac - 97
How would you plan packet captures for an intermittent asymmetric failure?
- 98
What operational outputs would you compare when the same routing issue appears on Cisco IOS-XE and Juniper Junos?
- 99
A WAN circuit is consistently near capacity; how would you decide between QoS, traffic engineering, and an upgrade?
capacityqos - 100
After a network change, one application is slow across sites while other traffic is normal; how would you investigate end to end?