Routing Protocol Acronyms Flashcards
AS
Autonomous System
BGP
Border Gateway Protocol
An Exterior Gateway Protocol (EGP). It allows Autonomous Systems (AS’s) to be able to discover each other.
Path Vector | Neither Link-State nor Distance Vector
It’s pretty much the only EGP in use today, and it’s what makes the Internet work.
EGP
Exterior Gateway Protocol
Includes BGP
EIGRP
Enhanced Interior Gateway Routing Protocol (Cisco)
Metric = Bandwidth + Delay
Hybrid | Not Link-State or Distance Vector, more like Advanced Distance Vector
GLBP
Gateway Load Balancing Protocol (Cisco)
Similar to HSRP and VRRP for redundancy, but also provides load balancing capabilities.
HSRP
Hot Standby Router Protocol (Cisco)
Has an active router and a passive router on standby in case the active router goes down.
IGP
Interior Gateway Protocol
Includes RIP, RIPv2, OSPF, EIGRP, and IS-IS
IS-IS
Intermediate System to Intermediate System
Link-State
Dijkstra’s algorithm
OSPF
Open Shortest Path First
Link-State
Dijkstra’s Algorithm
Metric = Bandwidth
RIP
Routing Information Protocol
Distance Vector
Slow convergence
RIPv1 - Classful
RIPv2 - Classless
RIPv2
Routing Information Protocol version 2
Distance Vector
Sends entire routing table every 30 seconds.
Slow convergence.
RIPv1 - Classful
RIPv2 - Classless
VRRP
Virtual Router Redundancy Protocol
Just like Hot Standby Routing Protocol, but is an open standard. Has a master router and a backup router.
FHRP
First Hop Redundancy Protocol
Provides a virtual IP to use as a default gateway that multiple routers can share. This can be done to have a standby default gateway if the original goes down, or with GLBP it can also provide load balancing functions.
Distance Vector
Routers share their entire routing table with neighbors at regular intervals.
They make decisions based on how many hops (or other simple metrics) it takes to reach a destination.
Link-State
Routers exchange information about directly connected links and build a complete topology map of the network.
They use algorithms like Dijkstra’s to calculate the shortest path.