Routing Logic
Routing Logic
Routing Logic
Part 2
Remember:
A Routed Protocol defines logical addressing. Most notable example on the test IP A Routing Protocol fills the routing table with routing information. Examples on the test RIP, IGRP, EIGRP, OSPF, IS-IS
Interior Routing Protocols used to distribute routing information inside a single organization.
Ex: RIP, IGRP, EIGRP, OSPF, IS-IS
Classless or Classful
Classless routing protocols transmit the subnet mask along with each route in the routing updates sent by that protocol. Classful routing protocols do not transmit mask information. Only classless routing protocols support VLSM. To say that a routing protocol is classless is to say that it supports
Administrative Distances
The administrative distance (AD) is used to rate the trustworthiness of routing information received on a router from a neighbor router. An administrative distance is an integer from 0 to 255, where 0 is the most trusted and 255 means NO traffic will be passed via this route.
Split Horizon reduces incorrect routing information and routing overhead by enforcing the rule that routing information cannot be sent back in the direction from which it was received.
Holddown Timers
There are 3 instances when triggered updates will reset the holddown timer:
1) The holddown timer expires 2) Another update is received with a better metric 3) A flush time, which is the time a route would be held before being removed, removes the route from the routing table when the timer expires.
OSPF Logic
1) Each router discovers its neighbors on each interface. The list of neighbors is kept in a neighbor table. 2) Each router uses a reliable protocol to exchange topology information with its neighbors. 3) Each router places the learned topology information in its topology database.
OSPF
A link-state protocol uses a neighbor table and a topology database in addition to adding routes to the routing table. OSPF converges more quickly than do distance-vector protocols. Uses Hello packets to keep in touch with neighbors. Defined in RFC 2328
Referred to as a hybrid routing protocol Provides support for IP, IPX, and Appletalk Best path selection using the Diffusing Update Algorithm (DUAL)
EIGRP
Before EIGRP routers exchange routes with each other, they must become neighbors. There are three conditions that must be met for neighborship establishment:
1) Hello or ACK received 2) AS numbers match 3) Identical metrics
Try a
Quiz!