EIGRP IN DETAIL
=> When two routers become immediate neighbor then only for the first time they will exchange their complete routing table with each other and then only the route updates will be sent at regular interval of time.
Point to remember
=> the best route to reach the destination network is called feasible distance
=> the second best alternate route also called the backup route or feasible successor
=> All possible routes to reach the destination network as reported by the immediate neighbor are called reported distances.
=> Communication via RTP
1) Reliable Transport Protocol
2) For the first time the router send the multicast hello to its immediate neighbor then it check the list of all the routers that have not replied to that multicast hello.
3) With them it will start unicast hello for next 16 times and even if there is no any reply then that router will be declared as dead.
=> DUAL
1) Defusing Update Algorithm
2) It is used to identify
i) The best route to reach the destination network called feasible distance
ii) The second best route called feasible successor
Metric
=> The metric used to identify the best route is combination of 4 things
1) Bandwidth
2) Delay
3) Load
4) Reliability
=> Three table are prepared
1) Neighborship table
2) Topology table
3) Routing table
=> EIGRP provide support for the larger networks
1) It is a classless protocol
2) It supports VLSM
3) The max HOP count is 255 by default it is 100
4) EIGRP supports multiple autonomous system number.
=> EIGRP support the auto summarize
=> Eigrp metric is the same as IGRP*256, It uses the smallest B.W, Reliablity, Load & MTU with the Cumulative delay upon the path…..The MTU doesn’t actually used in the Metric calculations, But is included in the EIGRP Routing updates.
=> Potential routing protocol for the core of a network; used in large networks.
=> For neighbor relation to be established, both routers must send and receive Hello or Ack packets from each other, they must have the same AS #, and the same Metric K values.
=> Eigrp doesn’t restrict that neighbors must have the same Hello & dead interval timers, Unlike OSPF.
Point to remember
=> the best route to reach the destination network is called feasible distance
=> the second best alternate route also called the backup route or feasible successor
=> All possible routes to reach the destination network as reported by the immediate neighbor are called reported distances.
=> Communication via RTP
1) Reliable Transport Protocol
2) For the first time the router send the multicast hello to its immediate neighbor then it check the list of all the routers that have not replied to that multicast hello.
3) With them it will start unicast hello for next 16 times and even if there is no any reply then that router will be declared as dead.
=> DUAL
1) Defusing Update Algorithm
2) It is used to identify
i) The best route to reach the destination network called feasible distance
ii) The second best route called feasible successor
Metric
=> The metric used to identify the best route is combination of 4 things
1) Bandwidth
2) Delay
3) Load
4) Reliability
=> Three table are prepared
1) Neighborship table
2) Topology table
3) Routing table
=> EIGRP provide support for the larger networks
1) It is a classless protocol
2) It supports VLSM
3) The max HOP count is 255 by default it is 100
4) EIGRP supports multiple autonomous system number.
=> EIGRP support the auto summarize
=> Eigrp metric is the same as IGRP*256, It uses the smallest B.W, Reliablity, Load & MTU with the Cumulative delay upon the path…..The MTU doesn’t actually used in the Metric calculations, But is included in the EIGRP Routing updates.
=> Potential routing protocol for the core of a network; used in large networks.
=> For neighbor relation to be established, both routers must send and receive Hello or Ack packets from each other, they must have the same AS #, and the same Metric K values.
=> Eigrp doesn’t restrict that neighbors must have the same Hello & dead interval timers, Unlike OSPF.
No comments:
Post a Comment