There are a couple factors make EIGRP converge faster:
1. Even EIGRP is a flat routing protocol, it does support
some features of hierarchical routing protocols, such
as address summary, VLSM and supernet. (vs RIP)
2. EIGRP does incremental updates (vs RIP)
3. EIGRP routing process stores all the neighbor's routing
table, which causes covergence faster.
For example, in case a single network link fails, in OSPF,
all the routers in the same area will re-calculate the whole
routing table. Depends on the topology, EIGRP may only
affect a few routers (vs Link-State)
4. Compares to OSPF, EIGRP routing process requires
less memory and CPU time . Depends on the size
of the network. In small networks, EIGRP has more
overheads than other routing protocols.
Jim Xie.
At 10:10 AM 06/08/2000 -0500, Winchester, Derek S. wrote:
>Looking for an educated answer other than the book definitions that explain
>Convergence in Eigrp: What feature or why is Convergence in Eigrp faster
>than other Link-state and distance vector protocols. I would like it in the
>words that actually makes sense. I know that it is faster, and I know that
>Dual makes convergence simpler and fast, but in words of the common man,
>WHY?
>
>
>___________________________________
>UPDATED Posting Guidelines: http://www.groupstudy.com/list/guide.html
>FAQ, list archives, and subscription info: http://www.groupstudy.com
>Report misconduct and Nondisclosure violations to [EMAIL PROTECTED]
___________________________________
UPDATED Posting Guidelines: http://www.groupstudy.com/list/guide.html
FAQ, list archives, and subscription info: http://www.groupstudy.com
Report misconduct and Nondisclosure violations to [EMAIL PROTECTED]
