| 4.1 Introduction to Distance Vector Routing Protocols |
|---|
| 4.1.1 Distance Vector Routing Protocols |
| 4.1.2 Distance Vector Technology |
| 4.1.3 Routing Protocol Algorithms |
| 4.1.4 Creating a network map of the environment |
| 4.1.5 Routing Protocols Characteristics |
| 4.2 Network Discovery |
|---|
| 4.2.1 Cold Stat |
| 4.2.2 Initial Exchange of Routing Information |
| 4.2.3 Exchange of Routing Information |
| 4.2.4 Convergence |
| 4.3 Network Discovery |
|---|
| 4.3.1 Periodic Updates: RIPv1 and IGRP |
| 4.3.2 Bounded Updates |
| 4.3.3 Triggered Updates |
| 4.3.4 Random Jitter |
| 4.4 Routing Loops |
|---|
| 4.4.1 Definition and Implications |
| 4.4.2 Problem: Count to Infinity |
| 4.4.3 Setting a Maximum |
| 4.4.4 Preventing Routing Loops with Holddown Timers |
| 4.4.5 Split Horizon Rule |
| 4.4.6 Split HOrizon with Poison Reverse or Route Poisoning |
| 4.4.7 IP and TTL |
| 4.5 Distance Vector Routing Protocols today |
|---|
| 4.5.1 RIP and EIGRP |