0% found this document useful (0 votes)
10 views1 page

STP Concepts

Uploaded by

szymongazinski
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views1 page

STP Concepts

Uploaded by

szymongazinski
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

STP – Spanning Tree Protocol

In normal situation, STP blocks port to a redundant switch to prevent a loop.

When there is a network failure, STP unblocks a blocked port to make redundant switch make its
work.

Loops occur with layer 2 frames. F. e. layer 3 packets have TTL header in IPv4 or Hop limit on IPv6 to
prevent it.

Spanning Tree algorithm:


1. Selecting root bridge – one switch is chosen as a root bridge and every switch is choosing
shortest path to it
2. Ports that were not chosen as the best paths are blocked

3. Link failure causes recalculation in selecting best paths

During STA and STP functions, switches use Bridge Protocol Data Units (BPDUs) to share information
about themselves and their connections. BPDUs are used to elect the root bridge, root ports,
designated ports, and alternate ports. Each BPDU contains a bridge ID (BID) that identifies which
switch sent the BPDU. The BID is involved in making many of the STA decisions including root bridge
and port roles. As shown in the figure, the BID contains a priority value, an extended system ID, and
the MAC address of the switch. The lowest BID value is determined by the combination of these
three fields.

You might also like