| 3.1 Introduction and Adantages |
|---|
| 3.1.1 Perspective and Background |
| 3.1.2 Network Discovery and routing table maintenance |
| 3.1.3 Advantages |
| 3.2 Classifying Dynamic Routing Protocols |
|---|
| 3.2.1 Overview |
| 3.2.2 IGP and EGP |
| 3.2.3 Distance Vector and Link State |
| 3.2.4 Classful and Classless |
| 3.2.5 Convergence |
| 3.3 Metrics |
|---|
| 3.3.1 Purpose of a Metric |
| 3.3.2 Metrics and Routing Protocols |
| 3.3.3 Load Balancing |
| 3.4 Administrative Distances |
|---|
| 3.4.1 Purpose of Administrative Distance |
| 3.4.2 Dynamic Routing Protocols |
| 3.4.3 Static Routes |
| 3.4.4 Directly Connected Networks |
| 3.5 Routing Protocols and Subnetting Activities |
|---|
| 3.5.1 Identifying Elements of the Routing Table |
| 3.5.2 Subnetting Scenario 1 |
| 3.5.3 Subnetting Scenario 2 |
| 3.5.4 Subnetting Scenario 3 |