EIGRP Features and Operation

Similar documents
Top-Down Network Design, Ch. 7: Selecting Switching and Routing Protocols. Top-Down Network Design. Selecting Switching and Routing Protocols

CIS 83 Midterm Spring 2004 Answer Sheet Name Score Grade Question Answer Question Answer

Spanning-Tree Protocol

Objectives. 1. Introduction:

Final exam study Guide

Chapter 5. Spanning Tree Protocol (STP) Part I

Implement Spanning Tree Protocols-PART-I. LAN Switching and Wireless Chapter 5 Modified by Tony Chen 05/01/2008

CS IT. Lecture (06) STP (I) Problem statement. By: Dr. Ahmed ElShafee

BTEC Level 3 Extended Diploma

CHAPTER 4: ROUTING DYNAMIC. Routing & Switching

Configuring EIGRP. 2001, Cisco Systems, Inc.

Chapter 7: Routing Dynamically. Routing & Switching

Chapter 6 Reading Organizer

Section 6. Implementing EIGRP ICND2

Part II. Chapter 3. Determining IP Routes

Implementing Spanning Tree Protocol

Chapter 3 Lab 3-1, Spanning Tree Protocol (STP) Default Behavior

Implement Spanning Tree Protocols. LAN Switching and Wireless Chapter 5

Spanning Tree Protocol(STP)

CCNA Layer 2 switching. Revision no.: PPT/2K605/03

Chapter 5: STP. * What is STP? How does STP work?

Lab 9.6.1: Basic EIGRP Configuration Lab

Configuring STP. Understanding Spanning-Tree Features CHAPTER

TestsDumps. Latest Test Dumps for IT Exam Certification

shortcut Tap into learning NOW! Visit for a complete list of Short Cuts. Your Short Cut to Knowledge

Lab10- Configuring EIGRP

Exam4Tests. Latest exam questions & answers help you to pass IT exam test easily

9.1. Routing Protocols

Symbols. Numerics I N D E X

ITE PC v4.0. Chapter Cisco Systems, Inc. All rights reserved. Cisco Public

3. INTERCONNECTING NETWORKS WITH SWITCHES. THE SPANNING TREE PROTOCOL (STP)

EIGRP. Routing Protocols and Concepts Chapter 9. Video Frank Schneemann, MS EdTech

CCNA Routing and Switching Study Guide Chapters 3 & 17: Enhanced IGRP

Introduction to Local and Wide Area Networks

Top-Down Network Design

Chapter 3. Introduction to Dynamic Routing Protocols. CCNA2-1 Chapter 3

Campus Networking Workshop. Layer 2 engineering Spanning Tree and VLANs

Routing Protocol. RIPv1

Configuring STP and RSTP

Layer 2 Engineering Spanning Tree

The multiple spanning-tree (MST) implementation is based on the IEEE 802.1s standard.

TDC 363 Introduction to LANs

Routing with a distance vector protocol - EIGRP

Introduction to OSPF

REDDIG II Computer Networking Training

Advanced Networking: Routing & Switching 2 Chapter 7

Two types of routing protocols are used in internetworks: interior gateway protocols (IGPs) and exterior gateway protocols (EGPs).

NAT Internetworking Standards and Technologies, Computer Engineering, KMITL 2

Exam Questions

Configuring Rapid PVST+ Using NX-OS

Introduction to OSPF

Planning for Information Network

Configuring Rapid PVST+

SEMESTER 2 Chapter 4 Distance Vector Routing Protocols V 4.0 RIP, IGRP, EIGRP

Copyright 2014 CertificationKits LLC. All Rights Reserved. 2

Top-Down Network Design

CCNA EXPLORATION V4.0 ROUTING PROTOCOLS AND CONCEPTS

SEMESTER 2 Chapter 3 Introduction to Dynamic Routing Protocols V 4.0

Overview. Overview. OTV Fundamentals. OTV Terms. This chapter provides an overview for Overlay Transport Virtualization (OTV) on Cisco NX-OS devices.

Introduction to Dynamic Routing Protocols

Routing Protocols and

INTERNET LABORATORY PROJECT. EIGRP Routing Protocol. Abhay Tambe Aniruddha Deshmukh Sahil Jaya

CCNA Routing and Switching Study Guide Chapters 1 & 15: Enhanced Switching

Introduction to OSPF

EIGRP 04/01/2008. Routing Protocols and Concepts Chapter 9 Modified by Tony Chen

Table of Contents. Cisco Introduction to EIGRP

OSPF DR and BDR Elections

