1 / 28

CCNA 3 v3.1 Module 7 Spanning Tree Protocol

CCNA 3 v3.1 Module 7 Spanning Tree Protocol. Objectives. Redundancy. Redundant networking topologies are designed to ensure that networks continue to function in the presence of single points of failure. Redundant Topologies.

maylin
Download Presentation

CCNA 3 v3.1 Module 7 Spanning Tree Protocol

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CCNA 3 v3.1 Module 7 SpanningTree Protocol

  2. Objectives

  3. Redundancy Redundant networking topologies are designed to ensure that networks continue to function in the presence of single points of failure.

  4. 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. Simple Redundant Switched Topology

  6. Broadcast Storm

  7.  X sends to Y  frame flooded  frame flooded  Y’s MAC address is not on the MAC address table Multiple Frame Transmissions

  8.  X sends to Y  frame forwarded  A and B incorrectly learn X’s MAC address on port 1  Y’s MAC address is not on the MAC address table Media Access Control Database Instability

  9. Using Bridging Loops for Redundancy allow physical loops, but create a loop free logical topology

  10. Spanning-Tree Protocol Data frames received on blocked links are dropped.

  11. Spanning-Tree Protocol (STP): IEEE 802.1d • Selection of root bridge • Configurations are made by the other switches and bridges, using the root bridge as a reference point. • Each bridge or switch now determines which of its own ports offers the best path to the root bridge (root port). • 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. Spanning Tree Link Costs

  13. A SpanningTree 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. 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. Bridge Protocol Data Unit (BPDU) Bridge protocol data unit (BPDU)

  16. Bridge IDs

  17. 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. BID=4 BID=13 BID=4 BID=21 BID=9 BID=21 BID=9 Electing the Root Bridge (1) No sending 7 BID=13 13 No sending 4 5 21 9 Each switch sendsBPDUs that contain the switch MAC address in both the Root and Sender BID.

  19. Electing the Root Bridge (2) 4<7<13 5<13<21 7 13 9<21 4 5 21 9 4<9<21 A switch receiving the BPDU checks if the Root BID attached with BPDU is less than the Root BID it has recognized.

  20. BID=4 BID=5 BID=5 Electing the Root Bridge (3) 7 13 4 5 BID=9 BID=4 21 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.

  21. Electing the Root Bridge (4) 4<5<13 7 13 4<5<9 4 5 21 9 A switch receiving the BPDU checks if the Root BID attached with BPDU is less than the Root BID it has recognized.

  22. Electing the Root Bridge (5) 7 BID=4 13 4 5 BID=4 21 9 All switches receive the BPDUs and determine that the switch with the lowest root BID value will be the root bridge.

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

  24. 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 secondswith 802.1d).

  25. 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. 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. Rapid Spanning-Tree Port Designations 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. The Rapid SpanningTree Protocol, IEEE 802.1w, will eventually replace the SpanningTree Protocol, IEEE 802.1D.

  28. Summary

More Related