Configuring Catalyst Switch Operations

Slides:



Advertisements
Similar presentations
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 2: LAN Redundancy Scaling Networks.
Advertisements

Part 2: Preventing Loops in the Network
Spanning Tree Protocol
Switching & Operations. Address learning Forward/filter decision Loop avoidance Three Switch Functions.
1 CCNA 3 v3.1 Module 7. 2 CCNA 3 Module 7 Spanning Tree Protocol (STP)
STP Spanning tree protocol. Trunk port : A trunk port is a port that is assigned to carry traffic for all the VLANs that are accessible by a specific.
Spanning Tree protocol- Chapter 5
Spanning Tree Protocol
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—1-1 Configuring Catalyst Switch Operations Introducing Spanning Tree Protocol.
LOGO Local Area Network (LAN) Layer 2 Switching and Virtual LANs (VLANs) Local Area Network (LAN) Layer 2 Switching and Virtual LANs (VLANs) Chapter 6.
Layer 2 Switch  Layer 2 Switching is hardware based.  Uses the host's Media Access Control (MAC) address.  Uses Application Specific Integrated Circuits.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 2: LAN Redundancy Scaling Networks.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 2: LAN Redundancy Scaling Networks.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.1 Module 7 Spanning Tree Protocol.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Lecture 12: LAN Redundancy Switched Networks Assistant Professor Pongpisit.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning-Tree Protocol Cisco Networking Academy.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Implement Spanning Tree Protocols LAN Switching and Wireless – Chapter 5.
Saeed Darvish Pazoki – MCSE, CCNA Abstracted From: Cisco Press – ICND 2 – Chapter 2 Spanning tree Protocol 1.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Implement Spanning Tree Protocols LAN Switching and Wireless – Chapter 5.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Implement Spanning Tree Protocols LAN Switching and Wireless – Chapter 5 Part.
Cisco 3 - Switch Perrine. J Page 110/3/2015 Chapter 7 How does STP provide a loop-free network? 1.By placing all ports in the blocking state 2.By placing.
Instructor & Todd Lammle
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 LAN Switching and Wireless Implement Spanning Tree Protocols (STP) Chapter.
Steffen/Stettler, , 4-SpanningTree.pptx 1 Computernetze 1 (CN1) 4 Spanning Tree Protokoll 802.1D-2004 Prof. Dr. Andreas Steffen Institute for.
Cisco 3 – Switching STP Perrine. J Page 110/19/2015 Chapter 8 Spanning Tree Protocol (STP) Having redundancy in a network is important, and allows the.
Switching Basics and Intermediate Routing CCNA 3 Chapter 7.
LOGO Local Area Network (LAN) Layer 2 Switching and Virtual LANs (VLANs) Local Area Network (LAN) Layer 2 Switching and Virtual LANs (VLANs) Chapter 6.
S7C5 – Spanning Tree Protocol And other topics. Switch Port Aggregation Bundling –Combining 2 to 8 links of FE (Fast Ethernet) or GE (Gigabit) Full duplex.
Instructor & Todd Lammle
Spanning Tree V1.2 Slide 1 of 1 Purpose:
STP LAN Redundancy Introduction Network redundancy is a key to maintaining network reliability. Multiple physical links between devices provide redundant.
Switching Topic 6 Rapid spanning tree protocol. Agenda RSTP features – Port states – Port roles – BPDU format – Edge ports and link types – Proposals.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning Tree Protocol.
1 Version 3.0 Module 7 Spanning Tree Protocol. 2 Version 3.0 Redundancy Redundancy in a network is needed in case there is loss of connectivity in one.
CCNP 3: Chapter 3 Implementing Spanning Tree. Overview Basics of implementing STP Election of Root Bridge and Backup Enhancing STP RSTP MSTP EtherChannels.
Spanning Tree protocol
Topic 5 Spanning tree protocol
CO5023 LAN Redundancy.
Copyright 2003 CCNA 3 Chapter 8 Spanning Tree Protocol By Your Name.
Lecture3 Secured Network Design W.Lilakiatsakun.  Spanning Tree Protocol (STP)  Attack on Spanning Tree Protocol Topics.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Implement Spanning Tree Protocols (STP) LAN Switching and Wireless – Chapter.
Chapter-5 STP. Introduction Examine a redundant design In a hierarchical design, redundancy is achieved at the distribution and core layers through additional.
Exploration 3 Chapter 5. Redundancy in Switched Networks Switches learn the MAC addresses of devices on their ports so that data can be properly forwarded.
Instructor Materials Chapter 3: STP
Implement Spanning Tree Protocols
Spanning Tree Protocol
Spanning Tree Protocol
© 2002, Cisco Systems, Inc. All rights reserved.
CIT 384: Network Administration
Implementing Spanning Tree Protocol
Implement Spanning Tree Protocols
Topic: Spanning Tree Protocol
Spanning Tree Protocols
Instructor & Todd Lammle
Lecture#10: LAN Redundancy
Spanning Tree Protocol
Implement Spanning Tree Protocols
© 2002, Cisco Systems, Inc. All rights reserved.
Spanning Tree Protocol
Hwajung Lee Modified from Slides Courtesy of Cisco Networking Academy
Spanning Tree.
NT2640 Unit 9 Activity 1 Handout
© 2002, Cisco Systems, Inc. All rights reserved.
© 2002, Cisco Systems, Inc. All rights reserved.
STP – Spanning Tree Protocol A closer look
CCNA Routing and Switching Scaling Networks v6.0
Spanning Tree Protocol (STP)
Cisco networking CNET-448
Implement Spanning Tree Protocols
© 2002, Cisco Systems, Inc. All rights reserved.
Presentation transcript:

