Advanced Distance Vector routing protocol.
DUAL Algorithm
Neighbor relations
Sends only incremantal updates
Unequal-Cost Load Sharing
Packet Types:
Hello
Update
Query
Reply
Ack
Neighborship Requirements:
Receive Hello from neighbor
AS Number must match
K values must match
Simplified Metric
10^7 total delay
256 * ( ------------ + in tens )
Min.BW(Kbit) of microseconds
3 Tables
Neighbor
Topology
Routing
Feasibility condition :
For a route to be considered feasible successor, the FD > AD.
Commands
ip hello-interval eigrp as-number seconds
ip hold-time eigrp autonomous-system-number seconds
bandwidth
ip bandwidth-percent eigrp as-number percent
variance
eigrp stub { receive-only | connected | summary | static }
ip summary-address as-number address mask
No comments:
Post a Comment