Dynamic Routing and Static Generation

JJ Kasper

Routing Protocol Basics All dynamic routing protocols are built around an algorithm. Generally, an algorithm is a step-by-step procedure for solving a problem. A routing algorithm must, at a minimum, specify the following: A procedure for passing reachability information about networks to other routers A procedure for receiving reachability information from other routers A procedure for determining optimal routes based on the reachability information it has and for recording this information in a route table A procedure for reacting to, compensating for, and advertising topology changes in an internetw_ork A few issues common to any routing protocol are path determination, metrics, convergence, and load balancing. Path Determination All networks within an internetwork must be connected to a router, and wherever a router has an interface on a network that interface must have an address on the network. This address is the originating point for reachability information.</p>