Soru

Zorluk: ZorRouting Concepts and Dynamic Routing Protocols

A network administrator is auditing an enterprise multi-protocol routing environment. Match each dynamic routing protocol on the left with its corresponding default administrative distance, primary metric calculation method, and underlying algorithm on the right.

  • Internal EIGRPDefault AD of 90; uses a composite metric based on minimum bandwidth and cumulative delay via DUAL.
  • eBGPDefault AD of 20; relies on path attributes including Autonomous System path lists via a path-vector algorithm.
  • OSPFDefault AD of 110; uses cost calculated from reference bandwidth divided by interface bandwidth via Dijkstra's SPF algorithm.
  • RIPv2Default AD of 120; uses hop count as its sole metric with a maximum limit of 15 hops via the Bellman-Ford algorithm.

Cevap

Internal EIGRP matches Administrative Distance 90 with composite bandwidth/delay metrics; eBGP matches Administrative Distance 20 with path-vector AS-Path metrics; OSPF matches Administrative Distance 110 with cost metrics via Dijkstra; RIPv2 matches Administrative Distance 120 with hop count metrics via Bellman-Ford.
Each dynamic routing protocol correctly maps to its standardized default Administrative Distance (eBGP=20, Internal EIGRP=90, OSPF=110, RIPv2=120) and matching metric/algorithm characteristics.

Adım Adım Çözüm

1
Determine the default Administrative Distance (AD) for each dynamic routing protocol.
eBGP has AD 20, Internal EIGRP has AD 90, OSPF has AD 110, and RIPv2 has AD 120.
Administrative Distance defines source trustworthiness when different protocols learn identical destination prefixes.
2
Associate each protocol with its underlying path computation algorithm and metric scheme.
Internal EIGRP uses DUAL with bandwidth/delay; eBGP uses Path Vector with AS-Path; OSPF uses Dijkstra SPF with interface cost; RIPv2 uses Bellman-Ford with hop count.
Each protocol type utilizes distinct algorithmic mechanisms to compute loop-free paths.

Anahtar Kavram

Routing protocol Administrative Distance hierarchies, underlying path calculation algorithms, and metric evaluation mechanisms.
Bu soruyu puanla