Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
EIGRP uses a feasibility condition to ensure that only loop-free routes are ever
selected. The feasibility condition is conservative: when the condition is true, no
loops can occur, but the condition might under some circumstances reject all routes
to a destination although some are loop-free.
Operation
DUAL uses three separate tables for the route calculation. These tables are created
using information exchanged between the EIGRP routers. The information is different
than that exchanged by link-state routing protocols. In EIGRP, the information
exchanged includes the routes, the "metric" or cost of each route, and the
information required to form a neighbor relationship (such as AS number, timers,
and K values). The three tables and their functions in detail are as follows:
For a route to become a feasible successor, its RD must be smaller than the FD of
the successor. If this feasibility condition is met, there is no way that adding
this route to the routing table could cause a loop.
If all the successor routes to a destination fail, the feasible successor becomes
the successor and is immediately added to the routing table. If there is no
feasible successor in the topology table, a query process is initiated to look for
a new route.
Example
Legend:
+ = Router
- or | = Link
(X) = Metric of link
A (2) B (1) C
+ - - - - - + - - - - - +
| |
(2)| | (3)
| |
+ - - - - - +
D (1) E
Now a client on router E wants to talk to a client on router A. That means a route
between router A and router E must be available. This route is calculated as
follows:
The immediate neighbours of router E are router C and router D. DUAL in router E
asks for the reported distance (RD) from routers C and D respectively to router A.
The following are the results:
Destination: Router A
via D: RD(4)
via C: RD(3)
The route via C is therefore in the lowest cost. In the next step, the distance
from router E to the neighbours are added to the reported distance to get the
feasible distance (FD):
Destination: Router A
via D: RD(4), FD(5)
via C: RD(3), FD(6)
DUAL therefore finds that the route via D has the least total cost. Then the route
via D will be marked as "successor", equipped with passive status and registered in
the routing table. The route via C is kept as a "feasible successor", because its
RD is less than the FD of the successor:
Destination: Router A
via D: RD(4), FD(5) successor
via C: RD(3), FD(6) feasible successor
References
Cisco EIGRP official white paper, Sep 09, 2005
J.J. Garcia-Lunes-Aceves, "Loop-Free Routing Using Diffusing Computations"
IEEE/ACM Transactions on Networking, vol. 1, no, 1, pp. 130�141 Feb. 1993
E. W. Dijkstra and C. S. Scholten. �Termination detection for diffusing
computations,� Inform. Process. Lett., vol. 11, no, 1, pp. 1�4, Aug. 1980 and
EWD687a
Categories: Routing protocolsRouting algorithmsSRI International software
Navigation menu
Not logged inTalkContributionsCreate accountLog inArticleTalkReadEditView
historySearch
Search Wikipedia
Main page
Contents
Featured content
Current events
Random article
Donate to Wikipedia
Wikipedia store
Interaction
Help
About Wikipedia
Community portal
Recent changes
Contact page
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Wikidata item
Cite this page
Print/export
Create a book
Download as PDF
Printable version
Languages
Deutsch
Espa�ol
?????
Suomi
Edit links
This page was last edited on 17 July 2018, at 18:35 (UTC).
Text is available under the Creative Commons Attribution-ShareAlike License;
additional terms may apply. By using this site, you agree to the Terms of Use and
Privacy Policy. Wikipedia� is a registered trademark of the Wikimedia Foundation,
Inc., a non-profit organization.
Privacy policyAbout WikipediaDisclaimersContact WikipediaDevelopersCookie
statementMobile viewWikimedia Foundation Powered by MediaWiki