1. Static Routing
1.1. primary uses
1.1.1. Providing ease of routing table maintenance in smaller networks that are not expected to grow significantly.
1.1.2. Routing to and from a stub network, which is a network with only one default route out and no knowledge of any remote networks.
1.1.3. Accessing a single default route (which is used to represent a path to any network that does not have a more specific match with another route in the routing table).
1.2. advantage
1.2.1. easy to implement in a small network.
1.2.2. very secure. no advertisements are sent as compared to dynamic routing protocols.
1.2.3. route to destination is always the same.
1.3. disadvantage
1.3.1. suitable only for simple topologies or fro special purposes such as a default static route.
1.3.2. configuration complexity increase dramatically as network grows.
1.3.3. manual intervention required to re-route traffic.
2. Dynamic Routing Protocols
2.1. Uses
2.1.1. Dynamic routing protocols help the network administrator manage the time-consuming and exacting process of configuring and maintaining static routes.
2.2. advantages
2.2.1. suitable in all topologies where multiple routers are required.
2.2.2. generally independent of the network size
2.2.3. automatically adapts topology to reroute traffic if possible.
2.3. disadvantages
2.3.1. can be more complex to implement
2.3.2. less secure.additional configuration setting are required to secure.
2.3.3. route depends on the current topology
2.3.4. requires additional CPU,ram, and link bandwidth.
3. Dynamic Routing Protocol
3.1. purpose
3.1.1. Discovery of remote networks
3.1.2. Maintaining up-to-date routing information
3.1.3. Choosing the best path to destination networks
3.1.4. Ability to find a new best path if the current path is no longer available
3.2. components
3.2.1. Data structures
3.2.1.1. Routing protocols typically use tables or databases for its operations. This information is kept in RAM.
3.2.2. Routing protocol messages
3.2.2.1. Routing protocols use various types of messages to discover neighboring routers, exchange routing information, and other tasks to learn and maintain accurate information about the network.
3.2.3. Algorithm
3.2.3.1. An algorithm is a finite list of steps used to accomplish a task. Routing protocols use algorithms for facilitating routing information and for best path determination.
4. routing protocol classification
4.1. distance vector
4.1.1. RIPv2
4.1.2. Enhanced IGRP (EIGRP)
4.2. link-state
4.2.1. Open Shortest Path First (OSPF)
4.2.2. Intermediate System-to-Intermediate System (IS-IS)
4.3. path vector
4.3.1. Border Gateway Protocol (BGP)