25.02.2013 Views

TCP/IP Tutorial and Technical Overview - IBM Redbooks

TCP/IP Tutorial and Technical Overview - IBM Redbooks

TCP/IP Tutorial and Technical Overview - IBM Redbooks

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

EIGRP processes the information in the topology table to determine the best<br />

paths to each destination network. EIGRP implements an algorithm known as<br />

Diffusing Update ALgorithm (DUAL).<br />

Route recomputation<br />

For a specific destination, the successor is the neighbor router currently used for<br />

packet forwarding. This device has the least-cost path to the destination <strong>and</strong> is<br />

guaranteed not to be participating in a routing loop. A feasible successor<br />

assumes forwarding responsibility when the current successor router fails. The<br />

set of feasible successors represent the devices that can become a successor<br />

without requiring a route recomputation or introducing routing loops.<br />

A route recomputation occurs when there is no known feasible successor to the<br />

destination. The successor is the neighbor router currently used for packet<br />

forwarding. The process starts with a router sending a multicast query packet to<br />

determine if any neighbor is aware of a feasible successor to the destination. A<br />

neighbor replies if it has an feasible successor.<br />

If the neighbor does not have a feasible successor, the neighbor can return a<br />

query indicating it also is performing a route recomputation. When the link to a<br />

neighbor fails, all routes that used that neighbor as the only feasible successor<br />

require a route recomputation.<br />

5.7.2 EIGRP packet types<br />

EIGRP uses five types of packets to establish neighbor relationships <strong>and</strong><br />

advertise routing information:<br />

► Hello/acknowledgement: These packets are used for neighbor discovery.<br />

They are multicast advertised on each network segment. Unicast responses<br />

to the hello packet are returned. A hello packet without any data is considered<br />

an acknowledgement.<br />

► Updates: These packets are used to convey reachability information for each<br />

destination. When a new neighbor is discovered, unicast update packets are<br />

exchanged to allow each neighbor to build their topology table. Other types of<br />

advertisements (for example, metric changes) use multicast packets. Update<br />

packets are always transmitted reliably.<br />

► Queries <strong>and</strong> replies: These packets are exchanged when a destination enters<br />

an active state. A multicast query packet is sent to determine if any neighbor<br />

contains a feasible successor to the destination. Unicast reply packets are<br />

sent to indicate that the neighbor does not need to go into an active state<br />

because a feasible successor has been identified. Query <strong>and</strong> reply packets<br />

are transmitted reliably.<br />

214 <strong>TCP</strong>/<strong>IP</strong> <strong>Tutorial</strong> <strong>and</strong> <strong>Technical</strong> <strong>Overview</strong>

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!