CO5023 EIGRP. Features of EIGRP EIGRP is a highly advanced distanced vector routing protocol Uses Protocol dependent modules to route different packets.

Slides:



Advertisements
Similar presentations
EIGRP Explanation & Configuration By Bill Reed. We Will Examine the features of EIGRP Discuss why EIGRP is known as a Hybrid Routing Protocol Identify.
Advertisements

EIGRP LSNDI RMRA MM Clements. 4 Feb 2008LSNDI RMRA 2 Last Week ……… OSPF requires more resources from router Fast convergence Less overhead – good for.
Enhanced Interior Gateway Routing Protocol (EIGRP) Part 2
RIP V2 CCNP S1(5), Chapter 4.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Multiarea OSPF Scaling Networks.
Routing Protocols and Concepts – Chapter 9
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.
EIGRP routing protocol Omer ben-shalom Omer Ben-Shalom: Must show how EIGRP is dealing with count to infinity problem Omer Ben-Shalom: Must.
CCNA 2 v3.1 Module 6.
1 Enhanced IGRP (EIGRP). 2 Agenda EIGRP Features and Operation Using EIGRP to Support Large Networks Verifying EIGRP.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialBSCI Configuring EIGRP BSCI Module 2-1 – Introduction to EIGRP.
Routing protocols Part III
1 Semester 2 Module 6 Routing and Routing Protocols YuDa college of business James Chen
Fundamentals of Networking Discovery 2, Chapter 6 Routing.
EIGRP Roots of EIGRP: IGRP
Switching Basics and Intermediate Routing CCNA 3 Chapter 3
Extended Interior Gateway Routing Protocol
Chapter 12 Intro to Routing & Switching.  Upon completion of this chapter, you should be able to:  Read a routing table  Configure a static route 
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Routing with a Distance Vector Protocol in an Enterprise Network Introducing.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 2 Module 6 Routing and Routing Protocols.
Introduction to Dynamic Routing Protocol
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 7: Enhanced Interior Gateway Protocol (EIGRP) Scaling Networks.
Routing -2 Dynamic Routing
EIGRP.
Instructor & Todd Lammle
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Routing with a Distance Vector Protocol in an Enterprise Network Introducing.
Dynamic Routing Protocol EIGRP Enhanced Interior Gateway Routing Protocol (EIGRP) is an advanced distance vector routing protocol developed by Cisco.
1 13-Oct-15 S Ward Abingdon and Witney College EIGRP CCNA Exploration Semester 2 Chapter 9.
© 2002, Cisco Systems, Inc. All rights reserved. 1 Determining IP Routes.
Introduction to OSPF Nishal Goburdhan. Routing and Forwarding Routing is not the same as Forwarding Routing is the building of maps Each routing protocol.
Instructor & Todd Lammle
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 3 EIGRP.
1 CCNA 3 v3.1 Module 3. 2 CCNA 3 Module 3 Enhanced Interior Gateway Routing Protocol (EIGRP)
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 2 Single-Area OSPF.
Chapter 7 Enhanced IGRP (EIGRP) and Open Shortest Path First (OSPF)
California State University, Los Angeles “ Enhanced Interior Gateway Routing Protocol ” Presented By Group#11: Rajnish Kumar [ ] Manan Patel [ ]
CCNA Guide to Cisco Networking Fundamentals Fourth Edition
EIGRP ROUTING PROTOCOLS AND CONCEPTS – CHAPTER 9 SANDRA COLEMAN, CCNA, CCAI.
CCNA 2 Week 6 Routing Protocols. Copyright © 2005 University of Bolton Topics Static Routing Dynamic Routing Routing Protocols Overview.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Distance Vector Routing Protocols Dynamic Routing.
Saeed Darvish Pazoki – MCSE, CCNA Abstracted From: Cisco Press – ICND 2 – 10 EIGRP 1.
6: Routing Working at a Small to Medium Business.
Routing and Routing Protocols
1 8-Dec-15 EIGRP CCNA Exploration Semester 2 Chapter 9.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Routing with a Distance Vector Protocol in an Enterprise Network Introducing.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing Protocols.
Copyright 2003 CCNA 3 Chapter 4 EIGRP By Your Name.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 3 EIGRP.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 3 EIGRP.
1 Pertemuan 4 EIGRP. Discussion Topics EIGRP Concepts EIGRP Configuration 2.
CCNP Network Route Part-I EIGRP: Enhanced Interior Gateway Routing Protocol: - The most easy routing protocol of all. - It keeps backup routes - Other.
Routing Protocols Brandon Wagner.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing Protocols.
Routing Protocol RIP-2. RIP-2 Basic Concepts Routers using RIP-2 advertise a small amount of simple information about each subnet to their neighbors.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing & Switching.
EIGRP.
Chapter 5: Dynamic Routing
Routing Protocols and Concepts – Chapter 9
Enhanced Interior Gateway Routing Protocol (EIGRP) Part I
EIGRP.
Routing Protocols and Concepts – Chapter 9
Chapter 8: Single-Area OSPF
CCNA Routing and Switching Scaling Networks v6.0
EIGRP.
Cisco networking, CNET-448
Routing Protocols and Concepts – Chapter 9
EIGRP.
EIGRP.
CCNA 2 JEOPARDY Module 6.
Presentation transcript:

