IP routing essentials Flashcards
What is the purpose of a router
To forward traffic between different network segments.
How does a router learn about route paths
from static and dynamic routing protocols
What is a dynamic routing protocol
A protocol that distributes network topology information between routers and provide ongoing updates to the topology without physical intervention. A dynamic routing protocol will attempt to select the best loop free path to the destination in the current network.
What is an Autonomous System (AS)
Is a network of systems running the same dynamic routing protocol and managed under the same network administration.
What is an Interior gateway protocol
a routing protocol optimised for routing within an AS
What is an exterior gateway protocol
a routing protocol optimised for routing between AS’s
What are the different types of dynamic routing algorithms
Distance Vector
Enhanced Distance Vector
Link State
Path Vector
What is a distance vector algorithm
determines the best route for data packets based on distance.
What routing protocol uses a distance vector algorithm
RIPv2
What is the metric used in RIP
Hops to destination
Does RIP have a complete map of the network topology
NO
What is the advantage of RIP
very low CPU resource consumed.
What is the main disadvantage of RIP
It relies purely on hop count, no consideration is taken into the bandwidth of the link.
What is an enhanced distance vector algorithm
It is an enhanced version of distance vector that relies on more than just distance(hops) to calculate the metric.
What routing protocol uses an enhanced distance vector algorithm
EIGRP
What is the metric used in EIGRP
by default (total path delay + minimum bandwidth)
Does EIGRP have a complete map of the network topology
No
What is the advantage of EIGRP
Rapid convergence time
updates are only sent when there is an update.
Uses multiple attributes to calculate metric not just hop count.
Supports un-equal cost multi pathing
What is a link state algorithm, and how does it identify the best path
Each router advertises every connect & directly connected routes and the state of that link to each other router. When the entire topology is learnt. Then Dijkstra’s algorithm is ran to identify the shortest path
What are the advertisement packets called in:
OSPF
IS-IS
OSPF: LSA
IS-IS: LSP