160 likes | 175 Views
Discover what information is stored in an EIGRP neighbor table and how routes are chosen and maintained in a network using EIGRP. Learn about feasible successors, composite metrics, and routing tables.
E N D
What Is in a Neighbor Table? p2r2 p2r2#show ip eigrp neighbors IP-EIGRP neighbors for process 400 H Address Interface Hold Uptime SRTT RTO Q Seq (sec) (ms) Cnt Num 1 172.68.2.2 To0 13 02:15:30 8 200 0 9 0 172.68.16.2 Se1 10 02:38:29 29 200 0 6
Discovering Routes B A 1 I am router A, who is on the link? Hello
Discovering Routes B A 1 I am router A, who is on the link? Hello 2 Here is my routing information. Update 3
Discovering Routes B A 1 I am router A, who is on the link? Hello 2 Here is my routing information. Update 3 Thanks for the information! Ack 5
Discovering Routes B A 1 I am router A, who is on the link? Hello 2 Here is my routing information. Update 4 3 Topology Table Thanks for the information! Ack 5
Discovering Routes B A 1 I am router A, who is on the link? Hello 2 Here is my routing information. Update 4 3 Topology Table Thanks for the information! Ack 5 Here is my route information. Update 6
Discovering Routes B A 1 I am router A, who is on the link? Hello 2 Here is my routing information. Update 4 3 Topology Table Thanks for the information! Ack 5 Here is my route information. Update 6 Thanks for the information! Ack Converged
Choosing Routes IP IP A B 19.2 AppleTalk AppleTalk T1 T1 IPX IPX T1 • EIGRP uses a composite metric to pick the best path C D
Choosing Routes (cont.) Network 7 (20) (10) H G (1) (10) B C (10) A F D E (100) (100) Destination Advert. Dist. Neighbor Topology Table 30 H 7 7 21 B 7 220 7 D
Choosing Routes (cont.) Network 7 (20) (10) H G (1) (10) B C (10) A F D E (100) (100) Destination Feasible. Dist. Advert. Dist. Neighbor Topology Table 40 30 H 7 7 31 21 B 7 230 220 7 D
Choosing Routes (cont.) Network 7 (20) (10) H G (1) (10) B C (10) A F D E Router A’s (100) (100) Routing Table • B is current successor • H is the feasible successor Destination Feasible. Dist. Advert. Dist. Neighbor B 31 7 Topology Table 40 30 H 7 7 31 21 B 7 230 220 7 D
Maintaining Routes Net 7 (20) (10) H G (1) (10) B C (10) A E F D (100) (100) Topology Table Destination Feasible Dist. Advert. Dist. Neighbor State 1 40 30 H 7 A
Maintaining Routes Net 7 (20) (10) H G (1) (10) B C (10) A E F D (100) (100) Topology Table Destination Feasible Dist. Advert. Dist. Neighbor State 1 40 30 H 7 A 2 Do you have feasible successor to network 7? Query Here is a successor to network 7. Reply
Maintaining Routes (cont.) A B C 3 Do you have feasible successor to network 7? Query Do you have feasible successor to network 7? Query I have no route to network 7. I have no route to network 7. Reply Reply
Maintaining Routes (cont.) A B C 3 Do you have feasible successor to network 7? Query Do you have feasible successor to network 7? Query I have no route to network 7. I have no route to network 7. Reply Reply Topology Table State Destination Advert. Distance Feasible Dist. Neighbor 4