Presentation is loading. Please wait.

Presentation is loading. Please wait.

© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Implement Spanning Tree Protocols (STP) LAN Switching and Wireless – Chapter.

Similar presentations


Presentation on theme: "© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Implement Spanning Tree Protocols (STP) LAN Switching and Wireless – Chapter."— Presentation transcript:

1 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Implement Spanning Tree Protocols (STP) LAN Switching and Wireless – Chapter 5

2 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 2 Objectives  Explain the role of redundancy in a converged network  Summarize how STP works to eliminate Layer 2 loops  Explain how the STP algorithm uses three steps to converge on a loop-free topology  Implement rapid per VLAN spanning tree (rapid PVST+) in a LAN to prevent loops between redundant switches.

3 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 3 Explain the Role of Redundancy in a Converged Switched Network  Describe the role redundancy in a hierarchical network

4 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 4 Explain the Role of Redundancy in a Converged Switched Network  Describe how redundancy can disable a hierarchical network

5 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 5 What is wrong with this Picture? X

6 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 6 Explain the Role of Redundancy in a Converged Switched Network  Explain how Layer 2 loops occur in well managed networks

7 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 7 Spanning Tree Protocol (STP) STP runs on bridges and switches that are 802.1D-compliant. There are different flavors of STP, but 802.1D is the most popular and widely implemented. You implement STP on bridges and switches in order to prevent loops in the network. STP is used in situations where you want redundant links, but not loops.

8 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 8 Spanning Tree Protocol (STP) Redundant links are as important as backups in the case of a failover in a network. A failure of your primary activates the backup links so the network continues to function. Without STP on the bridges and switches, such a failure can result in a loop. If two connected switches run different flavors of STP, they require different timings to converge, because it creates timing issues between Blocking and Forwarding states. Therefore, it is recommended to use same flavors of STP.

9 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 9 Summarize How STP works to Eliminate Layer 2 Loops in a Converged Network  Describe the STP algorithm

10 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 10 Bridge  A device that connects two local-area networks (LANs), or two segments of the same LAN that use the same protocol, such as Ethernet.

11 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 11 BPDU  Acronym for bridge protocol data unit.  BPDUs are data messages that are exchanged across the switches within an extended LAN that uses a spanning tree protocol topology.  BPDU packets contain information on ports, addresses, priorities and costs and ensure that the data ends up where it was intended to go.  BPDU messages are exchanged across bridges to detect loops in a network topology.  The loops are then removed by shutting down selected bridge interfaces and placing redundant switch ports in a backup, or blocked, state.

12 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 12 Summarize How STP works to Eliminate Layer 2 Loops in a Converged Network

13 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 13 Port States  STP determines the logical loop-free path throughout the broadcast domain.  The spanning tree is determined through the information learned by the exchange of the BPDU frames between the interconnected switches.  To facilitate the learning of the logical spanning tree, each switch port transitions through five possible port states and three BPDU timers.

14 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 14 Port States  The spanning tree is determined immediately after a switch is finished booting up.  If a switch port were to transition directly from the blocking to the forwarding state, the port could temporarily create a data loop if the switch was not aware of all topology information at the time.  For this reason, STP introduces five port states.  The following provides information on how the port states ensure that no loops are created during the creation of the logical spanning tree.

15 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 15 Port States  Blocking  Listening  Learning  Forwarding  Disabling

16 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 16 Port States - BLOCKING Blocking - The port is a non-designated port and does not participate in frame forwarding. The port receives BPDU frames to determine the location and root ID of the root bridge switch and what port roles each switch port should assume in the final active STP topology..

17 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 17 Port States - LISTENING Listening - STP has determined that the port can participate in frame forwarding according to the BPDU frames that the switch has received thus far. At this point, the switch port is not only receiving BPDU frames, it is also transmitting its own BPDU frames and informing adjacent switches that the switch port is preparing to participate in the active topology.

18 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 18 Port States - LEARNING Learning - The port prepares to participate in frame forwarding and begins to populate the MAC address table.

19 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 19 Port States - FORWARDING Forwarding - The port is considered part of the active topology and forwards frames and also sends and receives BPDU frames.

20 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 20 Port States - DISABLED Disabled - The Layer 2 port does not participate in spanning tree and does not forward frames. The disabled state is set when the switch port is administratively disabled.

21 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 21 Port States  Blocking  Listening  Learning  Forwarding  Disabling

22 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 22 Summarize How STP works to Eliminate Layer 2 Loops in a Converged Network  The role of the Bridge ID (BID) in STP

23 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 23 Summarize How STP works to Eliminate Layer 2 Loops in a Converged Network How port roles support the operation of STP

24 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 24 Summarize How STP works to Eliminate Layer 2 Loops in a Converged Network  The role of STP port states and BPDU timers in the operation of STP - Bridge Protocol Data Units (BPDUs)

25 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 25 Explain How the STP Algorithm Uses Three Steps to Converge on a Loop-Free Topology  Summarize the 3 step process STP uses to create a loop free topology  STP convergence Steps 1.Elect a Root Bridge 2.Elect the Root Port 3.Elect the Designated and Non-designated ports

26 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 26 Explain How the STP Algorithm Uses Three Steps to Converge on a Loop-Free Topology  The STP decision sequence is used to elect a root bridge for a network

27 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 27 Explain How the STP Algorithm Uses Three Steps to Converge on a Loop-Free Topology  Describe the process of electing a root port on a switch

28 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 28 Explain How the STP Algorithm Uses Three Steps to Converge on a Loop-Free Topology  The process of electing designated ports and non- designated ports on a switch

29 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 29 Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN

30 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 30 Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN  Features of PVST+

31 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 31 Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN

32 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 32 Edge Port Edge ports, the equivalent of PortFast-enabled ports, and point-to-point links are candidates for rapid transition to a forwarding state. However, before the link type parameter is considered, RSTP must determine the port role.

33 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 33 Edge Port Root ports do not use the link type parameter. Root ports are able to make a rapid transition to the forwarding state as soon as the port is in sync. Alternate and backup ports do not use the link type parameter in most cases. Designated ports make the most use of the link type parameter. Rapid transition to the forwarding state for the designated port occurs only if the link type parameter indicates a point-to-point link.

34 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 34 Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN  RSTP edge ports

35 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 35 Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN  RSTP link types

36 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 36 Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN  RSTP port states and port roles

37 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 37 Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN  How to configure rapid PVST+

38 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 38 Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN  How to design STP to avoid problems

39 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 39 Implement Rapid per VLAN Spanning Tree (rapid PVST+) in a LAN  Describe how to identify and solve the key STP configuration issues

40 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 40 Summary  Spanning Tree Protocol (STP) is used to prevent loops from being formed on redundant networks  STP uses different port states & timers to logically prevent loops  There is at least one switch in a network that serves as the root bridge Root bridge is elected using information found in BPDU frames  Root ports are determined by the spanning tree algorithm and are closest to the root bridge

41 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 41 Summary  STP lengthy convergence time (50 seconds) facilitated the development of: RSTP convergence time is slightly over 6 seconds Rapid PVST+ adds VLAN support to RSTP is the preferred spanning-tree protocol on a Cisco switch network

42 © 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE 1 Chapter 6 42


Download ppt "© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Implement Spanning Tree Protocols (STP) LAN Switching and Wireless – Chapter."

Similar presentations


Ads by Google