CO5023 EIGRP

Features of EIGRP EIGRP is a highly advanced distanced vector routing protocol Uses Protocol dependent modules to route different packets across the same physical infrastructure (v. useful for ipv4 and ipv6) Has its own reliable transport protocol (RTP), as it cannot rely on TCP for transport Includes both reliable and unreliable delivery Uses partial and bounded updates: as far as possible sends only the updated information to routers affected when a topology changes. Also supports load balancing among unequal cost routes

EIGRP Packet Types Hello packets - Used for discovery and maintanance of neighbor adjacencies. Sent every 5 seconds (60s NBMA) Sent with unreliable delivery Multicast (on most network types) Update packets - Propagates routing information to EIGRP neighbors. Sent only when necessary. Sent with reliable delivery Unicast or multicast Acknowledgment packets - Used to acknowledge the receipt of an EIGRP message that was sent using reliable delivery. Sent with unreliable delivery Unicast Query packets - Used to query routes from neighbors when connectivity to a network is lost (network placed in active state). Sent with reliable delivery Unicast or multicast Reply packets - Sent in response to a query. Sent with reliable delivery Unicast

Configuring EIGRP EIGRP configuration is much like other routing protocols. router eigrp AS-number network x.x.x.x The autonomous system (AS) number is a bit like the process ID in OSPF. Notice the network command does not need a wildcard mask. EIGRP will be enabled on all interfaces within the classful range (if this behaviour is not desired, a wildcard mask can be used)

Multi-area routing table O - Router (type 1) and network (type 2) LSAs describe the details within an area (intra-area). O IA - When an ABR receives summary LSAs, it adds them to its LSDB and regenerates them into the local area. Summary LSAs appear in the routing table as IA (inter-area routes). O E1 or O E2 - External LSAs appear in the routing table marked as external type 1 (E1) or external type 2 (E2) routes. The SPF calculation starts with intra-area routes, then inter-area, then external.

Verifying EIGRP

EIGRP Operation Initial route discovery… 1.Swap hello packets to create neighbour adjacency 2.Then they send each other all of their routing information (using split horizon: routing information learned from a particular interface is never sent back out through that interface – prevents routing loops) 3.Routers update their tables accordingly, reaching a state of convergence.

EIFRP Metrics EIGRP metrics appear to cover everything we could possibly want… Bandwidth (= /bandwidth) Load Delay Reliability However, the delay and load aren’t updated in real time by any form of network monitoring – they are static estimates of these values. If you want a routing protocol which actually attempts to monitor and maintain these things dynamically, try ant colony optimisation. You can adjust the EIGRP metric by changing its k values A zero k value means the corresponding metric value is ignored When calculating the metric for a route, EIGRP uses the slowest bandwidth and sums the delays

Diffuse Update Algorithm (DUAL) Terminology Successor – next hop on shortest route Feasible distance – distance through successor Feasible successor – next hop on alternative route Reported distance – feasible distance from neighbour Feasibility condition: used to identify feasible successors In the event that a route fails, DUAL will promote the feasible successor with shortest reported distance to be the successor. A backup route is a feasible successor if it meets the feasibility condition: If the reported distance from the neighbour is less than the local router’s feasible distance, then the feasibility condition is met This ensures that no routing loops are present in the network

DUAL convergence If a route fails and no feasible successor is available for the destination network, DUAL places the route into an active state. It is then necessary to send out query packets asking neighbours for routes to the destination. You can observe DUAL’s activity at the command line by using the privileged mode command: debug eigrp fsm