1. 1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.1 Module 7 Spanning Tree Protocol

2. 222 © 2004, Cisco Systems, Inc. All rights reserved. Objectives

3. 333 © 2004, Cisco Systems, Inc. All rights reserved. Redundancy Redundant networking topologies are designed to ensure that networks continue to function in the presence of single points of failure.

4. 444 © 2004, Cisco Systems, Inc. All rights reserved. Redundant Topologies A goal of redundant topologies is to eliminate network outages caused by a single point of failure. All networks need redundancy for enhanced reliability.

5. 555 © 2004, Cisco Systems, Inc. All rights reserved. Simple Redundant Switched Topology

6. 666 © 2004, Cisco Systems, Inc. All rights reserved. Broadcast Storm

7. 777 © 2004, Cisco Systems, Inc. All rights reserved. Multiple Frame Transmissions  Y’s MAC address is not on the MAC address table  X sends to Y  frame flooded  frame flooded

8. 888 © 2004, Cisco Systems, Inc. All rights reserved. Media Access Control Database Instability  Y’s MAC address is not on the MAC address table  X sends to Y  frame forwarded  A and B incorrectly learn X’s MAC address on port 1

9. 999 © 2004, Cisco Systems, Inc. All rights reserved. Using Bridging Loops for Redundancy allow physical loops, but create a loop free logical topology

10. 10 © 2004, Cisco Systems, Inc. All rights reserved. Spanning-Tree Protocol Data frames received on blocked links are dropped.

11. 11 © 2004, Cisco Systems, Inc. All rights reserved. Spanning-Tree Protocol (STP): IEEE 802.1d 1.Selection of root bridge 2.Configurations are made by the other switches and bridges, using the root bridge as a reference point. 3.Each bridge or switch now determines which of its own ports offers the best path to the root bridge (root port). 4.The logical loop is removed by one of the switches or bridges by blocking the port that creates the logical loop. Blocking is done by calculating costs for each port in relation to the root bridge. Then the port with the highest cost is disabled.

12. 12 © 2004, Cisco Systems, Inc. All rights reserved. Spanning Tree Link Costs

13. 13 © 2004, Cisco Systems, Inc. All rights reserved. A Spanning Tree One Designated Port per segment. Through this port the segment has the minimum cost to the root bridge. The switch that has a designated port for some segment is the Designated Bridge for that segment.

14. 14 © 2004, Cisco Systems, Inc. All rights reserved. Spanning-Tree Operation One root bridge per network. One root port per nonroot bridge. One designated port per segment. Nondesignated ports are unused. designated switch handles all communication from that LAN segment towards the root bridge.

15. 15 © 2004, Cisco Systems, Inc. All rights reserved. Bridge Protocol Data Unit (BPDU) Bridge protocol data unit (BPDU)

16. 16 © 2004, Cisco Systems, Inc. All rights reserved. Bridge IDs

17. 17 © 2004, Cisco Systems, Inc. All rights reserved. Inferior BPDU When a switch first starts up, it assumes it is the root switch and sends BPDUs that contain the switch MAC address in both the root and sender BID.

18. 18 © 2004, Cisco Systems, Inc. All rights reserved. 5 21 13 7 4 9 BID=21 Each switch sends BPDUs that contain the switch MAC address in both the Root and Sender BID. BID=4 BID=13 BID=9 Electing the Root Bridge (1) BID=4 BID=13 No sending

19. 19 © 2004, Cisco Systems, Inc. All rights reserved. 5 21 13 7 4 9 A switch receiving the BPDU checks if the Root BID attached with BPDU is less than the Root BID it has recognized. Electing the Root Bridge (2) 4<7<13 4<9<21 9<21 5<13<21

20. 20 © 2004, Cisco Systems, Inc. All rights reserved. 5 21 13 7 4 9 BID=9 If a new Root BID is found, the switch sends out a new BPDU containing the new Root BID to all ports except the one the new Root BID was received. BID=5 BID=4 Electing the Root Bridge (3) BID=5

21. 21 © 2004, Cisco Systems, Inc. All rights reserved. 5 21 13 7 4 9 A switch receiving the BPDU checks if the Root BID attached with BPDU is less than the Root BID it has recognized. Electing the Root Bridge (4) 4<5<9 4<5<13

22. 22 © 2004, Cisco Systems, Inc. All rights reserved. 5 21 13 7 4 9 BID=4 All switches receive the BPDUs and determine that the switch with the lowest root BID value will be the root bridge. Electing the Root Bridge (5) BID=4

23. 23 © 2004, Cisco Systems, Inc. All rights reserved. Spanning-Tree Port States Ports can only receive BPDUs. Data frames are discarded and no addresses can be learned. Determine if there are any other paths to the root bridge. Data is not forwarded, but MAC addresses are learned For details go into Interactive Media Activity in 7.2.5

24. 24 © 2004, Cisco Systems, Inc. All rights reserved. Spanning-Tree Recalculation A switched internetwork has converged when all the switch and bridge ports are in either the forwarding or blocked state (can take up to 50 seconds with 802.1d).

25. 25 © 2004, Cisco Systems, Inc. All rights reserved. Rapid Spanning-Tree Protocol The standard and protocol introduce the following: Clarification of port states and roles Definition of a set of link types that can go to forwarding state rapidly Allowing switches, in a converged network, to generate their own BPDUs rather than relaying root bridge BPDUs

26. 26 © 2004, Cisco Systems, Inc. All rights reserved. The blocking state of a port is renamed as the discarding state. The role of a discarding port is that of an alternate port. The discarding port can become the designated port if the designated port of the segment fails.

27. 27 © 2004, Cisco Systems, Inc. All rights reserved. Rapid Spanning-Tree Port Designations The Rapid Spanning Tree Protocol, IEEE 802.1w, will eventually replace the Spanning Tree Protocol, IEEE 802.1D. Link types have been defined as point-to-point, edge-type, and shared. Point-to-point links and edge-type links can go to the forwarding state immediately.

28. 28 © 2004, Cisco Systems, Inc. All rights reserved. Summary