Spanning Tree
46
4.2 Rules for Creating the Tree Struc-
ture
Redundancy
Release 6.0 07/2010
4.2 Rules for Creating the Tree
Structure
4.2.1 Bridge information
To determine the tree structure, the bridges need more detailed information
about the other bridges located in the network.
To obtain this information, each bridge sends a BPDU (Bridge Protocol Data
Unit) to the other bridges.
The contents of a BPDU include
X
bridge identifier,
X
root path cost and
X
port identifier
(see IEEE 802.1D).
4.2.2 Setting up the tree structure
X
The bridge with the smallest number for the bridge identifier is called the
root bridge. It is (or will become) the root of the tree structure.
X
The structure of the tree depends on the root path costs. STP selects the
structure so that the path costs between each individual bridge and the
root bridge become as small as possible.
X
If more than 1 path exists with the same root path costs, the priority of the
bridge identifier for the bridge connected to one of these paths decides
which bridge should block.
Summary of Contents for MACH 1040 Series
Page 8: ...Key 8 Redundancy Release 6 0 07 2010...
Page 12: ...Introduction 12 1 2 Overview of Redundancy Protocols Redundancy Release 6 0 07 2010...
Page 26: ...Ring Redundancy 26 2 2 Example of an MRP Ring Redundancy Release 6 0 07 2010...
Page 38: ...Multiple Rings 38 3 1 Sub Ring Redundancy Release 6 0 07 2010...
Page 76: ...Index 76 4 7 Combining RSTP and MRP Redundancy Release 6 0 07 2010...
Page 78: ......