Maintaining Specific VLAN Identification. Comparing ISL and 802.1Q. VLAN Trunking

Spanning-Tree Protocol

Chapter 9. Enhanced Interior Gateway Routing Protocol (EIGRP) Part I

Unit 3: Dynamic Routing

Distance Vector Routing Protocols

OSPF Protocol Overview on page 187. OSPF Standards on page 188. OSPF Area Terminology on page 188. OSPF Routing Algorithm on page 190

Configuring Rapid PVST+

CIS 83 Lab Assignment

Certkiller questions. Cisco Interconnecting Cisco Networking Devices Part 2

Cisco Questions & Answers

PASS4TEST. IT Certification Guaranteed, The Easy Way! We offer free update service for one year

The Spanning Tree Protocol

Why we need to divide network?

Spanning Tree Protocol

STP (Spanning Tree Protocol) - Step by Step Configuration Tutorial

Buy full file at

EIGRP. About EIGRP. CLI Book 1: Cisco ASA Series General Operations CLI Configuration Guide, 9.7 1

The primary audience for this course includes Network Administrators, Network Engineers,

Configuring Spanning Tree Protocol

BSCI. Section 5. Intermediate System-to- Intermediate System (IS-IS)

Configuring EIGRP. Overview CHAPTER

Chapter 3 Reading Organizer

Cisco CCNA EIGRP Part II

Network Layer: Routing

JN0-343 Q&As. Juniper Networks Certified Internet Specialist (JNCIS-ENT) Pass Juniper JN0-343 Exam with 100% Guarantee

CCNA Semester 3 labs. Part 1 of 1 Labs for chapters 1 8

Chapter 5 RIP version 1

Claim desired outcome

Internet Routing Protocols Tuba Saltürk

Routing Information Protocol. RIP application. RIP version 1

Configuring Spanning Tree Protocol

Which of the following are primary functions of a router? (Choose two.) - packet switching - path selection

CISCO EXAM QUESTIONS & ANSWERS

Transcription:

EIGRP Features and Operation Enhanced IGRP (EIGRP) is a classless, enhanced distance-vector protocol. EIGRP is a Cisco proprietary protocol. EIGRP includes the subnet mask in its route updates. And as you now know, the advertisement of subnet information allows us to use Variable Length Subnet Masks (VLSMs) when designing our networks! EIGRP is sometimes referred to as a hybrid routing protocol because it has characteristics of both distance-vector and link-state protocols. For example, EIGRP doesn t send link-state packets as OSPF does; instead, it sends traditional distance-vector updates containing information about networks plus the cost of reaching them from the perspective of the advertising router. And EIGRP has link-state characteristics as well it synchronizes routing tables between neighbors at startup and then sends specific updates only when topology changes occur. This makes EIGRP suitable for very large networks. EIGRP has a maximum hop count of 255 (the default is set to 100). Neighbor Discovery Before EIGRP routers are willing to exchange routes with each other, they must become neighbors. There are three conditions that must be met for neighborship establishment: Hello or ACK received AS numbers match Identical metrics (K values) The only time EIGRP advertises its entire routing table is when it discovers a new neighbor and forms an adjacency with it through the exchange of Hello packets.

When this happens, both neighbors advertise their entire routing tables to one another. Let s define some terms before we move on: Reported/advertised distance This is the metric of a remote network, as reported by a neighbor. Feasible distance The metric of a feasible distance is the metric reported by the neighbor (called reported or advertised distance) plus the metric to the neighbor reporting the route. Successor A successor route is the best route to a remote network. A successor route is used by EIGRP to forward traffic to a destination and is stored in the routing table. Feasible successor A feasible successor is a path whose reported distance is less than the feasible distance, and it is considered a backup route. EIGRP will keep up to six feasible successors in the topology table.

Neighbor table Each router keeps state information about adjacent neighbors in this table. Topology table The topology table is populated by the protocol-dependent modules and acted upon by the Diffusing Update Algorithm (DUAL). It contains all destinations advertised by neighboring routers. Diffusing Update Algorithm (DUAL) EIGRP uses Diffusing Update Algorithm (DUAL) for selecting and maintaining the best path to each remote network. DUAL also used to obtain backup paths Configuration

L2 Switching Lab7 : IP Routing, L2 Switching Switching Services Layer 2 switches and bridges are faster than routers because they don t take up time looking at the Network layer header information. Instead, they look at the frame s hardware addresses before deciding to either forward, flood or drop the frame. Layer 2 switching provides the following: Hardware-based bridging (ASIC) Wire speed. Low latency. Low cost. Three Switch Functions at Layer 2 There are three distinct functions of layer 2 switching (you need to remember these!): Address learning, forward/filter decisions, and loop avoidance

