1 / 44

Chap 5 – Implement Spanning Tree Protocol Learning Objectives

Chap 5 – Implement Spanning Tree Protocol Learning Objectives. Explain the role of redundancy in a converged network Summarise how STP works to eliminate Layer 2 loops in a converged network Explain how the STP algorithm uses three steps to converge on a loop-free topology

amos-roberts
Download Presentation

Chap 5 – Implement Spanning Tree Protocol Learning Objectives

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. Chap 5 – Implement Spanning Tree Protocol Learning Objectives • Explain the role of redundancy in a converged network • Summarise how STP works to eliminate Layer 2 loops in a converged network • 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

  2. Switched Network Redundant Paths • Layer 2 redundancy improves the availability of the network by implementing alternate network paths. • Having multiple paths for data to traverse the network allows for a single path to be disrupted without impacting the connectivity of devices on the network. Data Data

  3. Switching Loops • The addition of redundant paths creates switching loops. These can lead to the following problems: • Broadcast Storms • Multiple Frame Transmission • MAC Database Instability

  4. Switched Network Broadcast Storm • When multiple paths exist between two devices on a network, a Layer 2 loop can occur. • Ethernet frames do not have a time to live (TTL) like IP packets traversing routers, so they continue to bounce from switch to switch endlessly or until a link is disrupted and breaks the loop. Data Data

  5. Switched Network Broadcast Storm • A broadcast storm occurs when there are so many broadcast frames caught in a Layer 2 loop that all available bandwidth is consumed, and the network becomes unavailable for data communication. • A broadcast storm is inevitable on a looped network. As more devices send broadcasts out on the network, more and more traffic gets caught in the loop, eventually creating a broadcast storm that causes the network to fail. Data Data Data Data Data Data Data Data

  6. Switch Redundancy – Multiple Frame Transmission • Both switches flood the frame from Server X. • Therefore Router Y receives two copies of the frame.

  7. Switch Redundancy – MAC Database Instability • A switch can incorrectly learn that a MAC address is on one port, when it is actually on a different port

  8. Spanning Tree Protocol (STP) • The solution is to allow physical loops, but create a loop free logical topology. • The loop free logical topology created is called a tree. • This topology is a star or extended star logical topology - the spanning-tree of the network. • It is a spanning-tree because all devices in the network are reachable or spanned. • The algorithm used to create this loop free logical topology is the spanning-tree algorithm. • This algorithm can take a relatively long time to converge. • A new algorithm called the rapid spanning-tree algorithm was developed to reduce the time for a network to compute a loop free logical topology.

  9. Spanning Tree Protocol (STP) • STP ensures that there is only one logical path between all destinations on the network by intentionally blocking redundant paths that could cause a loop. • A port is considered blocked when network traffic is prevented from entering or leaving that port. Blocked Blocked • The switches running STP are able to compensate for failures by dynamically unblocking the previously blocked ports and permitting traffic to traverse the alternate paths.

  10. Spanning Tree Protocol (802.1d) • As a result, for every switched network the following elements exist: • One root bridge per network • One root port per non-root bridge (forwarding) • One designated port per segment (forwarding) • Unused, or non-designated ports (blocking)

  11. Bridge Protocol Data Unit • BPDUs contain information that allow switches to perform • specific actions: • Select a single switch that will act as the root of the spanning-tree. • Calculate the shortest path from itself to the root switch. • Designate one of the switches as the closest one to the root, for each LAN segment. This switch is called the designated switch. The designated switch handles all communication from that LAN segment towards the root bridge. • Each non-root switch chooses one of its ports as its root port - the interface that gives the best path to the root switch. • Select ports that are part of the spanning-tree. These ports are called designated ports. Non-designated ports are blocked.

  12. Bridge Protocol Data Unit • The BID consists of a bridge priority that defaults to 32768 (0x8000) and the switch MAC address. • By default BPDUs are sent every two seconds. Cisco Catalyst switch uses one of the MAC addresses from a pool of MAC addresses that are assigned to the switch backplane or supervisory module

  13. Spanning Tree Protocol (802.1d) • When the spanning tree is creating a loop-free Logical topology, it always uses the same 4-step decision sequence: • Lowest root Bridge ID (BID) • Lowest path cost to root bridge • Lowest sender bridge ID • Lowest port ID

  14. Spanning Tree Protocol (802.1d) • All switches in the broadcast domain participate in the election process. After a switch boots, it sends out BPDU frames containing the switch BID and the root ID every 2 seconds. • Eventually, the switch with the lowest BID ends up being identified as the root bridge for the spanning-tree instance.

  15. Spanning Tree Protocol (802.1d) Redundant links that are not part of the shortest path tree are blocked • Shortest path is based on cumulative link costs. • Link costs are based on the speed of the link

  16. Spanning Tree Costs • To configure the port cost of an interface, enter the spanning-tree cost value command in interface configuration mode. • The range value can be between 1 and 200,000,000. • Verify the port and path cost to the root bridge using show spanning-tree privileged EXEC mode command. The Cost field in the output is the total path cost to the root bridge. • In the output, each interface is also identified with an individual port cost of 19.

  17. Port States • 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. • 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. • Learning - The port prepares to participate in frame forwarding and begins to populate the MAC address table. • Forwarding - The port is considered part of the active topology and forwards frames and also sends and receives BPDU frames. • 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.

  18. BPDU Timers Blocking (Loss of BPDU detected) (max age = 20 secs) Blocking (moves to listening after decides whether it is a root or designated port) Listening (forward delay = 15 secs) Link comes up • Ports transition from the blocking state to the listening state. In this state, switches determine if there are any other paths to the root bridge. • The path that is not the least cost path to the root bridge returns to the blocking state. The listening period is called the forward delay and lasts for 15 seconds. • In the listening state, data is not forwarded and MAC addresses are not learned, but BPDUs are still processed. Learning (forward delay = 15 secs) Forwarding (forward delay = 15 secs)

  19. BPDU Timers Blocking (Loss of BPDU detected) (max age = 20 secs) Blocking (moves to listening after decides whether it is a root or designated port) Listening (forward delay = 15 secs) Link comes up • Ports transition from the listening state to the learning state. • In this state, data is not forwarded, but MAC addresses are learned from traffic that is received. • The learning state lasts for 15 seconds and is also called the forward delay. BPDUs are still processed. Learning (forward delay = 15 secs) Forwarding (forward delay = 15 secs)

  20. BPDU Timers Blocking (Loss of BPDU detected) (max age = 20 secs) Blocking (moves to listening after decides whether it is a root or designated port) Listening (forward delay = 15 secs) Link comes up • Ports transitions from the learning state to the forwarding state. • In this state user data is forwarded and MAC addresses continue to be learned. BPDUs are still processed. Learning (forward delay = 15 secs) Forwarding (forward delay = 15 secs)

  21. Spanning Tree Protocol Portfast • When a switch port configured with PortFast is configured as an access port, it transitions from blocking to forwarding state immediately, bypassing the typical STP listening and learning states. Fa0/8 Fa0/9 Fa0/10 Fa0/11

  22. Root Election - Inferior BPDU • When a switch first starts up, it assumes it is the root switch and sends BPDUs that contain its own MAC address in both the root and sender BID

  23. Root Election Process S3 S1 Cost = 19 • BID=2222.2222.2222 • Priority = 1 • BID=1111.1111.1111 • Priority = 1 Fa0/1 Fa0/1 Fa0/2 Fa0/2 Cost = 19 Cost = 19 Fa0/2 Fa0/2 Fa0/1 Fa0/1 • BID=3333.3333.3333 • Priority = 1 • BID=4444.4444.4444 • Priority = 1 Cost = 19 S2 S4

  24. Root Election Process • Initially, all switch ports are configured for the blocking state, which by default lasts 20 seconds. This is done to prevent a loop from occurring before STP has had time to calculate the best root paths and configure all switch ports to their specific roles. • While the switch ports are in a blocking state, they are still able to send and receive BPDU frames so that the spanning-tree root election can proceed. • Spanning tree supports a maximum network diameter of seven switch hops from end to end. This allows the entire root bridge election process to occur within 14 seconds, which is less than the time the switch ports spend in the blocking state.

  25. Root Election Process • Upon completion of the root bridge election process, the switches continue to forward their BPDU frames advertising the root ID of the root bridge every 2 seconds. • Each switch is configured with a max age timer that determines how long a switch retains the current BPDU configuration in the event it stops receiving updates from its neighboring switches. By default, the max age timer is set to 20 seconds. • Therefore, if a switch fails to receive 10 consecutive BPDU frames from one of its neighbors, the switch assumes that a logical path in the spanning tree has failed and that the BPDU information is no longer valid. This triggers another spanning-tree root bridge election.

  26. Configure BID Priority Spanning-tree vlan 1 priority command provides manual setting of the bridge priority value. The priority value is configured in increments of 4096 between 0 and 65536.

  27. Configure BID Priority • The spanning-tree vlan 1 root primary command sets priority for the switch is set to the predefined value of 24576 or to the next 4096 increment value below the lowest bridge priority detected on the network. • This command sets the priority for the switch to the predefined value of 28672. • This ensures that this switch becomes the root bridge if the primary root bridge fails and a new root bridge election occurs and assuming that the rest of the switches in the network have the default 32768 priority value defined.

  28. STP Port Roles • The root port exists on non-root bridges and is the switch port with the best path to the root bridge. Root ports forward traffic toward the root bridge. • The designated port exists on root and non-root bridges. For root bridges, all switch ports are designated ports. For non-root bridges, a designated port is the switch port that receives and forwards frames toward the root bridge as needed. Only one designated port is allowed per segment. • The non-designated port is a switch port that is blocked, so it is not forwarding data frames and not populating the MAC address table with source addresses. A non-designated port is not a root port or a designated port. For some variants of STP, the non-designated port is called an alternate port.

  29. Root Port Election Process S3 S1 - Root Root Port Cost = 19 • BID=2222.2222.2222 • Priority = 1 • BID=1111.1111.1111 • Priority = 1 Fa0/1 Fa0/1 Fa0/2 Fa0/2 Cost = 19 Cost = 19 Root Port Root Port Fa0/2 Fa0/2 Fa0/1 Fa0/1 • BID=3333.3333.3333 • Priority = 1 • BID=4444.4444.4444 • Priority = 1 Cost = 19 S2 S4

  30. Configure Port Priority • he port priority for port F0/1 has been set to 112, which is below the default port priority of 128. This ensures that the port is the preferred port when competing with another port for a specific port role. • When the switch decides to use one port over another for the root port, the other is configured as a non-designated port to prevent a loop from occurring.

  31. Designated Port Election Process S3 S1 - Root Root Port Cost = 19 • BID=2222.2222.2222 • Priority = 1 • BID=1111.1111.1111 • Priority = 1 Fa0/1 Fa0/1 Fa0/2 Designated Port Fa0/2 Designated Port Designated Port Cost = 19 Cost = 19 Non-Designated Port (Blocking) Root Port Root Port Designated Port Fa0/2 Fa0/2 Fa0/1 Fa0/1 • BID=3333.3333.3333 • Priority = 1 • BID=4444.4444.4444 • Priority = 1 Cost = 19 S2 S4

  32. STP Variants

  33. Per-VLAN spanning tree Protocol (PVST) Root for VLAN 10 Root for VLAN 20 VLAN 10 VLAN 20 S3 S1 S2 Fa0/3 Fa0/2 • VLAN 10 – Forwarding • VLAN 20 - Blocking • VLAN 10 – Blocking • VLAN 20 - Forwarding • Cisco developed PVST+ so that a network can run an STP instance for each VLAN in the network. • With PVST+, more than one trunk can block for a VLAN and load sharing can be implemented

  34. Per-VLAN spanning tree Protocol (PVST) BID = Priority + VLAN ID + MAC Address Example: BID = 32768 + 10 + 000A.0033.333 BID = 32778.000A.0033.333

  35. Per-VLAN spanning tree Protocol (PVST) Root for VLAN 10 Root for VLAN 20 VLAN 10 VLAN 20 S3 S1 S2 Fa0/3 Fa0/2 • VLAN 10 – Forwarding • VLAN 20 - Blocking • VLAN 10 – Blocking • VLAN 20 - Forwarding

  36. Rapid spanning tree Protocol (RTSP) STP Root Root Des S3 S1 Des Des S2 Fa0/3 Fa0/2 Alt Root • RSTP (IEEE 802.1w) is an evolution of the 802.1D standard. The 802.1w STP terminology remains primarily the same as the IEEE 802.1D STP terminology. • Uses alternate port instead of blocking ports in discarding state. Notice that there are no blocking ports. RSTP defines port states as discarding, learning, or forwarding.

  37. Rapid spanning tree Protocol (RTSP) RSTP sends BPDUs and populates the flag byte in a slightly different manner than in 802.1D: • Protocol information can be immediately aged on a port if hellos are not received for 3 consecutive hello times, 6 seconds by default, or if the max age timer expires. • Because BPDUs are used as a keepalive mechanism, three consecutively missed BPDUs indicate lost connectivity between a bridge and its neighboring root or designated bridge. The fast aging of the information allows failures to be detected quickly.

  38. RTSP – Edge Ports STP Root Edge Edge Root Des Edge Edge S3 S1 Des Des S2 Fa0/3 Fa0/2 Alt Root • An RSTP edge port is a switch port that is never intended to be connected to another switch device. It immediately transitions to the forwarding state when enabled. • Corresponds to the Cisco PortFast feature - ports immediately transition to the STP forwarding state, thereby skipping the time-consuming listening and learning stages.

  39. RTSP Port States and Roles • Discarding - This state is seen in both a stable active topology and during topology synchronization and changes. The discarding state prevents the forwarding of data frames, thus "breaking" the continuity of a layer 2 loop. • Learning - This state is seen in both a stable active topology and during topology synchronization and changes. The learning state accepts data frames to populate the MAC table in an effort to limit flooding of unknown unicast frames. • Forwarding - This state is seen only in stable active topologies. The forwarding switch ports determine the topology. Following a topology change, or during synchronization, the forwarding of data frames occurs only after a proposal and agreement process.

  40. RTSP – Proposal & Agreement STP Root Edge Edge Root Des Edge Edge S3 S1 Des Des Agree Change S2 Root Alt Root Propose Change • RSTP significantly speeds up the recalculation process after a topology change, because it converges on a link-by-link basis and does not rely on timers expiring before ports can transition

  41. Configure Rapid PVST+ VLAN 10 VLAN 20 S3 S1 802.1q Trunk S2 Fa0/2 Rapid PVST+ is a Cisco implementation of RSTP. It supports spanning tree for each VLAN and is the rapid STP variant to use in Cisco-based networks.

  42. Any Questions?

  43. Chap 5.5.1 – Basic STP Config PC4 172.17.10.27/24 Lab Topology S3 S1 Fa0/2 Fa0/1 Fa0/3 Fa0/2 Fa0/1 S2 Fa0/1 Fa0/2 Fa0/11 Fa0/18 Fa0/6 PC1 172.17.10.21/24 PC2 172.17.10.22/24 PC3 172.17.10.23/24

  44. Chap 5.5.2 – Challange STP Config Lab Topology S3 S1 Fa0/1 Fa0/1 Fa0/2 Fa0/2 S2 Port Assignment Fa0/3 Fa0/4 Fa0/3 Fa0/4 Fa0/2 Fa0/3 S2 Fa0/1 – 0/4 Fa0/1 Fa0/4 Fa0/5 – 0/10 Fa0/11 Fa0/6 Fa0/18 PC1 172.17.10.21/24 PC2 172.17.20.22/24 PC3 172.17.30.23/24 172.17.10.12 172.17.20.12

More Related