W8L3 - Dynamic Internal Routing : OSPF Flashcards
What is distance? What things may be taken into account?
How expensive a link is to use
- hop count
- transmission delay
- capacity
- cost
IGP
Interior Gateway Protocol
EGP
Exterior Gateway Protocol
How does Distribution Calculation work (Bellman Ford)
Computes shortest path from single source by approximating distances that are replaced with better ones until the solution is reached
What is Internal Routing
A network controlled by one entity where all routers share all info with others in network
OSPF
Open Shortest Path First
What process do routers use to share their info in OSPF
Flooding
Dijkstra’s Algorithm
Calculates optimal topology from current position.
Finds the lowest cost path from a single nodes perspective.
Produces routing table consisting of
- Destination
- Next hop
- Distance
How is link failure detected in OSPF?
Lack of a periodic message from the neighbor
Who is OSPF standardized by?
IEFT (Internet Engineering Task Force)
It what sized networks is OSPF typically found?
Medium to large
What are the benefits of dynamic routing protocols?
Less tedious than manually reconfiguration when links change
Less error prone (humans are useless)
Better at failure response (humans are still useless)
Computes shortest path from single source by approximating distances that are replaced with better ones until the solution is reached
How does Distribution Calculation work (Bellman Ford)
A network controlled by one entity where all routers share all info with others in network
What is Internal Routing
Calculates optimal topology from current position.
Finds the lowest cost path from a single nodes perspective.
Produces routing table consisting of
- Destination
- Next hop
- Distance
Dijkstra’s Algorithm