Configuring Catalyst Switch Operations Introducing Spanning Tree Protocol

Outline Overview Spanning Tree Protocol Spanning-Tree Operation Root Bridge Selection Spanning-Tree Port States Spanning-Tree Path Costs Spanning-Tree Recalculation Rapid Spanning Tree Protocol Summary Slide 1 of 2 Purpose: This slide states the chapter objectives. Emphasize: Read or state each objective so that each student has a clear understanding of the chapter objectives. Note: Catalyst switches have different CLIs. The Catalyst 2900xl and the Catalyst 1900 has a Cisco IOS CLI. The Cisco IOS CLI commands available on the 2900xl is different from the 1900. The Catalyst 5000 family has no Cisco IOS CLI, and use the set commands instead. This class only covers the configuration on the Catalyst 1900 switch.

Spanning Tree Protocol Emphasize: A looped topology is often desired to provide redundancy, but looped traffic is undesirable. The Spanning-Tree protocol was originally designed for bridges. Today, it is also applied to LAN switches and routers operating as a bridge. Spanning-Tree protocol ensures that all bridged segments are reachable but any points where loops occur will be blocked. Provides a loop-free redundant network topology by placing certain ports in the blocking state

Spanning-Tree Operation One root bridge per broadcast domain One root port per nonroot bridge One designated port per segment Nondesignated ports are unused Emphasize: The three general rules when dealing with STP are as follows: 1. One root bridge per network. The root is the bridge with the lowest bridge ID. All the ports on the root bridge are designated ports (forwarding). 2. For every non-root bridge, there is a root port (forwarding). The root port is the port with the lowest accumulated path cost to the root bridge. 3. For every segment, there is only one designated port. The designated port forwards traffic for the segment. The designated port has the lowest accumulated path cost to the root bridge.

Spanning Tree Protocol Root Bridge Selection Emphasize: By default, the switch with the lowest MAC address will be the root bridge. Note: The Catalyst switches support an instance of spanning tree per VLAN. Each VLAN will use a unique MAC address for spanning tree purposes. On the Catalyst 1900, the address it uses for spanning tree is the MAC address on the various ports. VLAN is discussed in the next chapter. The IEEE 802.1d specification specifies for a 16-bit priority field. The Catalyst 1900 switch only supports the 802.1d Spanning-Tree protocol. The default priority on the Catalyst 1900 is 32768 in decimal or 8000 in hex, the midrange value. BPDU contain the following fields: Protocol ID version Message type Flags Root ID Cost of path Bridge ID Port ID Message age Max age Hello time Forward delay BPDU (default = sent every two seconds) Root bridge = bridge with the lowest bridge ID Bridge ID = In this example, which switch has the lowest bridge ID?

Spanning-Tree Port States Spanning tree transits each port through several different states: Emphasize: Using the default Spanning-Tree protocol timers setting, the times it takes to go from the blocking state to the forwarding state is 50 sec (20 + 15 + 15).

Spanning-Tree Port States (Cont.) Emphasize: RPs and DPs are normally in the forwarding state. There is only one DP per segment.

Spanning-Tree Operation Layer 2 of 2 Emphasize: Switch X and Y have the same path cost to the root bridge. The DP for the bottom segment is on switch X because switch X has a lower bridge ID than switch Y.

Spanning-Tree Path Cost Emphasize: There are two cost calculation methods. The Catalyst 1900 uses the older method. The new method is designed to accommodate the higher gigabit Ethernet speed. Note: Port priority is used to determine which path has preference when path costs are equal (for example, when you have two parallel links connecting two switches together). The default port priority is 128. The port aggregation protocol and EtherChannels® are not taught in this class. Fast EtherChannel is supported by the Catalyst 1900 switch.

Spanning-Tree Recalculation

Spanning-Tree Convergence Convergence occurs when all the switch and bridge ports have transitioned to either the forwarding or the blocking state. When the network topology changes, switches and bridges must recompute STP, which disrupts user traffic. Note: In large networks the effect of reconvergence may cause long periods of instability. During the election of a new root, all ports are blocked, and all learned MAC addresses are aged out so that when forwarding again starts, there is a lot of flooding of unicast traffic until the MAC address tables are repopulated. Also if a preferred root and a backup root are not configured by lowering their default priority, then the final topology of the spanning tree may be very inefficient.

Rapid Spanning-Tree Protocol

Rapid Transition to Forwarding Slide 2 of 2 Emphasize: What will happen if switch X fails? Switch Y will detect the missing BPDU from switch X in 20 seconds (max. age timer), then recalculate the Spanning-Tree protocol. After the network converges, switch Y will be the root bridge, and all its ports will transit to the forwarding states (DP) 30 seconds after the max. age timer expires.

Summary STP is a bridge-to-bridge protocol used to maintain a loop-free network. To maintain a loop-free network topology, STP establishes a root bridge, a root port, and designated ports. With STP, the root bridge has the lowest BID, which is made up of the bridge priority and the MAC address. When STP is enabled, every bridge in the network goes through the blocking state and the transitory states of listening and learning at power up. If properly configured, the ports then stabilize to the forwarding or blocking state. If the network topology changes, STP maintains connectivity by transitioning some blocked ports to the forwarding state. RSTP significantly speeds the recalculation of the spanning tree when the network topology changes. Purpose: This slide discuss the initial configurations on the routers and switches. Note: There is no setup mode on the Catalyst 1900 switch.