| Chapter
Review |
|
| Chapter
Overview |
|
| 6.1 |
EIGRP Concepts
| 6.1.1 |
Backward
Compatibility with IGRP |
| 6.1.2 |
EIGRP Design |
| 6.1.3 |
EIGRP Support
for Novell IPX RIP and SAP |
| 6.1.4 |
EIGRP
Terminology |
|
|
| 6.2 |
EIGRP Technology
| 6.2.1 |
EIGRP
Features |
| 6.2.2 |
Neighbour
Discovery and Recovery |
| 6.2.3 |
Reliable
Transport Protocol |
| 6.2.4 |
The Diffused Update Algorithm |
| 6.2.5 |
Protocol-Specific
Modules |
|
|
| 6.3 |
EIGRP Data Structure
|
|
| 6.4 |
Convergence Using EIGRP
| 6.4.1 |
DUAL
Algorithm and Feasible Secession |
| 6.4.2 |
Alternative
Paths |
|
|
| 6.5 |
Enhanced IGPR Operation
| 6.5.1 |
Building the
Neighbor Table |
| 6.5.2 |
Discovering
Routes |
| 6.5.3 |
Choosing
Routes |
| 6.5.4 |
Maintaining
Routes |
|
|
| 6.6 |
Configuring EIGRP
| 6.6.1 |
Configuring
EIGRP for IP |
| 6.6.2 |
Configuring
EIGRP Support for IPX |
| 6.6.3 |
Configuring
EIGRP for IPS SAP Updates |
| 6.6.4 |
EIGRP for IPX
SAP Configuration Example |
|
|
| 6.7 |
Summarizing EIGRP Routes for
IP
| 6.7.1 |
Classful
Boundary |
| 6.7.2 |
Manual
Summarization Example |
|
|
| 6.8 |
Verifying Enhanced IGRP
Operation
|
|
| Chapter
Summary |
|
| Chapter
Quiz
|
|