Address learning Lab7 : IP Routing, L2 Switching Layer 2 switches and bridges remember the source hardware address of each frame received on an interface, and they enter this information into a MAC database called a forward/filter table. Forward/filter decisions When a frame is received on an interface, the switch looks at the destination hardware address and finds the exit interface in the MAC database. The frame is only forwarded out the specified destination port. Loop avoidance If multiple connections between switches are created for redundancy purposes, network loops can occur. Spanning Tree Protocol (STP) is used to stop network loops while still permitting redundancy.

Spanning Tree Protocol (STP) STP s main task is to stop network loops from occurring on your layer 2 network (bridges or switches). It vigilantly monitors the network to find all links, making sure that no loops occur by shutting down any redundant links. STP uses the spanning-tree algorithm (STA) to first create a topology database and then search out and destroy redundant links. With STP running, frames will be forwarded only on the premium, STP-picked links. Spanning Tree Terms Root Bridge The root bridge is the bridge with the lowest bridge ID. With STP, the key is for all the switches in the network to elect a root bridge that becomes the focal point in the network. All other decisions in the network such as which port is to be blocked and which port is to be put in forwarding mode are made from the perspective of this root bridge. Bridge Protocol Data Unit (BPDU) All the switches exchange information to use in the selection of the root switch as well as in subsequent configuration of the network, and this is done by exchanging BPDUs. Bridge ID The bridge ID is how STP keeps track of all the switches in the network. It is determined by a combination of the bridge priority (32,768 by default on all Cisco switches) and the base MAC address. The bridge with the lowest bridge ID becomes the root bridge in the network. Root port The root port is always the link directly connected to the root bridge, or the shortest path to the root bridge.

Designated port A designated port is one that has been determined as having the best (lowest) cost. A designated port will be marked as a forwarding port. Nondesignated port A nondesignated port is one with a higher cost than the designated port. Nondesignated ports are put in blocking mode they are not forwarding ports. Forwarding port A forwarding port forwards frames. Blocked port A blocked port is the port that, in order to prevent loops, will not forward frames. However, a blocked port will always listen to frames. Spanning Tree Operations Selecting the Root Bridge To determine the root bridge, you combine the priority of each bridge with its MAC address. If two switches or bridges happen to have the same priority value, the MAC address becomes the tiebreaker for figuring out which one has the lowest (best) ID. Changing the default priority is the best way to choose a root bridge. This is important because you want the core switch (the one closest to the center of your network) to be the root bridge in your network so STP will converge quickly. Switch B(config)#spanning-tree vlan 1 priority? <0-61440> bridge priority in increments of 4096 Switch B(config)#spanning-tree vlan 1 priority 4096

Elect Root Ports Every switch in a spanning-tree topology, except for the root bridge, has a single root port defined. The root port is the switch port with the lowest path cost to the root bridge. when two or more ports on the same switch have the same path cost to the root use the configurable port priority value. Electing Designated Ports and Non-Designated Ports After a switch determines which of its ports is the root port, the remaining ports must be configured as either a designated port (DP) or a nondesignated port (non-dp) to finish creating the logical loop-free spanning tree. Each segment in a switched network can have only one designated port. When two non-root port switch ports are connected on the same LAN segment, a competition for port roles occurs. The two switches exchange BPDU frames to sort out which switch port is designated and which one is non-designated. Generally, when a switch port is configured as a designated port, it is based on the BID. However, keep in mind that the first priority is the lowest path cost to the root bridge and that only if the port costs are equal, is the BID of the sender. First step is to select the switch on the segment. The switch on the network segment with the lowest accumulated path cost to the Root Bridge will be selected.

If there is a tie in accumulated path costs between the two switches in the network segment, then the switch with the lowest Switch ID will be selected Spanning-Tree Port States The ports on a bridge or switch running STP can transition through five different states: Blocking A blocked port won t forward frames; it just listens to BPDUs. The purpose of the blocking state is to prevent the use of looped paths. All ports are in blocking state by default when the switch is powered up. Listening The port listens to BPDUs to make sure no loops occur on the network before passing data frames. A port in listening state prepares to forward data frames without populating the MAC address table. Learning The switch port listens to BPDUs and learns all the paths in the switched network. Forwarding The port sends and receives all data frames on the bridged port. If the port is still a designated or root port at the end of the learning state, it enters the forwarding state. Disabled A port in the disabled state (administratively) does not participate in the frame forwarding or STP. A port in the disabled state is virtually nonoperational.