Home > Articles

31 Days Before Your CCNA Routing and Switching Exam: Spanning Tree Protocols

📄 Contents

  1. CCNA 200-101 ICND2 Exam Topics / Key Topics
  2. STP Varieties
  3. Study Resources
  • Print
  • + Share This
  • 💬 Discuss
This chapter is from the book
This step in preparing for the CCNA Routing and Switching exam covers STP and its variations — standards that allow for redundant switched networks without worrying about switching loops.

CCNA 200-101 ICND2 Exam Topics

  • Identify enhanced switching technologies

Key Topics

Part I focuses on switching technologies, including Spanning Tree Protocol (STP), EtherChannel, and first-hop redundancy protocols (FHRPs). Today’s review covers STP and its variations, standards that allow for redundant switched networks without worrying about switching loops.

STP Concepts and Operation

One of the key characteristics of a well-built communications network is its resiliency. This means that the network needs to be able to handle a device or link failure through redundancy. A redundant topology can eliminate a single point of failure by using multiple links, multiple devices, or both. Spanning Tree Protocol (STP) helps to prevent loops in a redundant switched network. Figure 31-1 shows an example of a three-layer topology (core, distribution, access) with redundant links.

Figure 31-1

Figure 31-1 Redundant Switched Topology

Without STP, redundancy in the switched network could introduce the following issues:

  • Broadcast storms: Each switch floods broadcasts endlessly, called a broadcast storm.
  • Multiple frame transmission: Multiple copies of unicast frames may be delivered to the destination, causing unrecoverable errors.
  • MAC database instability: Instability in the content of the MAC address table results from copies of the same frame being received on different ports of the switch.

STP Algorithm

STP is an IEEE committee standard defined as 802.1D. STP places certain ports in the blocking state so that they do not listen to, forward, or flood data frames. STP creates a tree that ensures that only one path exists to each network segment at any one time. Then, if any segment experiences a disruption in connectivity, STP rebuilds a new tree by activating the previously inactive, but redundant, path.

The algorithm used by STP chooses the interfaces that should be placed into a forwarding state. For any interfaces not chosen to be in a forwarding state, STP places the interfaces in blocking state.

Switches exchange STP configuration messages every 2 seconds by default using a multicast frame called the bridge protocol data unit (BPDU). One of the pieces of information included in the BPDU is the bridge ID (BID).

As shown in Figure 31-2, the BID is unique to each switch and is composed of a priority value (2 bytes) and the bridge MAC address (6 bytes).

Figure 31-2

Figure 31-2 Bridge ID

The default priority is 32,768. The root bridge is the bridge with the lowest BID. Therefore, if the default priority value is not changed, the switch with the lowest MAC address becomes root.

STP Convergence

STP convergence is the process by which the switches collectively realize that something has changed in the LAN topology and so the switches might need to change which ports block and which ports forward. The following steps summarize the STP algorithm used to achieve convergence:

  • Step 1 Elect a root bridge (switch with lowest BID). There can be only one root bridge per network. All ports on the root bridge are forwarding ports.
  • Step 2 Elect a root port for each nonroot switch, based on lowest root path cost. Each nonroot switch has one root port. The root port is the port through which the nonroot bridge has its best path to the root bridge.
  • Step 3 Elect a designated port for each segment, based on the lowest root path cost. Each link will have one designated port.
  • Step 4 The root ports and designated ports transition to the forwarding state, and the other ports stay in the blocking state.

Table 31-1 summarizes the reasons STP places a port in forwarding or blocking state.

Table 31-1 STP: Reasons for Forwarding or Blocking

Characterization of Port

STP State

Description

All the root switch’s ports

Forwarding

The root switch is always the designated switch on all connected segments.

Each nonroot switch’s root port

Forwarding

The port through which the switch has the least cost to reach the root switch.

Each LAN’s designated port

Forwarding

The switch forwarding the lowest-cost BPDU onto the segment is the designated switch for that segment.

All other working ports

Blocking

The port is not used for forwarding frames, nor are any frames received on these interfaces considered for forwarding.

Port bandwidth is used to determine the cost to reach the root bridge. Table 31-2 lists the default port costs defined by IEEE, which had to be revised with the advent of 10-Gbps ports.

Table 31-2 Default IEEE Port Costs

Ethernet Speed

Original IEEE Cost

Revised IEEE Cost

10 Mbps

100

100

100 Mbps

10

19

1 Gbps

1

4

10 Gbps

1

2

STP uses the four states shown in Figure 31-3 as a port transitions from blocking to forwarding.

Figure 31-3

Figure 31-3 Spanning Tree Port States

A fifth state, disabled, occurs either when a network administrator manually disables the port or a security violation disables the port.

  • + Share This
  • 🔖 Save To Your Account

Discussions

comments powered by Disqus