Skip to main content

Posts

EIGRP data structure

EIGRP data structure 3.1.5 Like OSPF, EIGRP relies on different types of packets to maintain its tables and establish relationships with neighbor routers. This page will describe these packet types. The following are the five types of EIGRP packets: Hello Acknowledgment Update Query Reply EIGRP relies on hello packets to discover, verify, and rediscover neighbor routers. Rediscovery occurs if EIGRP routers do not receive hellos from each other for a hold time interval but then re-establish communication. EIGRP routers send hellos at a fixed, but configurable interval called the hello interval. The default hello interval depends on the bandwidth of the interface. On IP networks, EIGRP routers send hellos to the multicast IP address 224.0.0.10. EIGRP routers store information about neighbors in the neighbor table. The neighbor table includes the Sequence Number (Seq No) field to record the number of the last received EIGRP packet that each neighbor sent. The ...

EIGRP technologies

EIGRP technologies 3.1.4 This page will discuss some of the new technologies that EIGRP includes. Each new technology represents an improvement in EIGRP operation efficiency, speed of convergence, or functionality relative to IGRP and other routing protocols. These technologies fall into one of the following four categories: Neighbor discovery and recovery Reliable Transport Protocol DUAL finite-state machine algorithm Protocol-dependent modules Simple distance vector routers do not establish any relationship with their neighbors. RIP and IGRP routers merely broadcast or multicast updates on configured interfaces. In contrast, EIGRP routers actively establish relationships with their neighbors, much the same way that OSPF routers do. EIGRP routers establish adjacencies as described in Figure . EIGRP routers use small hello packets to accomplish this. Hellos are sent by default every five seconds. An EIGRP router assumes that as long as it rec...

EIGRP design features

EIGRP design features 3.1.4 This page will describe some key design features of EIGRP. EIGRP operates quite differently from IGRP. EIGRP is an advance distance vector routing protocol, but also acts as a link-state protocol in the way that it updates neighbors and maintains routing information. The following are advantages of EIGRP over simple distance vector protocols: Rapid convergence Efficient use of bandwidth Support for VLSM and CIDR. Multiple network layer support Independence from routed protocols. Independence from routed protocols means that protocol-dependent modules (PDMs) protect EIGRP from lengthy revision. As routed protocols evolve, they may need new protocol modules, but changes to EIGRP will not be necessary. EIGRP routers converge quickly because they rely on DUAL. DUAL guarantees loop-free operation throughout a route computation which allows all routers involved in a topology change to synchronize at the same time. ...