EIGRP--A Fast Routing Protocol based on Distance Vectors
R. Albrightson, Jose Joaquin Garcia-Luna-Aceves, J. Boyle · eScholarship (California Digital Library) · 1994
Early routing protocols were based on distance vectors; they were very simple and easy to implement but had the severe drawbacks of counting to in nity and routing loops.These problems were reduced using such techniques as split horizon and hold-downs; however, for these techniques to work in practice, long convergence times are introduced.Routing protocols based on link states have been implemented to address the problem of slow convergence in distance-vector protocols, but they add complexity i n con guration and troubleshooting.We present a new distance-vector protocol that converges as quickly as current link-state protocols, while maintaining loop freedom at every instant.The protocol is based on three main elements: a transport algorithm that supports the reliable exchange of messages among routers, the diusing update algorithm, which computes shortest paths distributedly, and modules that permit the operation of the new routing protocol in a multiprotocol environment.