Skip to main content

Explain administrative distance and how it affects route selection.

Administrative Distance (AD) is a concept in networking — specifically in routing protocols — that determines the trustworthiness or priority of a route when multiple routing sources offer paths to the same destination.

Explain administrative distance and how it affects route selection.

🧠 What Is Administrative Distance?

It’s a numerical value (from 0 to 255) that routers use to rank routes from different sources.

  • Lower AD = Higher Trust

  • If multiple routes exist to the same destination, the router chooses the one with the lowest AD.

πŸ“Š Common Administrative Distance Values (Cisco Defaults)

Route SourceAD Value
Directly connected0
Static route1
EIGRP (internal)90
OSPF110
RIP120
External EIGRP170
Unknown / Untrusted255 (never used)

πŸ“¦ Example Scenario

Let’s say a router learns about the same destination network 10.0.0.0/24 from:

  • OSPF (AD 110)

  • EIGRP (AD 90)

Even if the OSPF route has a shorter metric (e.g., fewer hops), the router will prefer the EIGRP route because it has a lower administrative distance.

🎯 Why It Matters

  • Prevents routing conflicts: Helps routers resolve which route to install in the routing table.

  • Useful in fallback scenarios: You can configure a backup static route with a higher AD so it only takes over if the preferred route fails.

  • Ensures stability: Avoids route flapping between protocols of different trust levels.

πŸ”§ Can You Change AD?

Yes. Most routers allow you to manually adjust the administrative distance:

  • To influence route selection.

  • To prefer one protocol over another even if it’s not the default.

  • For policy-based routing, traffic engineering, or backup routing.

✅ Summary

TermDefinition
Administrative DistanceA numeric value representing the trust level of a routing source.
Lower ADMeans more trusted, gets installed in the routing table over higher AD routes.
PurposeHelps the router choose the best route when multiple protocols suggest routes to the same destination.

Popular posts from this blog

How does BGP prevent routing loops? Explain AS_PATH and loop prevention mechanisms.

 In Border Gateway Protocol (BGP), preventing routing loops is critical — especially because BGP is the inter-domain routing protocol used to connect Autonomous Systems (ASes) on the internet. πŸ”„ How BGP Prevents Routing Loops The main mechanism BGP uses is the AS_PATH attribute . πŸ” What is AS_PATH? AS_PATH is a BGP path attribute that lists the sequence of Autonomous Systems (AS numbers) a route has traversed. Each time a route is advertised across an AS boundary, the local AS number is prepended to the AS_PATH. Example: If AS 65001 → AS 65002 → AS 65003 is the route a prefix has taken, the AS_PATH will look like: makefile AS_PATH: 65003 65002 65001 It’s prepended in reverse order — so the last AS is first . 🚫 Loop Prevention Using AS_PATH ✅ Core Mechanism: BGP routers reject any route advertisement that contains their own AS number in the AS_PATH. πŸ” Why It Works: If a route makes its way back to an AS that’s already in the AS_PATH , that AS kno...

What’s the impact of BGP full routes on router memory and performance?

Receiving full BGP routes (i.e., the full global BGP routing table) has a significant impact on a router's memory and performance. Here's a breakdown of the key impacts: πŸ”§ 1. Memory Usage (RAM) A full BGP table typically contains ~1 million IPv4 routes and growing (~200k+ IPv6 routes). Each BGP route consumes tens to hundreds of bytes of memory, depending on attributes (AS path, communities, etc.). This translates to hundreds of megabytes to several gigabytes of RAM just for storing the BGP RIB (Routing Information Base). The FIB (Forwarding Information Base) , which is installed into the router's hardware or kernel for actual packet forwarding, also consumes memory (especially in TCAM for hardware routers). ❗ Example A router might require 4–8 GB of RAM (or more) to comfortably handle full BGP routes with headroom for growth and stability. 🧠 2. CPU Utilization High CPU load during: Initial BGP session establishment (parsing all rout...

Explain the OSPF LSDB (Link State Database) and how SPF (Shortest Path First) algorithm works.

OSPF (Open Shortest Path First) is a link-state routing protocol , and the LSDB (Link-State Database) and SPF (Shortest Path First) algorithm are core to how OSPF calculates the best paths . Let’s break them down. 🧠 What is the OSPF LSDB (Link-State Database)? The LSDB is a map of the entire OSPF network area — each router stores a complete topology of its area. πŸ” Details: Built from LSAs (Link-State Advertisements) exchanged between routers. Contains info about: Routers and their interfaces Network segments Neighbor relationships Each OSPF router maintains an identical LSDB within the same area. ✅ Key Characteristics: Feature Description Scope One LSDB per OSPF area Source Built from received LSAs Consistency All routers in an area have identical LSDBs Purpose Used as input for SPF algorithm to calculate best paths ⚙️ How the SPF Algorithm Works in OSPF OSPF uses Dijkstra’s Shortest Path First (SPF) algorithm to compute the shortest (lowest-cost)...