From: Petr Lapukhov (petrsoft@gmail.com)
Date: Mon Jun 12 2006 - 05:09:19 ART
Well, that sounds like a BSCI question. There is actually not that
much of LS in EIGRP. EIGRP keeps track of neighbors, and also
has topology table.
But these things are quite different from LS counterparts!
EIGRP is DV in it's nature, since it sends prefixes and distances
in every update. LS protocols use adjacencies to flood link state
advertisement, and their topology table contains whole network
topology, built from link-advertisements.
The biggest difference of EIGRP from classic DV is it's distributed
nature of route computation and triggered behavior.
Sophisticated DUAL algorithm is described in paper of Garcia-Luna
Aceves, which I used to find and read back in days :)
LS routing protocols also have some DV-behavior in them. For instance,
OSPF treats external and inter-area LSA in DV manner. This is
actually why you need area 0 in OSPF :)
So the thing I want to say, if that EIGRP is not an LS protocol in any
sense.
It has some mechanisms _similar_ to LS protocols, but their actual behavior
is very different.
HTH
Petr
2006/6/12, Radioactive Frog <pbhatkoti@gmail.com>:
>
> *Hi Group,*
>
> * What are the features commonly associated with link-state protocols that
> EIGRP uses.*
>
> Regards,
>
> Frog
>
> _______________________________________________________________________
> Subscription information may be found at:
> http://www.groupstudy.com/list/CCIELab.html
This archive was generated by hypermail 2.1.4 : Sat Jul 01 2006 - 07:57:32 ART